On case-based learnability of languages | Zendy

Christoph Globig | Zendy; Klaus P. Jantke | Zendy; Steffen Lange | Zendy; Yasubumi Sakakibara | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On case-based learnability of languages

Author(s) -

Christoph Globig,

Klaus P. Jantke,

Steffen Lange,

Yasubumi Sakakibara

Publication year - 1997

Publication title -

new generation computing

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.277

H-Index - 27

eISSN - 1882-7055

pISSN - 0288-3635

DOI - 10.1007/bf03037560

Subject(s) - computer science , learnability , artificial intelligence , similarity measure , similarity (geometry) , case based reasoning , measure (data warehouse) , bottleneck , class (philosophy) , natural language processing , machine learning , theoretical computer science , data mining , image (mathematics) , embedded system

Case-based reasoning is deemed an important technology to alleviate the bottleneckof knowledge acquisition in Artificial Intelligence (AI). In case-based reasoning,knowledge is represented in the form of particular cases with an appropriate similaritymeasure rather than any form of rules. The case-based reasoning paradigm adopts theview that an AI system is dynamically changing during its life-cycle which immediatelyleads to learning considerations.Within the present paper, we...

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