Kernel methods for learning languages

DOI10.1016/J.TCS.2008.06.037MaRDI QIDQ950199zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

support vector machinesfinite automatakernelslearning automatamargin theorypiecewise-testable languages

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(12)

• Testing Simon's congruence
• Universal kernel-based learning with applications to regular languages
• Languages as hyperplanes: grammatical inference with string kernels
• Learning Languages with Rational Kernels
• Factor and Subsequence Kernels and Signatures of Rational Languages
• On the index of Simon's congruence for piecewise testability
• On the piecewise complexity of words
• Parallel learning of automatic classes of languages
• scientific article; zbMATH DE number 7056230 (Why is no real title available?)
• 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)