Identification in the limit of categorial grammars

Abstract
It is proved that for any k, the class of classical categorial grammars that assign at most k types to each symbol in the alphabet is learnable, in the Gold (1967) sense of identification in the limit from positive data. The proof crucially relies on the fact that the concept known as finite elasticity in the inductive inference literature is preserved under the inverse image of a finite-valued relation. The learning algorithm presented here incorporates Buszkowski and Penn's (1990) algorithm for determining categorial grammars from input consisting of functor-argument structures.
Keywords categorial grammar  finite elasticity  functor-argument struture  identification in the limit  inductive inference  learnability
Categories (categorize this paper)
DOI 10.1007/BF00173697
Options
 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
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,613
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Learning Categorial Grammar by Unification with Negative Constraints.Jacek Marciniec - 1994 - Journal of Applied Non-Classical Logics 4 (2):181-200.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

15 ( #314,190 of 2,168,922 )

Recent downloads (6 months)

1 ( #346,816 of 2,168,922 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums