Inference of regular languages using model simplicity

Proceedings - 24th Australasian Computer Science Conference, ACSC 2001

Volumn , Issue , 2001, Pages 69-76

  Hingston, P ^a  

^a EDITH COWAN UNIVERSITY   (Australia)

Author keywords

grammatical inference; Minimum Message Length principle

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; CONTEXT FREE LANGUAGES; DATA MINING;

GRAMMATICAL INFERENCES; INFERENCE OF REGULAR LANGUAGES; MINIMUM MESSAGE LENGTHS; NEGATIVE EXAMPLES; POSITIVE EXAMPLES; SEQUENTIAL ANALYSIS;

INFERENCE ENGINES;

EID: 84962815074     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSC.2001.906625     Document Type: Conference Paper

References (16)

1. B. R. Gaines, "Behaviour/structure transformation under uncertainty," International Journal of Man-Machine Studies, vol. 8, pp. 337-365, 1976.
2. A. Nerode, "Linear automaton transformation," Proceeding of the American Mathematical Society, vol. 9, pp. 541-544, 1958.
3. P. Dupont, Miclet, L., & Vidal, E., "What is the search space of the regular inference?," presented at Second International Colloquium on Grammatical Inference (ICGI'94), Alicante, Spain, 1994.
4. A. Stolcke, and Omohundra, S., "Best-first Model Merging for Hidden Markov Model Induction," International Computer Science Institute, Berkeley, CA TR-94-003, 1994.
5. J. Oncina, & Garcia, P., "Inferring regular languages in polynomial update time," in Pattern Recognition and Image Analysis, N. Perez et al, Ed.: World Scientific, 1992, pp. 49-61.
6. J. D. Patrick, & Chong, K.E., "Real-time inductive inference for analysing human behaviour," presented at Paper presented at the International Joint Conference on AI (IJCAI'91), Workshop number 6 on Integrating AI into Databases, Sydney, 1991.
7. C. Wallace, & Boulton, D., "An information measure for classification," Computing Journal, vol. 11, pp. 185-195, 1968.
8. C. S. Wallace, & Georgeff, M.P., "A general objective for inductive inference," Monash University, Department of Computer Science, Technical Report 32, 1983.
9. A. Raman, Andreae, P. & Patrick, J., "A Beam Search Algorithm for PFSA Inference," Pattern Analysis and Applications, vol. 1, pp. 121-129, 1998.
10. P. F. Hingston, & Lees, C.D., "Sequential analysis with probabilistic finite state automata," University of Western Australia, Department of Computer Science, Perth, Western Australia, Technical Report 94/12, 1994.
11. C. D. Lees, "Analyzing event sequences using Probabilistic Finite State Automata," In Preparation, 2000.
12. R. C. Carrasco, & Oncina, J., "Learning stochastic regular grammar by means of a state merging method," presented at The Second International Colloquium on Grammatical Inference (ICGI'94), Alicante, Spain, 1994.
13. P. Grunwald, "A Minimum Description Length Approach to Grammar Inference," in Connectionist, statistical and symbolic approaches to learning for natural language processing, G. S. S. R. Wermter, E., Ed. Berlin: Springer-Verlag, 1996, pp. 203-216.
14. J. Rissanen, "A universal prior for integers and estimation by minimum description length," Annals of Statistics, vol. 11, pp. 416-431, 1982.
15. E. Horowitz, & Sahni, S., Fundamentals of Data Structures in Pascal, Second Edition ed. Rockville, Maryland, USA: Computer Science Press, 1987.
16. M. Tomita, "Dynamic construction of finite-automata from examples using hill-climbing," presented at The 4th Annual Cognitive Science Conference, 1982.