Probabilistic Finite-State Machines - Part II

Probabilistic Finite-State Machines - Part II

Cached

Download Links

[www.dlsi.ua.es]

by E. Vidal , F. Thollard , C. De La Higuera , F. Casacuberta , R. C. Carrasco

Citations:

5 - 1 self

BibTeX

@MISC{Vidal_probabilisticfinite-state,
    author = {E. Vidal and F. Thollard and C. De La Higuera and F. Casacuberta and R. C. Carrasco},
    title = {Probabilistic Finite-State Machines - Part II},
    year = {}
}

Bookmark

OpenURL

Abstract

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 II, 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.

Citations

3116	A tutorial on hidden Markov models and selected applications in speech recognition - Rabiner - 1989
1515	A Theory of the Learnable - Valiant - 1984
793	Language identification in the limit - Gold - 1967
726	The EM algorithm and extensions - McLachlan, Krishnan - 1997
612	Statistical Methods for Speech Recognition - Jelinek - 1997
422	An Inequality and Associated Maximization Technique in Statistical Estimation of a Markov Process - Baum - 1972
279	Cryptographic limitations on learning boolean formulae and finite automata - Kearns, Valiant - 1994
245	On the convergence properties of the EM algorithm - Wu - 1983
114	Learning stochastic regular grammars by means of a state merging method. This volume - CARRASCO, ONCINA - 1994
112	Inducing probabilistic grammars by bayesian model merging - Stolcke, Omohundro - 1994
106	Stochastic contextfree grammars for tRNA modeling - Sakakibara, Brown, et al. - 1994
82	The design principles of a weighted finite-state transducer library - Mohri, Pereira, et al. - 2000
78	On the learnability of discrete distributions - Kearns, Mansour, et al. - 1994
77	On the Computational Complexity of Approximating Distributions by Probabilistic Automata - Abe, Warmuth - 1992
73	The minimum consistent DFA problem cannot be approximated within any polynomial - Pitt, Warmuth - 1993
65	A Study of Grammatical Inference - Horning - 1969
59	On the learnability and usage of acyclic probabilistic finite automata - Ron, Singer, et al. - 1995
56	Inference of k-testable languages in the strict sense and application to syntactic pattern recognition - Garcia, Vidal - 1990
56	Probabilistic languages: a review and some open questions - Wetherell - 1980
42	An Omnifont Open-Vocabulary OCR System for English and Arabic - Bazzi, Schwartz, et al. - 1999
40	Continuous Speech Recognition Using Hidden Markov Modeles - Picone - 1990
38	Learning deterministic regular grammars from stochastic samples in polynomial time - Carrasco, Oncina - 1999
36	Identifying languages from stochastic examples - Angluin - 1988
33	Stochastic inference of regular tree languages - Carrasco, Oncina, et al. - 2001
33	Algebraic decision procedures for local testability - McNaughton - 1974
26	Shallow parsing using specialized hmms - Molina, Pla - 2002
26	On the convergence rate of good-turing estimators - McAllester, Schapire - 2000
25	H.: Predicting protein secondary structure using stochastic tree grammars. Machine learning 29 - Abe, Mamitsuka - 1997
23	The Zero Frequency Problem: Estimating the Probabilities of Novel Events in Adaptive Text Compression - Witten - 1991
21	Locally testable languages - Zalcstein - 1972
19	PAC-learnability of probabilistic deterministic finite state automata - Clark, Thollard - 2004
18	Learning DFA from Simple Examples - Parekh, Honavar - 1997
17	Y.: Links between probabilistic automata and hidden markov models: probability distributions, learning models and induction algorithms - Dupont, Denis, et al. - 2005
17	Stochastic context-free grammar induction with a genetic algorithm using local search - Kammeyer, Belew - 1996
14	Probabilistic estimation of stochastic regular syntax-directed translation schemes - Casacuberta - 1995
14	Pac learning with simple examples - Denis, D’Halluin, et al. - 1996
13	Architectures for speech-to-speech translation using finite-state models - Casacuberta - 2002
12	Pac learning under helpful distributions - Denis, Gilleron - 1997
10	Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata - Higuera, Thollard - 2000
9	Some statistical-estimation methods for stochastic finite-state transducers - Picó, Casacuberta - 2001
9	Using knowledge to improve N-Gram Language Modeling through the MGGI methodology - VIDAL - 1996
9	Integrated handwriting recognition and interpretation via finite-state models - Juan, Toselli, et al.
9	Finite-state transducers for speech-input translation - Casacuberta - 2001
9	Experiments on the Application of IOHMMs to Model Financial Returns Series - Bengio, Lauzon, et al. - 2001
9	Approximating grammar probabilities: Solution of a conjecture - Chaudhuri, Rao - 1986
9	Language learning from stochastic input - Kapur, Bilardi - 1992
7	Smoothing Probabilistic Automata: An Error-Correcting Approach - Dupont, Amengual - 2004
5	Some Relations among Stochastic Finite State Networks Used in Automatic Speech Recogntion - Casacuberta - 1990
4	Statistical estimation of stochastic context-free grammars - Casacuberta - 1995
3	Probabilistic finite state automata – part I - Vidal, Thollard, et al. - 2004