Languages as hyperplanes: grammatical inference with string kernels
From MaRDI portal
(Redirected from Publication:413838)
Recommendations
Cites work
- scientific article; zbMATH DE number 5957212 (Why is no real title available?)
- scientific article; zbMATH DE number 67629 (Why is no real title available?)
- scientific article; zbMATH DE number 1233727 (Why is no real title available?)
- 10.1162/153244302760200687
- A theory of the learnable
- Characteristic sets for polynomial grammatical inference
- Generating all permutations by context-free grammars in Chomsky normal form
- Grammatical Inference: Algorithms and Applications
- Grammatical Inference: Algorithms and Applications
- Language identification in the limit
- Languages as hyperplanes: grammatical inference with string kernels
- Learning Context-Sensitive Languages from Linear Structural Information
- Learning Languages with Rational Kernels
- Learning Linearly Separable Languages
- Learning algorithms for enclosing points in Bregmanian spheres.
- Learning deterministic context free grammars: the Omphalos competition
- Learning mildly context-sensitive languages with multidimensional substitutability from positive data
- On Context-Free Languages
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- PAC-Learning Unambiguous NTS Languages
- Planar Languages and Learnability
- Polynomial identification in the limit of substitutable context-free languages
- Some alternatives to Parikh matrices using string kernels
- Three models for the description of language
- Tree adjoining grammars for RNA structure prediction
Cited in
(5)
This page was built for publication: Languages as hyperplanes: grammatical inference with string kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413838)
