Kernel methods for learning languages
From MaRDI portal
Publication:950199
DOI10.1016/j.tcs.2008.06.037zbMath1158.68018OpenAlexW2134409166MaRDI QIDQ950199
Mehryar Mohri, Corinna Cortes, Leonid (Aryeh) Kontorovich
Publication date: 22 October 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.037
learning automatakernelsfinite automatasupport vector machinesmargin theorypiecewise-testable languages
Related Items (5)
Factor and Subsequence Kernels and Signatures of Rational Languages ⋮ Separability by piecewise testable languages is \textsc{PTime}-complete ⋮ Unnamed Item ⋮ On the index of Simon's congruence for piecewise testability ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the learnability and usage of acyclic probabilistic finite automata
- Subword histories and Parikh matrices
- Support-vector networks
- GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
- N-WAY COMPOSITION OF WEIGHTED FINITE-STATE TRANSDUCERS
- Learning Linearly Separable Languages
- Inference of Reversible Languages
- The minimum consistent DFA problem cannot be approximated within any polynomial
- Complexity of automaton identification from given data
- On the complexity of minimum inference of regular sets
- 10.1162/153244302760200687
- Efficient learning of typical finite automata from random walks
- Learning Languages with Rational Kernels
- On free monoids partially ordered by embedding
- Language identification in the limit
- Ordering by Divisibility in Abstract Algebras
This page was built for publication: Kernel methods for learning languages