On the public citation graph
Using symbol clustering to improve probabilistic automaton inference
0 signed · 26 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.1006/csla.1994.1001openalex-snapshot
On structuring probabilistic dependences in stochastic language modelling
inferredcites →https://doi.org/10.1007/3-540-58473-0_144openalex-snapshot
Learning stochastic regular grammars by means of a state merging method
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/978-3-642-83462-2_11openalex-snapshot
An Efficient Algorithm for the Inference of Circuit-Free Automata
inferredcites →https://doi.org/10.1109/icassp.1995.479394openalex-snapshot
Improved backing-off for M-gram language modeling
inferredcites →https://doi.org/10.1109/tassp.1987.1165125openalex-snapshot
Estimation of probabilities from sparse data for the language model component of a speech recognizer
inferredcites →https://doi.org/10.1142/9789812797902_0004openalex-snapshot
INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIME
inferredcites →https://doi.org/10.1145/130385.130390openalex-snapshot
Random DFA's can be approximately learned from sparse uniform examples
inferredcites →https://doi.org/10.1145/195058.195155openalex-snapshot
On the learnability of discrete distributions
inferredcites →https://doi.org/10.1145/225298.225302openalex-snapshot
On the learnability and usage of acyclic probabilistic finite automata
inferredcites →https://doi.org/10.21437/eurospeech.1993-229openalex-snapshot
Improved clustering techniques for class-based statistical language modelling
inferredcites →https://doi.org/10.2307/2282952openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.3115/1075527.1075531openalex-snapshot
Multi-site data collection for a spoken language corpus
inferredcites →https://doi.org/10.5555/176313.176316openalex-snapshot
Class-based n -gram models of natural language
inferredcites →https://doi.org/10.5555/92571.92587openalex-snapshot
ON THE COMPUTATIONAL COMPLEXITY OFAPPROXIMATING DISTRIBUTIONS BY PROBABILISTIC AUTOMATA
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_4openalex-snapshot
Ten Open Problems in Grammatical Inference
inferred← citeshttps://doi.org/10.1007/978-3-540-27868-9_27openalex-snapshot
Improving Probabilistic Automata Learning with Additional Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-540-30195-0_22openalex-snapshot
Learning Stochastic Deterministic Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-30195-0_8openalex-snapshot
A Markovian Approach to the Induction of Regular String Distributions
inferred← citeshttps://doi.org/10.1007/978-3-540-45257-7_5openalex-snapshot
Smoothing Probabilistic Automata: An Error-Correcting Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-89689-0_11openalex-snapshot
Efficient Pruning of Probabilistic Automata
inferred← citeshttps://doi.org/10.1016/j.patcog.2004.03.020openalex-snapshot
Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
inferred← citeshttps://doi.org/10.1109/tpami.2005.147openalex-snapshot
Probabilistic finite-state machines - part I
inferred← citeshttps://doi.org/10.1109/tpami.2005.148openalex-snapshot
Probabilistic finite-state machines - part II
inferred← citeshttps://doi.org/10.3115/1218955.1219013openalex-snapshot
Alternative approaches for generating bodies of grammar rules
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.