Learning probabilistic residual finite state automata

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2484, Issue , 2002, Pages 77-91

  Esposito, Yann ^a   Lemay, Aurelien ^b   Denis, Francois ^a   Dupont, Pierre ^c  

^a AIX MARSEILLE UNIVERSITY   (France)

^b UNIV LILLE   (France)

^c UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; COMPUTATIONAL LINGUISTICS; STOCHASTIC SYSTEMS;

DETERMINISTIC FINITE AUTOMATA; INFERENCE ALGORITHM; INTRINSIC PROPERTY; PROBABILISTIC AUTOMATA; TARGET LANGUAGE;

INFERENCE ENGINES;

EID: 84943252476     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45790-9_7     Document Type: Conference Paper

References (10)

1. D. Angluin. Identifying languages from stochastic examples. Technical Report YALEU/DCS/RR-614, Yale University, New Haven, CT, 1988.
2. R. C. Carrasco and J. Oncina. Learning stochastic regular grammars by means of a state merging method. In International Conference on Grammatical Inference, pages 139-152, Heidelberg, September 1994. Springer-Verlag.
3. R. C. Carrasco and J. Oncina. Learning deterministic regular grammars from stochastic samples in polynomial time. RAIRO (Theoretical Informatics and Applications), 33(1):1-20, 1999.
4. F. Denis, A. Lemay, and A. Terlutte. Learning regular languages using non deterministic finite automata. In ICGI'2000, 5th International Colloquium on Grammatical Inference, volume 1891 of Lecture Notes in Artificial Intelligence, pages 39-50. Springer Verlag, 2000.
5. F. Denis, A. Lemay, and A. Terlutte. Learning regular languages using rfsa. In ALT 2001. Springer Verlag, 2001.
6. F. Denis, A. Lemay, and A. Terlutte. Residual finite state automata. In 18th Annual Symposium on Theoretical Aspects of Computer Science, volume 2010 of Lecture Notes in Computer Science, pages 144-157, 2001.
7. K. J. Lang, B. A. Pearlmutter, and R. A. Price. Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In Proc. 4th International Colloquium on Grammatical Inference-ICGI 98, volume 1433 of Lecture Notes in Artificial Intelligence, pages 1-12. Springer-Verlag, 1998.
8. J. Oncina and P. Garcia. Inferring regular languages in polynomial update time. In Pattern Recognition and Image Analysis, pages 49-61, 1992.
9. A. Stolcke and S. Omohundro. Inducing probabilistic grammars by Bayesian model merging. Lecture Notes in Computer Science, 862:106-118, 1994.
10. Franck Thollard, Pierre Dupont, and Colin de la Higuera. Probabilistic DFA inference using Kullback-Leibler divergence and minimality. In Proc. 17th International Conf. on Machine Learning, pages 975-982. Morgan Kaufmann, 2000.