Learnable Classes of General Combinatory Grammars | Zendy

Erwan Moreau | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Learnable Classes of General Combinatory Grammars

Author(s) -

Erwan Moreau

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-25783-7

DOI - 10.1007/11422532_13

Subject(s) - rule based machine translation , learnability , tree adjoining grammar , categorial grammar , l attributed grammar , combinatory categorial grammar , context sensitive grammar , computer science , indexed grammar , mathematics , formalism (music) , artificial intelligence , mildly context sensitive grammar formalism , context free grammar , phrase structure rules , generative grammar , art , musical , visual arts

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 partially extended his result to general combinatory grammars, but left open the question of whether some subsets of general combinatory grammars have finite elasticity. We propose a new sufficient condition which implies learnability of some classes of k-valued general combinatory grammars, focusing on the way languages are expressed through a grammatical formalism rather than the classes of languages themselves.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research