Categorial grammars determined from linguistic data by unification

Studia Logica 49 (4):431 - 454 (1990)
  Copy   BIBTEX

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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
58 (#385,307)

6 months
2 (#1,294,541)

Historical graph of downloads
How can I increase my downloads?