Learning and Extending Sublanguages | Zendy

Sanjay Jain | Zendy; Efim Kinber | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Learning and Extending Sublanguages

Author(s) -

Sanjay Jain,

Efim Kinber

Publication year - 2006

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

DOI - 10.1007/11894841_14

Subject(s) - learnability , recursively enumerable language , computer science , monotonic function , artificial intelligence , constraint (computer aided design) , natural language processing , natural language , grammar , programming language , theoretical computer science , linguistics , mathematics , algorithm , mathematical analysis , philosophy , geometry

A number of natural models for learning in the limit is introduced to deal with the situation when a learner is required to provide a grammar covering the input even if only a part of the target language is available. Examples of language families are exhibited that are learnable in one model and not learnable in another one. Some characterizations for learnability of algorithmically enumerable families of languages for the models in question are obtained. Since learnability of any part of the target language does not imply monotonicity of the learning process, we consider also our models under additional monotonicity constraint.

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