IEEE Transactions on Pattern Analysis and Machine Intelligence · 2005 · 76 citations · 72 references
ComputingComputer ScienceAlgorithmsMachine LearningNatural Language ProcessingAutomata TheoryFinite AutomataFinite-state MachinesHidden Markov ModelsLanguage ModelingPattern RecognitionAutomata LearningFinite Automata TheoryFinite State Machine GenerationLanguage RecognitionProbabilistic AutomataProbabilistic Finite AutomataProbabilistic Finite State Machines
Probabilistic finite-state machines are used today in a variety of areas in pattern recognition or in fields to which pattern recognition is linked. In part I of this paper, we surveyed these objects and studied their properties. In this part, we study the relations between probabilistic finite-state automata and other well-known devices that generate strings like hidden Markov models and n-grams and provide theorems, algorithms, and properties that represent a current state of the art of these objects.
72
Leo Breiman · Machine Learning · 1996 · 17K citations · Full text
Leo Breiman · Machine Learning · 1996 · 16.4K citations · Full text
Language identification in the limit
Eric Gold · Information and Control · 1967 · 3.6K citations
On the Convergence Properties of the EM Algorithm
Changbao Wu · The Annals of Statistics · 1983 · 3.3K citations · Full text