Skip to main content
SpringerLink
Log in

Categorial grammars determined from linguistic data by unification

  • Published:
Studia Logica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. van Benthem, Essays in Logical Semantics, D. Reidel, Dordrecht, 1986.

    Google Scholar 

  2. J. van Benthem, Categorial Equations, in [8]

    Google Scholar 

  3. J. van Benthem, Categorial Grammar meets Unification, in: J. Wedekind et al. (eds.), Unification Formalisms: Syntax, Semantics and Implementation, to appear.

  4. W. Buszkowski, Solvable Problems for Classical Categorial Grammars, Bull. Pol. Acad. Scie. Math. 35 (1987), pp. 373–382.

    Google Scholar 

  5. W. Buszkowski, Discovery Procedures for Categorial Grammars, in [8]

    Google Scholar 

  6. W. Buszkowski, The Logic of Types, in: J. Srzednicki (ed.), Initiatives in Logic, M. Nijhoff, Dordrecht, 1988.

    Google Scholar 

  7. E. L. Keenan and L. M. Faltz, Boolean Semantics for Natural Language, D. Reidel, Dordrecht, 1985.

    Google Scholar 

  8. E. Klein and J. van Benthem (eds.), Categories, Polymorphism and Unification, Universiteit van Amsterdam, Amsterdam, 1987.

    Google Scholar 

  9. J. Lambek, The mathematics of sentence structure, American Math. Monthly 65 (1958), pp. 154–170.

    Google Scholar 

  10. J. W. Lloyd, Foundations of Logic Programming, Springer-Verlag, Berlin, 1987.

    Google Scholar 

  11. M. Moortgat, Categorial Investigations. Logical and Linguistic Aspects of the Lambek Calculus, Dissertation, Universiteit van Amsterdam, Amsterdam, 1988.

    Google Scholar 

  12. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Adam Mickiewicż University, Matejki 48/49, 60-769, Poznań, Poland

    Wojciech BuszKowski & Gerald Penn

  2. Department of Computer Science, The University of Chicago, Ryerson Hall 1100 East 58th Street, Chicago, ILL., USA

    Wojciech BuszKowski & Gerald Penn

Authors
  1. Wojciech BuszKowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerald Penn
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00370157

Keywords

Search

Navigation