Giorgio Satta Enoch Peserico Some Computational Complexity Results for Synchronous Context-Free Grammars. 2005 conf/naacl/2005 HLT/EMNLP http://acl.ldc.upenn.edu/H/H05/H05-1101.pdf db/conf/naacl/naacl2005.html#SattaP05