Claire Gardent
ABSTRACT
I show that the equational treatment of ellipsis proposed in (Dalrymple et al., 1991) can further be viewed as modeling the effect of parallelism on semantic interpretation. I illustrate this claim by showing that the account straightforwardly extends to a general treatment of sloppy identity on the one hand, and to deaccented foci on the other. I also briefly discuss the results obtained in a prototype implementation.
- Nicholas Asher. 1993. Reference to abstract objects in discourse. Kluwer, Dordrecht.Google Scholar
- Nicholas Asher, Daniel Hardt, and Joan Busquets. 1997. Discourse parallelism, scope and ellipsis. In Proceedings of SALT'97, Palo Alto.Google ScholarCross Ref
- Robin Cooper. 1979. The interpretation of pronouns. In F. Heny and H. S. Schnelle, editors, Syntax and Semantics, number 10, pages 61--93.Google Scholar
- Mary Dalrymple, Stuart Shieber, and Fernando Pereira. 1991. Ellipsis and higher-order unification. Linguistics & Philosophy, 14: 399--452.Google ScholarCross Ref
- Gilles Dowek. 1992. Third order matching is decidable. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science (LICS-7), pages 2--10. IEEE Computer Society Press.Google ScholarCross Ref
- Robert Fiengo and Robert May. 1994. Indices and Identity. MIT Press, Cambridge.Google Scholar
- Claire Gardent and Michael Kohlhase. 1996a. Focus and higher-order unification. In Proceedings of COLING'96, Copenhagen. Google ScholarDigital Library
- Claire Gardent and Michael Kohlhase. 1996b. Higher-order coloured unification and natural language semantics. In Proceedings of ACL'96, Santa Cruz. Google ScholarDigital Library
- Claire Gardent, Michael Kohlhase, and Karsten Konrad. 1999. Higher-order coloured unification: a linguistic application. Technique et Science Informatiques, 18(2): 181--209.Google Scholar
- Claire Gardent. 1997. Sloppy identity. In Christian Retoré, editor, Logical Aspects of Computational Linguistics, pages 188--207. Springer. Google ScholarDigital Library
- Claire Gardent. 1999. Deaccenting and higher-order unification. University of the Saarland. Submitted for publication. Google ScholarDigital Library
- Daniel Hardt. 1996. Dynamic interpretation of vp ellipsis. To appear in Linguistics and Philosophy.Google Scholar
- J. Hobbs and A. Kehler. 1997. A theory of parallelism and the case of VP ellipsis. In Proceedings of ACL, Madrid. Google ScholarDigital Library
- Gérard P. Huet. 1976. Résolution d'Équations dans des Langages d'ordre 1, 2, .., w. Thèse d'État, Université de Paris VII.Google Scholar
- Ray S. Jackendoff. 1972. Semantic Interpretation in Generative Grammar. The MIT Press.Google Scholar
- Manfred Krifka. 1992. A compositional semantics for multiple focus constructions. In Joachim Jacobs, editor, Informationsstruktur and Grammatik. Heidelberg. Sonderheft 4.Google Scholar
- Manfred Krifka. 1995. Focus and/or context: A second look at second occurence expressions. Unpublished Ms. University of Texas, Austin, February.Google Scholar
- Joachim Niehren, Manfred Pinkal, and Peter Ruhrberg. 1997. A uniform approach to underspecification and parallelism. In Proceedings of ACL'97, pages 410--417, Madrid, Spain. Google ScholarDigital Library
- H. Prüst, R. Scha, and M. van den Berg. 1994. Discourse grammar and verb phrase anaphora. Linguistics & Philosophy, 17: 261--327.Google ScholarCross Ref
- Steve Pulman. 1997. Higher order unification and the interpretation of focus. Linguistics & Philosophy, 20: 73--115.Google ScholarCross Ref
- Mats Rooth. 1992a. Ellipsis redundancy and reduction redundancy. In Steve Berman and Arild Hestvik, editors, Proceedings of the Stuttgart Ellipsis Workshop, University of Stuttgart.Google Scholar
- Mats Rooth. 1992b. A theory of focus interpretation. Natural Language Semantics, pages 75--116.Google ScholarCross Ref
- Stuart Shieber, Fernando Pereira, and Mary Dalrymple. 1996. Interaction of scope and ellipsis. Linguistics & Philosophy, 19: 527--552.Google ScholarCross Ref
- Unifying parallels
Recommendations
Unifying structured recursion schemes
ICFP '13Folds over inductive datatypes are well understood and widely used. In their plain form, they are quite restricted; but many disparate generalisations have been proposed that enjoy similar calculational benefits. There have also been attempts to unify ...
A Unifying Approach to Algebraic Systems Over Semirings
A fairly general definition of canonical solutions to algebraic systems over semirings is proposed. This is based on the notion of summation semirings, traditionally known as Σ${\Sigma }$-semirings, and on assigning unambiguous context-free languages to ...
Unifying Guarded and Unguarded Iteration
Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures - Volume 10203Models of iterated computation, such as completely iterative monads, often depend on a notion of guardedness, which guarantees unique solvability of recursive equations and requires roughly that recursive calls happen only under certain guarding ...
Comments