Estimating grammar parameters using bounded memory

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

Volumn 2484, Issue , 2002, Pages 185-198

  Oates, Tim ^a   Heeringa, Brent ^b  

^a UNIVERSITY OF MARYLAND BALTIMORE COUNTY   (United States)

^b University of Massachusetts Amherst   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GRAMMARS; CONTEXT FREE GRAMMARS; INFERENCE ENGINES; STOCHASTIC SYSTEMS;

BOUNDED MEMORY; EMBEDDED AGENTS; LARGE AMOUNTS; MEMORY REQUIREMENTS; NOVEL ALGORITHM; STANDARD PROBLEMS; STOCHASTIC CONTEXT FREE GRAMMAR; SUMMARY STATISTIC;

PARAMETER ESTIMATION;

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

References (16)

1. J. E. Hopcroft, and J. E. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley (1979).
2. P. Langley and S. Stromsten, Learning Context-Free Grammars with a Simplicity Bias, Machine Learning: ECML 2000, LNAI 1810, Springer-Verlag, 220-228 (2000).
3. K. Nakamura, and Y. Ishiwata, Synthesizing context free grammars from sample strings based on inductive CYK algorithm, Fifth International Colloquium on Grammatical Inference (ICGI 2000), LNAI 1891, Springer-Verlag, 186-195 (2000).
4. R. Parekh, and V. Honavor, An incremental interactive algorithm for regular grammar inference, Third International Colloquium on Grammatical Inference (ICGI-96), 222-237 (1996).
5. Y. Sakakibara, Recent advances of grammatical inference, Theoretical Computer Science, 185, 15-45 (1997).
6. Y. Sakakibara, and M. Kondo, GA-based learning of context-free grammars using tabular representations, Proc. 16th International Conference of Machine Learning, 354-360 (1999).
7. Y. Sakakibara, and H. Muramatsu, Learning of context-free grammars partially structured examples, Fifth International Colloquium on Grammatical Inference (ICGI 2000), LNAI 1891, Springer-Verlag, 229-240 (2000).
8. Schabes, Y., Roth, M., Osborne, R.: Parsing the Wall Street Journal with the inside-outside algorithm. In: Proceedings of the 6th Conference of the European Chapter of the Association for Computational Linguistics. (1993) 341-346
9. Hopcroft, J. E., Ullman, J. D.: Introductin to Automata Theory, Languages, and Computation. Addison Wesley (1979)
10. Lari, K., Young, S. J.: The estimation of stochastic context-free grammars using the insideoutiside algorithm. Computer Speech and Language 4 (1990) 35-56
11. Lari, K., Young, S. J.: Applications of stochastic context-free grammars using the insideoutside algorithm. Computer Speech and Language 5 (1991) 237-257
12. Dempster, N. M., Laird, A. P., Rubin, D. B.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B 39 (1977) 185-197
13. Neal, R. M., Hinton, G. E.: A view of the EM algorithm that justifies incremental, sparse, and other variants. In Jordan, M. I., ed.: Learning in Graphical Models, Kluwer Academic (1998)
14. Boyen, X., Koller, D.: Approximate learning of dynamic models. In: Neural Information Processing Systems. (1998)
15. Cook, C. M., Rosenfeld, A., Aronson, A.: Grammatical inference by hill climbing. Informational Sciences 10 (1976) 59-80
16. Stolcke, A., Omohundro, S.: Inducing probabilistic grammars by bayesian model merging. In Carrasco, R. C., Oncina, J., eds.: Grammatical Inference and Applications, Berlin, Heidelberg, Springer (1994) 106-118