Kernel methods for learning languages

DOI10.1016/J.TCS.2008.06.037zbMATH Open1158.68018OpenAlexW2134409166MaRDI QIDQ950199FDOQ950199

Authors: Aryeh Kontorovich, Corinna Cortes, Mehryar Mohri 

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

Recommendations

• Learning Linearly Separable Languages
• Learning Languages with Rational Kernels
• Universal kernel-based learning with applications to regular languages
• Languages as hyperplanes: grammatical inference with string kernels
• Factor and Subsequence Kernels and Signatures of Rational Languages

zbMATH Keywords

support vector machinesfinite automatakernelslearning automatamargin theorypiecewise-testable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Cites Work

• Support-vector networks
• Title not available (Why is that?)
• Language identification in the limit
• Subword histories and Parikh matrices
• 10.1162/153244302760200687
• Title not available (Why is that?)
• Inference of Reversible Languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity of automaton identification from given data
• On the complexity of minimum inference of regular sets
• Ordering by Divisibility in Abstract Algebras
• On free monoids partially ordered by embedding
• On the learnability and usage of acyclic probabilistic finite automata
• Learning Linearly Separable Languages
• Learning Languages with Rational Kernels
• Efficient learning of typical finite automata from random walks
• The minimum consistent DFA problem cannot be approximated within any polynomial
• GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
• Rational kernels: theory and algorithms
• N-WAY COMPOSITION OF WEIGHTED FINITE-STATE TRANSDUCERS

Cited In (9)

• Learning Languages with Rational Kernels
• Factor and Subsequence Kernels and Signatures of Rational Languages
• On the index of Simon's congruence for piecewise testability
• Parallel learning of automatic classes of languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Planar Languages and Learnability
• Separability by piecewise testable languages is \textsc{PTime}-complete
• Learning Linearly Separable Languages

This page was built for publication: Kernel methods for learning languages

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