Abstract
We provide an algorithm for determining a categorial grammar from linguistic data that essentially uses unification of type-schemes assigned to atoms. The algorithm presented here extends an earlier one restricted to rigid categorial grammars, introduced in [4] and [5], by admitting non-rigid outputs. The key innovation is the notion of an optimal unifier, a natural generalization of that of a most general unifier.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
J. van Benthem, Essays in Logical Semantics, D. Reidel, Dordrecht, 1986.
J. van Benthem, Categorial Equations, in [8]
J. van Benthem, Categorial Grammar meets Unification, in: J. Wedekind et al. (eds.), Unification Formalisms: Syntax, Semantics and Implementation, to appear.
W. Buszkowski, Solvable Problems for Classical Categorial Grammars, Bull. Pol. Acad. Scie. Math. 35 (1987), pp. 373–382.
W. Buszkowski, Discovery Procedures for Categorial Grammars, in [8]
W. Buszkowski, The Logic of Types, in: J. Srzednicki (ed.), Initiatives in Logic, M. Nijhoff, Dordrecht, 1988.
E. L. Keenan and L. M. Faltz, Boolean Semantics for Natural Language, D. Reidel, Dordrecht, 1985.
E. Klein and J. van Benthem (eds.), Categories, Polymorphism and Unification, Universiteit van Amsterdam, Amsterdam, 1987.
J. Lambek, The mathematics of sentence structure, American Math. Monthly 65 (1958), pp. 154–170.
J. W. Lloyd, Foundations of Logic Programming, Springer-Verlag, Berlin, 1987.
M. Moortgat, Categorial Investigations. Logical and Linguistic Aspects of the Lambek Calculus, Dissertation, Universiteit van Amsterdam, Amsterdam, 1988.
R. T. Oehrle, Multi-Dimensional Compositional functions as a Basis for Grammatical Analysis, in: R. T. Oehrle et al. (eds.), Categorial Grammars and Natural Language Structures, D. Reidel, Dordrecht, 1988.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
BuszKowski, W., Penn, G. Categorial grammars determined from linguistic data by unification. Studia Logica 49, 431–454 (1990). https://doi.org/10.1007/BF00370157
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00370157