Bridging the gap between underspecification formalisms: Hole semantics as dominance constraints

10th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2003

Volumn , Issue , 2003, Pages 195-202

  Koller, Alexander ^a   Niehren, Joachim ^a   Thater, Stefan ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SPEED UP; UNDERSPECIFICATION; UNDERSPECIFIED SEMANTICS;

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

References (12)

1. H. Alshawi and R. Crouch. 1992. Monotonic semantic interpretation. In Proc. 30th ACL, pages 32-39.
2. E. Althaus, D. Duchier, A. Koller, K. Mehlhorn, J. Niehren, and S. Thiel. 2003. An effi cient graph algorithm for dominance constraints. Journal of Algorithms. In press.
3. Johan Bos. 1996. Predicate logic unplugged. In Proc. 10th Amsterdam Colloquium, pages 133-143.
4. J. Bos. 2002. Underspecifi cation and resolution in discourse semantics. Ph.D. thesis, Saarland University.
5. A. Copestake, D. Flickinger, and I. Sag. 1999. Minimal Recursion Semantics. An Introduction. Unpublished manuscript.
6. M. Egg, A. Koller, and J. Niehren. 2001. The constraint language for lambda structures. Journal of Logic, Language, and Information, 10:457-485.
7. K. Erk, A. Koller, and J. Niehren. 2002. Processing underspecifi ed semantic representations in the constraint language for lambda structures. Research in Language and Computation, 1(1). In Press.
8. Claire Gardent and Bonnie Webber. 1998. Describing discourse semantics. In Proceedings of the 4th TAG+ Workshop, Philadelphia.
9. A. Koller, J. Niehren, and K. Striegnitz. 2000. Relaxing underspecifi ed semantic representations for reinterpretation. Grammars, 3(2-3).
10. Uwe Reyle. 1993. Dealing with ambiguities by underspecifi cation: construction, representation, and deduction. Journal of Semantics, 10:123-179.
11. J. Rogers and K. Vijay-Shanker. 1994. Obtaining trees from their descriptions: An application to tree-adjoining grammars. Computational Intelligence, 10:401-421.
12. Sven Thiel. 2002. A linear time algorithm for the confi guration problem of dominance graphs. Submitted.