Download:
by Are Learnable From Function-argument, Denis Béchet, Annie Foret
http://www.irisa.fr/prive/foret/wollic-final.pdf
Add To MetaCart
Abstract:
This paper is concerned with learning categorial grammars in the model of Gold. We show that rigid and k-valued non-associative Lambek grammars are learnable from function-argument structured sentences. In fact, function-argument structures are natural syntactical decompositions of sentences in sub-components with the indication of the head of each sub-component. This result is interesting and surprising because for every k, the class of k-valued NL grammars has infinite elasticity and one could think that it is not learnable, which is not true. Moreover, these classes are very close to unlearnable classes like k-valued associative Lambek grammars learned from function-argument sentences or k-valued non-associative Lambek calculus grammars learned from well-bracketed list of words or from strings. Thus, the k-valued non-associative Lambek grammars learned from function-argument sentences is at the frontier between learnable and unlearnable classes of languages.
Citations
|
235
|
Inductive inference of formal languages from positive data
– Angluin
- 1980
|
|
84
|
A Quasi-Arithmetical Notation for Syntactic Description
– Bar-Hillel
- 1953
|
|
81
|
On the calculus of syntactic types
– Lambek
- 1961
|
|
56
|
Learnable Classes of Categorial Grammars
– Kanazawa
- 1994
|
|
50
|
Categorial grammars determined from linguistic data by unification
– Buszkowski, Penn
- 1990
|
|
34
|
The mathematics of sentence structure. American Mathematical Monthly
– Lambek
- 1958
|
|
28
|
Inductive inference of monotonic formal systems from positive data
– Shinohara
- 1991
|
|
24
|
Identification of unions of languages drawn from an identifiable class
– Wright
- 1989
|
|
17
|
Inductive inference from positive data is powerful
– Shinohara
- 1990
|
|
16
|
Language identification in the limit. Information and Control
– Gold
- 1994
|
|
15
|
Non-associative Lambek categorial grammar in polynomial time
– Aarts, Trautwein
- 1995
|
|
15
|
The correct definition of finite elasticity: Corrigendum to identification of unions
– Motoki, Shinohara, et al.
- 1991
|
|
12
|
The non-associative Lambek calculus
– Kandulski
- 1988
|
|
11
|
Categorial type logic, in: van Benthem and ter Meulen [21
– Moortgat
- 1997
|
|
10
|
Grammatical inference as unification. Rapport de Recherche RR-3632
– Nicolas
- 1999
|
|
8
|
Learning rigid lambek grammars and minimalist grammars from structured sentences
– Bonato, Retoré
- 2001
|
|
8
|
Non-associative Lambek calculus in polynomial time. In 8 t h Workshop on theorem proving with analytic tableaux and related methods, number 1617
– Groote
- 1999
|
|
8
|
Nir, Lambek rigid grammars are not learnable from strings
– Foret, Le
- 2002
|
|
5
|
Classical non-associative Lambek calculus, Studia Logica 71.1
– Groote, Lamarche
- 2002
|
|
5
|
On limit points for some variants of rigid Lambek grammars
– Foret, Nir
- 2002
|
|
3
|
Mathematical linguistics and proof theory, in: van Benthem and ter Meulen [21
– Buszkowski
|
