Some computational complexity results for synchronous context-free grammars (2005)

by Giorgio Satta, Enoch Peserico
Venue:In Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing (HLT/EMNLP