Categorial grammars determined from linguistic data by unification

Studia Logica 49 (4):431 - 454 (1990)
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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 14,033
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA
Sean A. Fulop (2010). Grammar Induction by Unification of Type-Logical Lexicons. Journal of Logic, Language and Information 19 (3):353-381.
John Hale (2007). Book Review. [REVIEW] Journal of Logic, Language and Information 16 (2):217-220.
Similar books and articles

Monthly downloads

Added to index


Total downloads

19 ( #129,884 of 1,696,808 )

Recent downloads (6 months)

4 ( #145,135 of 1,696,808 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.