Smoothing probabilistic automata: An error-correcting approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1891, Issue , 2000, Pages 51-64

  Dupont, Pierre ^a   Amengual, Juan Carlos ^b  

^a UNIVERSITÉ JEAN MONNET   (France)

^b UNIVERSITAT JAUME I   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ADVANCED TRAVELER INFORMATION SYSTEMS; AUTOMATA THEORY; COMPUTATIONAL GRAMMARS; ERRORS; INFERENCE ENGINES;

DATA SPARSENESS PROBLEM; ERROR-CORRECTING; FREE PARAMETERS; NON-ZERO PROBABILITY; PROBABILISTIC AUTOMATA; STATISTICAL ESTIMATION; TEST SET PERPLEXITY; TRAVEL INFORMATION;

PROBABILITY DISTRIBUTIONS;

EID: 84974727481     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45257-7_5     Document Type: Conference Paper

References (17)

1. J.-C. Amengual and E. Vidal. Efficient error-correcting viterbi parsing. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-20(10), October 1998.
2. J.-C. Amengual, E. Vidal, and J.-M. Benedi. Simplifying language through error- correcting techniques. In International Conference on Spoken Language Processing, pages 841-844, 1996.
3. R. Carrasco and J. Oncina. Learning stochastic regular grammars by means of a state merging method. In Grammatical Inference and Applications, ICGI’94, number 862 in Lecture Notes in Artificial Intelligence, pages 139-150, Alicante, Spain, 1994. Springer Verlag.
4. R. Carrasco and J. Oncina. Learning deterministic regular gramars from stochastic samples in polynomial time. Theoretical Informatics and Applications, 33(1):1-19, 1999.
5. P. Dupont and L. Chase. Using symbol clustering to improve probabilistic automaton inference. In Grammatical Inference, ICGI’98, number 1433 in Lecture Notes in Artificial Intelligence, pages 232-243, Ames, Iowa, 1998. Springer Verlag.
6. G.D. Forney. The Viterbi algorithm. IEEE Proceedings, 3:268-278, 1973.
7. D. Freitag. Using grammatical inference to improve precision in information extraction. In Workshop on Automata Induction, Grammatical Inference, and Language Acquisition, Fourteenth International Conference on Machine Learning, Nashville, Tennessee, 1997.
8. G.W. Hart and A. Bouloutas. Correcting dependent errors in sequences generated by finite-state processes. IEEE Trans. on Information Theory, 39(4):1249-1260, July 1993.
9. L. Hirschman. Multi-site data collection for a spoken language corpus. In Proceedings of DARPA Speech and Natural Language Workshop, pages 7-14, Arden House, NY, 1992.
10. K. Kita, Y. Fukui, M. Nagata, and T. Morimoto. Automatic acquisition of probabilistic dialogue models. In Proceedings of ISSD96, workshop of the International Conference on Spoken Language Processing, pages 196-199, Philadelphia, October 1996.
11. J.B. Kruskal. An overview of sequence comparison. In D. Sankoff and J.B. Kruskal, editors, Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison, pages 1-44. Addison-Wesley, Reading, Massachusetts, 1983.
12. 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 Grammatical Inference, number 1433 in Lecture Notes in Artificial Intelligence, pages 1-12, Ames, Iowa, 1998. Springer-Verlag.
13. H. Ney, U. Essen, and R. Kneser. On structuring probabilistic dependences in stochastic language modelling. Computer Speech and Language, 8:1-38, 1994.
14. J. Oncina and P. García. Inferring regular languages in polynomial update time. In N. Pérez de la Blanca, A. Sanfeliu, and E.Vidal, editors, Pattern Recognition and Image Analysis, volume 1 of Series in Machine Perception and Artificial Intelligence, pages 49-61. World Scientific, Singapore, 1992.
15. D. Ron, Y. Singer, and N. Tishby. On the learnability and usage of acyclic probabilistic automata. In Proceedings of the Eighth Annual Conference on Computational Learning Theory, pages 31-40, Santa Cruz, CA, 1995. ACM Press.
16. H. Rulot and E. Vidal. An efficient algorithm for the inference of circuit-free automata. In G. Ferratè, T. Pavlidis, A. Sanfeliu, and H. Bunke, editors, Advances in Structural and Syntactic Pattern Recognition, pages 173-184. NATO ASI, Springer-Verlag, 1988.
17. M. Young-Lai and F. Tompa. Stochastic grammatical inference of text database structure. To appear in Machine Learning, 2000.