Minimal recursion semantics as dominance constraints: Translation, evaluation, and analysis

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn , Issue , 2004, Pages 247-254

  Fuchss, Ruth ^a   Koller, Alexander ^a   Niehren, Joachim ^b   Thater, Stefan ^a  

^a SAARLAND UNIVERSITY   (Germany)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

TRANSLATION (LANGUAGES);

EVALUATION AND ANALYSIS; MINIMAL RECURSION SEMANTICS; RESOURCE GRAMMARS;

SEMANTICS;

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

References (13)

1. H. Alshawi and R. Crouch. 1992. Monotonic semantic interpretation. In Proc. 30th ACL, pages 32–39.
2. Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, and Sven Thiel. 2003. An efficient graph algorithm for dominance constraints. Journal of Algorithms, 48:194–219.
3. Manuel Bodirsky, Denys Duchier, Joachim Niehren, and Sebastian Miele. 2004. An efficient algorithm for weakly normal dominance constraints. In ACM-SIAM Symposium on Discrete Algorithms. The ACM Press.
4. Ann Copestake and Dan Flickinger. 2000. An open-source grammar development environment and broad-coverage english grammar using HPSG. In Conference on Language Resources and Evaluation.
5. Ann Copestake, Dan Flickinger, Rob Malouf, Susanne Riehemann, and Ivan Sag. 1995. Translation using Minimal Recursion Semantics. Leuven.
6. Ann Copestake, Alex Lascarides, and Dan Flickinger. 2001. An algebra for semantic construction in constraint-based grammars. In Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics, pages 132–139, Toulouse, France.
7. Ann Copestake, Dan Flickinger, Carl Pollard, and Ivan Sag. 2004. Minimal recursion semantics: An introduction. Journal of Language and Computation. To appear.
8. Ann Copestake. 2002. Implementing Typed Feature Structure Grammars. CSLI Publications, Stan-ford, CA.
9. Markus Egg, Alexander Koller, and Joachim Niehren. 2001. The Constraint Language for Lambda Structures. Logic, Language, and Information, 10:457–485.
10. K. Mehlhorn and S. Näher. 1999. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge. See also http://www.mpi-sb.mpg.de/LEDA/.
11. Joachim Niehren and Stefan Thater. 2003. Bridging the gap between underspecification formalisms: Minimal recursion semantics as dominance constraints. In Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics.
12. Stephan Oepen, Kristina Toutanova, Stuart Shieber, Christopher Manning, Dan Flickinger, and Thorsten Brants. 2002. The LinGO Redwoods treebank: Motivation and preliminary applications. In Proceedings of the 19th International Conference on Computational Linguistics (COLING’02), pages 1253–1257.
13. Manfred Pinkal. 1996. Radical underspecification. In 10th Amsterdam Colloquium, pages 587–606.