Well-nested parallelism constraints for ellipsis resolution

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

Volumn , Issue , 2003, Pages 115-122

  Erk, Katrin ^a   Niehren, Joachim ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT LANGUAGE; COVERING SCOPE; DESCRIPTION LANGUAGES; LAMBDA'S; NESTED PARALLELISM; SUBLANGUAGES; TREE DESCRIPTIONS; UNDERSPECIFIED SEMANTICS; UNIFORM FRAMEWORK;

SEMANTICS;

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

References (18)

1. E. Althaus, D. Duchier, A. Koller, K. Mehlhorn, J. Niehren, and S. Thiel. 2002. An effi cient graph algorithm for dominance constraints. Journal of Algorithms. To appear.
2. J. Bos. 1996. Predicate logic unplugged. In Proc. of the 10th Amsterdam Colloquium.
3. H. Comon. 1992. Completion of rewrite systems with membership constraints. In Proc. of ICALP '92.
4. M. Dalrymple, S. Shieber, and F. Pereira. 1991. Ellipsis and higher-order unifi cation. Linguistics & Philosophy, 14:399-452.
5. M. Egg, A. Koller, and J. Niehren. 2001. The Constraint Language for Lambda Structures. Journal of Logic, Language, and Information, 10:457-485.
6. Katrin Erk and Alexander Koller. 2001. VP ellipsis by tree surgery. In Proc. of the 13th Amsterdam Colloquium.
7. K. Erk, A. Koller, and J. Niehren. 2002. Processing underspecifi ed semantic representations in the Constraint Language for Lambda Structures. Journal of Language and Computation. To appear.
8. R. Fiengo and R. May. 1994. Indices and Identity. MIT Press, Cambridge.
9. D. Hardt. 1993. Verb Phrase Ellipsis: Form, Meaning, and Processing. Ph.D. thesis, University of Pennsylvania.
10. A. Kehler. 1995. Interpreting Cohesive Forms in the Context of Discourse Inference. Ph.D. thesis, Harvard University.
11. A. Koller, J. Niehren, and R.Trei nen. 2001. Dominance constraints: Algorithms and complexity. In Proc. of LACL'01.
12. S. Lappin and H. Shih. 1996. A generalized reconstruction algorithm for ellipsis resolution. In Proc. of COLING'96.
13. G. S. Makanin. 1977. The problem of solvability of equations in a free semigroup. Mat. Sbomik., 103(2):147-236.
14. M. P. Marcus, D. Hindle, and M. M. Fleck. 1983. D-theory: Talking about talking about trees. In Proc. ACL'83.
15. M. Pinkal. 1995. Radical underspecifi cation. In Proc. of the 10th Amsterdam Colloquium. University of Amsterdam.
16. U. Reyle. 1993. Dealing with ambiguities by underspecifi - cation: Construction, representation, and deduction. Journal of Semantics, 10(2).
17. I. Sag. 1976. Deletion and logical form. Ph.D. thesis, MIT, Cambridge.
18. E. Williams. 1977. Discourse and logical form. Linguistic Inquiry, 8(1):101-139.