Range concatenation grammars for translation

Coling 2008 - 22nd International Conference on Computational Linguistics, Proceedings of the Conference

Volumn 1, Issue , 2008, Pages 103-106

  Søgaard, Anders ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY PREDICATES; PARALLEL CORPORA; PARSING ALGORITHM; RANGE CONCATENATION GRAMMARS; TRANSLATION UNIT;

COMPUTATIONAL LINGUISTICS;

TRANSLATION (LANGUAGES);

EID: 80053417548     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Bertsch, Eberhard and Mark-Jan Nederhof. 2001. On the complexity of some extensions of RCG parsing. In Proceedings of the 7th International Workshop on Parsing Technologies, pages 66-77, Beijing, China.
2. Boullier, Pierre. 1998. Proposal for a natural language processing syntactic backbone. Technical report, FNRIA, Le Chesnay, France.
3. Boullier, Pierre. 2000. A cubic time extension of context-free grammars. Grammars, 3(2-3): 111-131.
4. Eisner, Jason. 2003. Learning non-isomorphic tree mappings for machine translation. In Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, pages 205-208, Sapporo, Japan.
5. Graca, Joao, Joana Pardal, Luisa Coheur, and Diamantino Caseiro. 2008. Building a golden collection of parallel multi-language word alignments. In Proceedings of the 6th International Conference on Language Resources and Evaluation, Marrakech, Morocco.
6. Maier, Wolfgang and Anders Søgaard. 2008. Treebanks and mild context-sensitivity. In Proceedings of the 13th Conference on Formal Grammar, Hamburg, Germany.
7. Melamed, Dan, Giorgio Satta, and Benjamin Wellington. 2004. Generalized multitext grammars. In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, pages 661-668, Barcelona, Spain.
8. Shieber, Stuart and Yves Schabes. 1990. Synchronous tree-adjoining grammars. In Proceedings of the 13th Conference on Computational Linguistics, pages 253-258, Helsinki, Finland.
9. Weir, David. 1988. Characterizing mildly context-sensitive grammar formalisms. Ph.D. thesis, University of Pennsylvania, Philadelphia, Pennsylvania.
10. Wellington, Benjamin, Sonjia Waxmonsky, and Dan Melamed. 2006. Empirical lower bounds on the complexity of translational equivalence. In Proceedings of the 44th Annual Conference of the Association for Computational Linguistics, pages 977-984, Sydney, Australia.
11. Wu, Dekai. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics, 23(3): 377-403.
12. 3. Information and Control, 10(2): 189-208.
13. Zens, Richard and Hermann Ney. 2003. A comparative study on reordering constraints in statistical machine translation. In Proceedings of the 41st Annual Meeting on Association for Computational Linguistics, pages 144-151, Sapporo, Japan.