Abstract
In this paper we introduce the data structures and process structure of an incremental parser which reflects the underspecified nature of the information encoded in the NL string. We show how this parser can deal with so called crossover phenomena in a way other systems cannot. The parser is formulated within the LDS framework and constructs parse trees with the help of a modal logic for finite trees. wh-expressions are interpreted as constituents with underspecified tree location. The dynamics of the parser is formulated in terms of transition system in which the transitions between the parser states are effected by deduction rules.
This research was supported by the UK Engineering and Physical Sciences Research Council under grant reference GR/K67397
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Blackburn, P. & Meyer-Viol, W.: 1994, ‘Linguistics, logic and finite Trees', Bulletin of the IPGL 2:2–39.
Dowty, D.: 1992, “Variable-free' syntax, variable-binding syntax, the natural deduction Lambek calculus and the crossover constraint', Proceedings of the 1992 West Coast Conference on Formal Linguistics.
Gabbay, D.: 1996, Labelled Deductive Systems, Oxford University Press.
Gabbay, D. & Kempson, R.: 1992, ‘Natural-language content: a proof-theoretic perspective', Proceedings of 8th Amsterdam Semantics Colloquium. Amsterdam.
Gurevich, Y.: 1991, ‘Evolving algebras: A tutorial introduction', Bulletin of the European Association for Theoretical Computer Science, 43,264–286.
Hepple, M.: 1990, The Grammar of Processing of Order and Dependency: A Categorial Grammar, PhD Dissertation, University of Edinburgh.
Johnson, D., Moss, L.: 1995, ‘Dynamic Intrepretations of Constraint-Based Grammar Formalisms', Journal of Logic, Language, and Information, 4:61–79.
Johnson, D., Moss, L.: 1995, ‘Grammar formalisms viewed as evolving algebras', Linguistics and Philosophy.
Kaplan, R. and Zaenen, A.: 1989, ‘Long-distance dependencies, constituent struc-ture, and functional uncertainty', in Baltin, M. and Kroch, A. (eds.) Alternative Conceptions of Phrase Structure, pp. 17–42. University of Chicago Press, Chicago.
Kempson, R., Meyer-Viol, W., Gabbay, D., (forthcoming), 'syntactic computation as labelled deduction: wh a case study', Borsley, B. & Roberts, E. (eds.)Syntactic Categories. Academic Press.
Kracht, M.: 1995, ‘Syntactic codes and Grammar Refinement', Journal of Logic, Language, and Information 4:41–60.
Lasnik, H. & Stowell, T.: 1991, ‘Weakest crossover’ Linguistic Inquiry 22, 687–720.
Meyer-Viol, W.: 1995, Instantial Logic, PhD Dissertation, University of Utrecht.
Meyer-Viol, W., Kibble, R., Kempson, R., Gabbay, D.: 1996, ‘Indefinites as Epsilon Terms: A Labelled deduction Account', Proceeding of the Second International Workshop on Computational Semantics, Tilburg.
Milward, D.: 1994, ‘Dynamic Dependency Grammar', Linguistic and Philosophy, 17:561–605.
Moortgat, M.: 1988, Categorial Investigations, Fores, Dordrecht.
Morrill, G.: 1994, Type-Logical Grammar, Kluwer, Dordrecht.
Pollard, C. & Sag, I.: 1994, Head-Driven Phrase Structure Grammar, University of Chicago Press, Chicago.
Postal. P.: 1972, Cross-over Phenomena, Holt, Rinehart & Winston.
Postal, P.: 1993, ‘Remarks on weak crossover effects', Linguistic Inquiry 24, 539–56.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kempson, R., Viol, W.M., Gabbay, D. (1997). Language understanding: A procedural perspective. In: Retoré, C. (eds) Logical Aspects of Computational Linguistics. LACL 1996. Lecture Notes in Computer Science, vol 1328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052160
Download citation
DOI: https://doi.org/10.1007/BFb0052160
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63700-4
Online ISBN: 978-3-540-69631-5
eBook Packages: Springer Book Archive