12 search results - page 1 / 3 » Learnable Classes of General Combinatory Grammars |
LACL
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Kanazawa has shown that k-valued classical categorial grammars have the property of finite elasticity [1], which is a sufficient condition for learnability. He has also ...
ALT
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
ICGI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Kanazawa has shown that several non-trivial classes of categorial grammars are learnable in Gold’s model. We propose in this article to adapt this kind of symbolic lear...
ACL
1997
13 years 5 months ago
1997
This paper shows that a class of Combinatory Categorial Grammars (CCGs) augmented with a linguistically-motivated form of type raising involving variables is weakly equivalent to ...
FOCS
1993
IEEE
13 years 8 months ago
1993
IEEE
Learnability in Valiant’s PAC learning model has been shown to be strongly related to the existence of uniform laws of large numbers. These laws define a distribution-free conver...