Abstract
In this paper, we present an approach to parsing within Government and Binding theory and to representing lexical semantic knowledge based on logical types and on an extension to the usual unification mechanism. The work we present here is a first, exploratory step towards the specification of a logical feature system based on the idea of abstract data type which integrates a dynamic treatment of syntactic and semantic relations like taxonomies and meronomies. Our aim is to augment the unification mechanism so that it integrates the general laws of sentence construction.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aït-Kaçi, H., A Lattice-Theoretic Approach to Computation Based on Calculus of Partially Orderd Type Structures, PhD. Thesis, Computer Science dept, University of Pennsylvania, Philadelphia, 1984.
Aït-Kaçi, H., Nasr, R., LOGIN: A Logic Programming Language with Built-in Inheritance, journal of Logic Programming, vol. 3, pp 185–215, 1986.
Berwick, R. and Weinberg, A., The Grammatical Basis of Linguistic Performance, MIT Press, 1986.
Brown, C., Pattabhiraman, T., Massicotte, P., Towards a Theory of Natural Language Generation: the Connection between Syntax and Semantics, in: Natural Language Understanding and Logic Programming II, V. Dahl and P. Saint-Dizier Edts, North Holland 1988.
Chomsky, N., Lectures on Government and Binding, Foris Pub., Dordrecht, 1981.
Chomsky, N., Barriers, Linguistic Inquiry monograph nb. 13, MIT Press 1986.
Cruse, D.A., Lexical Semantics, Cambridge University Press, 1986.
Gazdar, G., Klein, E., Pullum, G., Sag, I., Generalized Phrase Structure Grammar, Harvard university Press, 1985.
Johnson, M., Deductive Parsing with Multiple Levels of Representation, proc of ACL '88, Buffalo, 1988.
Johnson, M., Features, Frames and Quantifier-Free Formulae, to appear in: Logic and Logic Grammars for Language Processing, P. Saint-Dizier and S. Szpakowicz edts, Ellis Horwood, 1989.
Saint-Dizier, P., Contextual Discontinuous Grammars, 2nd NLULP, Vancouver 1987 and in: Natural Language Understanding and Logic Programming II, V. Dahl and P. Saint-Dizier Edts, North Holland, 1988.
Saint-Dizier, P., Foundations of Dislog, programming in Logic with Discontinuities, in proc. of FGCS'88, Tokyo, 1988.
Saint-Dizier, P., Constrained Logic Programming for Natural Language Processing, proc. ACL-89, Manchester, 1989.
Saint-Dizier, P., A Generation Method Based on GB Principles, in proc. 2nd European Workshop on Natural Language Generation, Edinburgh, 1989.
Sheiber, S., An Introduction to Unification-Based Approaches to Grammar, CSLI lecture notes no 4, Chicago University Press, 1986.
Stabler, E., Restricting Logic Grammars with Government and Binding theory, in Computational Linguistics, vol. 13, 1–2, 1987.
Stabler, E., Parsing with Explicit Representations of Syntactic Constraints, in: Natural Language Understanding and Logic Programming II, V. Dahl and P. Saint-Dizier Edts, North Holland, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saint-Dizier, P. (1990). Parsing with extended unification mechanisms. In: Ramani, S., Chandrasekar, R., Anjaneyulu, K.S.R. (eds) Knowledge Based Computer Systems. KBCS 1989. Lecture Notes in Computer Science, vol 444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018393
Download citation
DOI: https://doi.org/10.1007/BFb0018393
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52850-0
Online ISBN: 978-3-540-47168-4
eBook Packages: Springer Book Archive