Constraints over Lambda-Structures in semantic underspecification

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 1, Issue , 1998, Pages 353-359

  Egg, Markus ^a   Niehren, Joachim ^a   Ruhrberg, Peter ^a   Xu, Feiyu ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

BOUND VARIABLES; CONSTRAINT LANGUAGE; FIRST-ORDER LANGUAGE; LAMBDA'S; SIMPLE++; STRUCTURE FEATURES; UNDERSPECIFICATION;

SEMANTICS;

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

References (23)

1. Hiyan Alshawi. 1990. Resolving quasi logical form. Computational Linguistics, 16:133-144.
2. R. Backofen, J. Rogers, and K. Vijay-Shanker. 1995. A first-order axiomatization of the theory of finite trees. J. Logic, Language, and Information, 4:5-39.
3. Johan Bos. 1996. Predicate logic unplugged. In Proceedings 10th Amsterdam Colloquium, pages 133-143.
4. Ann Copestake, Dan Flickinger, and Ivan Sag. 1997. Minimal Recursion Semantics. An Introduction. Manuscript, available at ftp://csli-ftp. stanford.edu/linguistics/sag/mrs.ps.gz.
5. Richard Crouch. 1995. Ellipsis and quantification: A substitutional approach. In Proceedings EACL'95, pages 229-236, Dublin.
6. Paul Hirschbühler. 1982. VP deletion and across the board quantifier scope. In J. Pustejovsky and P. Sells, editors, NELS 12, Univ. of Massachusetts.
7. Jerry R Hobbs and Andrew Kehler. 1997. A theory of parallelism and the case of VP-ellipsis. In Proceedings ACL'97, pages 394-401, Madrid.
8. J. R. Hobbs and S. Shieber. 1987. An algorithm for generating quantifier scoping. Computational Linguistics, 13:47-63.
9. Andrew Kehler. 1993. A discourse copying algorithm for ellipsis and anaphora resolution. In Proceedings of EA CL.
10. Andrew Kehler. 1995. Interpreting Cohesive Forms in the Context of Discourse Inference. Ph. D. thesis, Harvard University.
11. M. Marcus, D. Hindle, and M. Fleck. 1983. D-theory: Talking about talking about trees. In Proceedings of the 21st ACL, pages 129-136.
12. Robert May. 1977. The Grammar of Quantification. Doctoral dissertation, MIT, Cambridge Mass.
13. Joachim Niehren and Alexander Koller. 1998. Dominance Constraints in Context Unification, January. http://www.ps.uni-sb.de/Papers/abstracts/Dominance.html.
14. J. Niehren, M. Pinkal, and P. Ruhrberg. 1997a. On equality up-to constraints over finite trees, context unification, and one-step rewriting. In Proceedings 14th CADE. Springer-Verlag, Townsville.
15. J. Niehren, M. Pinkal, and P. Ruhrberg. 1997b. A uniform approach to underspecification and parallelism. In Proceedings ACL'97, pages 410-417, Madrid.
16. Manfred Pinkal. 1996. Radical underspecification. In Proceed. 10th Amsterdam Colloquium, pages 587-606.
17. Uwe Reyle. 1993. Dealing with ambiguities by underspecification: construction, representation, and deduction. Journal of Semantics, 10:123-179.
18. Uwe Reyle. 1995. Co-indexing labelled DRSs to represent and reason with ambiguities. In S. Peters and K. van Deemter, editors, Semantic Ambiguity and Underspecification. CSLI Publications, Stanford.
19. J. Rogers and K. Vijay-Shanker. 1994. Extracting trees from their descriptions: an application to tree-adjoining grammars. Computational Intelligence, 10:401-421.
20. Stuart Shieber, Fernando Pereira, and Mary Dalrymple. 1996. Interaction of scope and ellipsis. Linguistics and Philosophy, 19:527-552.
21. Kees van Deemter and Stanley Peters. 1996. Semantic Ambiguity and Underspecification. CSLI, Stanford.
22. K. Vijay-Shanker. 1992. Using description of trees in tree adjoining grammar framework. Computational Linguistics, 18.
23. Feiyu Xu. 1998. Underspecified representation and resolution of ellipsis. Master's thesis, Universität des Saarlandes. http://www.coli.uni-sb.de/~feiyu/thesis.html.