Generalized multitext grammars

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn , Issue , 2004, Pages 661-668

  Melamed, I Dan ^a   Satta, Giorgio ^b   Wellington, Benjamin ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; NATURAL LANGUAGE PROCESSING SYSTEMS;

COMPONENT GRAMMARS; CONTEXT-FREE; CONTEXT-FREE GRAMMARS; GENERALISATION; GENERATIVE CAPACITY; GRAMMAR FORMALISMS; PARALLEL TEXT; POWER; REWRITING SYSTEMS; SYNCHRONOUS GRAMMARS;

CONTEXT FREE GRAMMARS;

EID: 25844529923     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. A. Aho and J. Ullman. 1969. Syntax directed translations and the pushdown assembler. Journal of Computer and System Sciences, 3:37–56, February.
2. T. Becker, A. Joshi, and O. Rambow. 1991. Long-distance scrambling and tree adjoining grammars. In Proceedings of the 5th Meeting of the European Chapter of the Association for Computational Linguistics (EACL), Berlin, Germany.
3. E. Bertsch and M. J. Nederhof. 2001. On the complexity of some extensions of RCG parsing. In Proceedings of the 7th International Workshop on Parsing Technologies (IWPT), pages 66–77, Beijing, China.
4. M. Dras and T. Bleam. 2000. How problematic are clitics for S-TAG translation? In Proceedings of the 5th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+5), Paris, France.
5. J. Hopcroft, R. Motwani, and J. Ullman. 2001. Introduction to Automota Theory, Languages and Computation. Addison-Wesley, USA.
6. I. Dan Melamed, G. Satta, and B. Wellington. 2004. Generalized multitext grammars. Technical Report 04-003, NYU Proteus Project. http://nlp.cs.nyu.edu/pubs/.
7. 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 (HLT-NAACL), pages 158–165, Edmonton, Canada.
8. 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.
9. O. Rambow and G. Satta. 1996. Synchronous models of language. In Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics (ACL), Santa Cruz, USA.
10. O. Rambow and G. Satta. 1999. Independent parallelism in finite copying parallel rewriting systems. Theoretical Computer Science, 223:87–120, July.
11. O. Rambow. 1995. Formal and Computational Aspects of Natural Language Syntax. Ph.D. thesis, University of Pennsylvania, Philadelphia, PA.
12. S. Shieber. 1994. Restricting the weak-generative capactiy of synchronous tree-adjoining grammars. Computational Intelligence, 10(4):371–386.
13. D. J. Weir. 1988. Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania.
14. D. Wu. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics, 23(3):377–404, September.
15. D. H. Younger. 1967. Recognition and parsing of context-free languages in time n3. Information and Control, 10(2):189–208, February.