Languages as hyperplanes: grammatical inference with string kernels
From MaRDI portal
Publication:413838
DOI10.1007/s10994-010-5218-3zbMath1237.68140MaRDI QIDQ413838
Christophe Costa Florêncio, Alexander Clark, Chris Watkins
Publication date: 8 May 2012
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://pure.uva.nl/ws/files/1315609/101391_fulltext.pdf
68Q32: Computational learning theory
68T05: Learning and adaptive systems in artificial intelligence
68Q42: Grammars and rewriting systems
Related Items
Structural Statistical Software Testing with Active Learning in a Graph, Languages as hyperplanes: grammatical inference with string kernels
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Languages as hyperplanes: grammatical inference with string kernels
- Tree adjoining grammars for RNA structure prediction
- Characteristic sets for polynomial grammatical inference
- Generating all permutations by context-free grammars in Chomsky normal form
- Learning deterministic context free grammars: the Omphalos competition
- Learning Linearly Separable Languages
- Learning Context-Sensitive Languages from Linear Structural Information
- PAC-Learning Unambiguous NTS Languages
- Planar Languages and Learnability
- Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data
- A theory of the learnable
- 10.1162/153244302760200687
- Learning Theory and Kernel Machines
- Learning Languages with Rational Kernels
- Grammatical Inference: Algorithms and Applications
- Grammatical Inference: Algorithms and Applications
- On Context-Free Languages
- Three models for the description of language
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Language identification in the limit
