Learning languages with help

DOI10.1007/3-540-45790-9_13MaRDI QIDQ4440395zbMATH OpenFDO

Authors Christopher Kermorvant, Colin de la Higuera

Publication date 17 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2484/24840161.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Learning and adaptive systems in artificial intelligence (68T05) Natural language processing (68T50)

Recommendations

• Grammatical Inference: Algorithms and Applications
• Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
• Grammatical inference. Preface
• Recent advances of grammatical inference
• Grammatical inference. Learning automata and grammars.

Cited in

(12)

• Inference of -languages from prefixes.
• Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data
• Language learning: How much evidence does a child need in order to learn to speak grammatically?
• Learning grammars and automata with queries
• scientific article; zbMATH DE number 512872 (Why is no real title available?)
• Automatic inference of DATR theories
• scientific article; zbMATH DE number 2080661 (Why is no real title available?)
• Language learning without overgeneralization
• Structural, Syntactic, and Statistical Pattern Recognition
• Grammatical Inference: Algorithms and Applications
• Language learning without overgeneralization
• Learning languages in a union

This page was built for publication: Learning languages with help

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4440395)