Some Computational Complexity Results for Synchronous Context-Free Grammars.

Giorgio Satta, Enoch Peserico

Browse the full NAACL paper archive.