On the public citation graph
Languages as Hyperplanes: Grammatical Inference with String Kernels
0 signed · 47 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11872436_13openalex-snapshot
Planar Languages and Learnability
inferredcites →https://doi.org/10.1007/11872436_6openalex-snapshot
PAC-Learning Unambiguous NTS Languages
inferredcites →https://doi.org/10.1007/11894841_24openalex-snapshot
Learning Linearly Separable Languages
inferredcites →https://doi.org/10.1007/978-3-319-21852-6_3openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1007/978-3-540-30195-0_3openalex-snapshot
The Omphalos Context-Free Grammar Learning Competition
inferredcites →https://doi.org/10.1007/978-3-540-30195-0_6openalex-snapshot
Learning Mild Context-Sensitiveness: Toward Understanding Children’s Language Learning
inferredcites →https://doi.org/10.1007/978-3-540-45167-9_29openalex-snapshot
Learning Algorithms for Enclosing Points in Bregmanian Spheres
inferredcites →https://doi.org/10.1007/978-3-540-72927-3_26openalex-snapshot
Learning Languages with Rational Kernels
inferredcites →https://doi.org/10.1007/bf00630917openalex-snapshot
Evidence against the context-freeness of natural language
inferredcites →https://doi.org/10.1007/bf00993593openalex-snapshot
Sample Compression, Learnability, and the Vapnik-Chervonenkis Dimension
inferredcites →https://doi.org/10.1007/s10994-006-9592-9openalex-snapshot
Learning deterministic context free grammars: The Omphalos competition
inferredcites →https://doi.org/10.1016/j.tcs.2005.11.010openalex-snapshot
Generating all permutations by context-free grammars in Chomsky normal form
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1016/s0304-3975(98)00090-5openalex-snapshot
Tree adjoining grammars for RNA structure prediction
inferredcites →https://doi.org/10.1017/cbo9780511809682openalex-snapshot
Kernel Methods for Pattern Analysis
inferredcites →https://doi.org/10.1023/a:1007353007695openalex-snapshot
Characteristic Sets for Polynomial Grammatical Inference
inferredcites →https://doi.org/10.1038/nature04675openalex-snapshot
Recursive syntactic pattern learning by songbirds
inferredcites →https://doi.org/10.1109/34.722617openalex-snapshot
Learning local languages and their application to DNA sequence analysis
inferredcites →https://doi.org/10.1109/iconip.1999.845646openalex-snapshot
Hill climbing in recurrent neural networks for learning the a/sup n/b/sup n/c/sup n/ language
inferredcites →https://doi.org/10.1109/tit.1956.1056813openalex-snapshot
Three models for the description of language
inferredcites →https://doi.org/10.1142/9789812773036_0022openalex-snapshot
ON LANGUAGES DEFINED BY NUMERICAL PARAMETERS
inferredcites →https://doi.org/10.1145/174644.174647openalex-snapshot
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
inferredcites →https://doi.org/10.1145/73007.73049openalex-snapshot
Crytographic limitations on learning Boolean formulae and finite automata
inferredcites →https://doi.org/10.1162/089976698300017467openalex-snapshot
Nonlinear Component Analysis as a Kernel Eigenvalue Problem
inferredcites →https://doi.org/10.1162/153244302760200687openalex-snapshot
10.1162/153244302760200687
inferredcites →https://doi.org/10.3115/981175.981190openalex-snapshot
Characterizing structural descriptions produced by various grammatical formalisms
inferredcites →https://doi.org/10.5555/114836.114856openalex-snapshot
Polynomial-time learning of very simple grammars from positive data
inferredcites →https://doi.org/10.5555/114836.114871openalex-snapshot
The correct definition of finite elasticity: corrigendum to identification of unions
inferredcites →https://doi.org/10.5555/93335.93373openalex-snapshot
Identification of unions of languages drawn from an identifiable class
inferredcites →https://doi.org/10.7551/mitpress/1113.003.0006openalex-snapshot
Dynamic Alignment Kernels
inferredcites →https://doi.org/10.7551/mitpress/3897.001.0001openalex-snapshot
An Introduction to Computational Learning Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11872436_13openalex-snapshot
Planar Languages and Learnability
inferred← citeshttps://doi.org/10.1007/978-3-540-78469-2_9openalex-snapshot
Structural Statistical Software Testing with Active Learning in a Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-16108-7_10openalex-snapshot
A Spectral Approach for Probabilistic Grammatical Inference on Trees
inferred← citeshttps://doi.org/10.1007/s10994-010-5218-3openalex-snapshot
Languages as hyperplanes: grammatical inference with string kernels
inferred← citeshttps://doi.org/10.1016/j.jmp.2015.11.004openalex-snapshot
Similarity, kernels, and the fundamental constraints on cognition
inferred← citeshttps://doi.org/10.1109/icdmw.2007.111openalex-snapshot
A Novel Parallel Boolean Approach for Discovering Frequent Itemsets
inferred← citeshttps://doi.org/10.1109/isda.2007.117openalex-snapshot
Genetic Programming for Induction of Context-Free Grammars
inferred← citeshttps://doi.org/10.1145/1553374.1553379openalex-snapshot
Grammatical inference as a principal component analysis problem
inferred← citeshttps://doi.org/10.1162/ling_a_00015openalex-snapshot
Learning Long-Distance Phonotactics
inferred← citeshttps://doi.org/10.3233/fun-2008-843-401openalex-snapshot
Some Alternatives to Parikh Matrices Using String Kernels
inferred← citeshttps://doi.org/10.3406/hel.2009.3109openalex-snapshot
Mathematics of language learning
inferred← citeshttps://doi.org/10.4995/thesis/10251/1957openalex-snapshot
Estudio de la mezcla de estados determinista y no determinista en el diseño de algoritmos para inferencia gramatical de lenguajes regulares.
inferred← citeshttps://doi.org/10.5555/1390681.1442793openalex-snapshot
Learning Balls of Strings from Edit Corrections
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.