Some computational complexity results for synchronous context-free grammars

HLT/EMNLP 2005 - Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference

Volumn , Issue , 2005, Pages 803-810

  Satta, Giorgio ^a   Peserico, Enoch ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; TRANSLATION (LANGUAGES);

COMPUTATIONAL PROBLEM; EXPONENTIAL TIME; HARDNESS RESULT; LOWER BOUNDS; ON-MACHINES; PROBABILISTIC CONTEXT FREE GRAMMARS; SYNCHRONOUS CONTEXT-FREE GRAMMARS; TRANSLATION MODELS;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 34250023766     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1220575.1220676     Document Type: Conference Paper

References (24)

1. A. V. Aho and J. D. Ullman. 1972. The Theory of Parsing, Translation and Compiling, volume 1. Prentice-Hall, Englewood Cliffs, NJ.
2. Hiyan Alshawi, Srinivas Bangalore, and Shona Douglas. 2000. Learning dependency translation models as collections of finite state head transducers. Computational Linguistics, 26(1):45-60, March.
3. Peter F. Brown, John Cocke, Stephen A. Della Pietra, Vincent J. Della Pietra, Fredrick Jelinek, Robert L. Mercer, and Paul Roossin. 1988. A statistical approach to language translation. In Proceedings of the International Conference on Computational Linguistics (COLING) 1988, pages 71-76, Budapest, Hungary, August.
4. F. Casacuberta and C. de la Higuera. 2000. Computational complexity of problems on probabilistic grammars and transducers. In L. Oliveira, editor, Grammatical Inference: Algorithms and Applications; 5th International Colloquium, ICGI 2000, pages 15-24. Springer.
5. D. Chiang. 2004. Evaluating Grammar Formalisms for Applications to Natural Language Processing and Byological Sequence Analysis. Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania.
6. D. Chiang. 2005. A hierarchical phrase-based model for statistical machine translation. In Proc. of the 43rd ACL, pages 263-270.
7. M. R. Garey and D. S. Johnson. 1979. Computers and Intractability. Freeman and Co., New York, NY.
8. Daniel Gildea. 2003. Loosely tree-based alignment for machine translation. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), Sapporo, Japan, July.
9. Y. Kaji et al. 1994. The computational complexity of the universal recognition problem for parallel multiple context-free grammars. Computational Intelligence, 10(4):440-452.
10. Kevin Knight. 1999. Decoding complexity in wordreplacement translation models. Computational Linguistics, Squibs and Discussion, 25(4).
11. S. Kumar and W. Byrne. 2003. A weighted finite state transducer implementation of the alignment template model for statistical machine translation. In Proceedings of HLT-NAACL.
12. R. B. Lyngso and C. N. S. Pedersen. 2002. The consensus string problem and the complexity of comparing hidden markov models. Journal of Computing and System Science, 65:545-569.
13. Fred J. Maryanski and Michael G. Thomason. 1979. Properties of stochastic syntax-directed translation schemata. International Journal of Computer and Information Sciences, 8(2):89-110.
14. I. Dan Melamed, Giorgio Satta, and Benjamin Wellington. 2004. Generalized multitext grammars. In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL), Barcelona, Spain.
15. I. Dan Melamed. 2003. Multitext grammars and synchronous parsers. In Proceedings of the Human Language Technology Conference and the North American Association for Computational Linguistics (HLTNAACL), pages 158-165, Edmonton, Canada.
16. I. Dan Melamed. 2004. Statistical machine translation by parsing. In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL), Barcelona, Spain.
17. Franz Josef Och and Hermann Ney. 2002. Discriminative training and maximum entropy models for statistical machine translation. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), Philadelphia, July.
18. Franz Josef Och, Christoph Tillmann, and Hermann Ney. 1999. Improved alignment models for statistical machine translation. In Proceedings of the 4nd Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 20-28, College Park, Maryland.
19. th ACL, Newark, Delaware.
20. E. Vidal, F. Thollard, C. de la Higuera, F. Casacuberta, and R. C. Carrasco. 2005. Probabilistic finite-state machines - Part I. IEEE Trans. on Pattern analysis and Machine Intelligence. To appear.
21. C. S. Wetherell. 1980. Probabilistic languages: A review and some open questions. Computing Surveys, 12(4):361-379.
22. Dekai Wu and Hongsing Wong. 1998. Machine translation with a stochastic grammatical channel. In Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics (ACL), Montreal, Canada, July.
23. Dekai Wu. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics, 23(3):377-404, September.
24. Kenji Yamada and Kevin Knight. 2001. A syntax-based statistical translation model. In Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics (ACL), pages 531-538, Toulouse, July.