Learning deterministic context free grammars: the Omphalos competition

DOI10.1007/S10994-006-9592-9zbMath1470.68054OpenAlexW2018647136MaRDI QIDQ2384127

Alexander Clark

Publication date: 20 September 2007

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-006-9592-9

zbMATH Keywords

context-free languagesgrammatical inferenceNTS languages

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (3)

Languages as hyperplanes: grammatical inference with string kernels ⋮ Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering ⋮ \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• NTS languages are deterministic and congruential
• NTS grammars and Church-Rosser systems
• Efficient learning of context-free grammars from positive structural examples
• On the computational complexity of approximating distributions by probabilistic automata
• On the learnability and usage of acyclic probabilistic finite automata
• Evolutionary induction of stochastic context free grammars
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Church-Rosser Thue systems and formal languages
• Algorithms on Strings, Trees and Sequences
• Learning deterministic regular grammars from stochastic samples in polynomial time
• Cryptographic limitations on learning Boolean formulae and finite automata
• Grammatical Inference: Algorithms and Applications
• Grammatical Inference: Algorithms and Applications
• Grammatical Inference: Algorithms and Applications

This page was built for publication: Learning deterministic context free grammars: the Omphalos competition