Stochastic analysis of lexical and semantic enhanced structural language model

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

Volumn 4201 LNAI, Issue , 2006, Pages 97-111

  Wang, Shaojun ^a,b   Wang, Shaomin ^c   Cheng, Li ^d   Greiner, Russell ^b   Schuurmans, Dale ^b  

^a WRIGHT STATE UNIVERSITY   (United States)

^b UNIVERSITY OF ALBERTA   (Canada)

^c Oracle ^*  (United States)

^d CSIRO   (Australia)

Author keywords

Language modeling; Probabilistic latent semantic analysis; Structural language model; Trigram

Indexed keywords

CONTEXT FREE GRAMMARS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBABILITY; SEMANTICS; TOPOLOGY;

PROBABILISTIC LATENT SEMANTIC ANALYSIS; STRUCTURAL LANGUAGE MODEL; TRIGRAM;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33750373743     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11872436_9     Document Type: Conference Paper

References (20)

1. S. Abney, D. McAllester, and F. Pereira. (1999). Relating probabilistic grammars and automata. Proceedings of ACL, 542-549.
2. J. Baker. (1979). Trainable grammars for speech recognition. Proceedings of the 97th Meeting of the Acoustical Society of America, 547-550.
3. C. Chelba. (1999). Exploiting syntactic structure for natural language modeling. Ph.D. Dissertation, Johns Hopkins University.
4. C. Chelba and F. Jelinek. (2000). Structured language modeling. Computer Speech and Language, 14(4):283-332.
5. N. Chomsky. (1956). Three models for the description of language. IRE Transactions on Information Theory, 2(3):113-24.
6. A. Dempster, N. Laird and D. Rubin. (1977). Maximum likelihood estimation from incomplete data via the EM algorithm. Journal of Royal Statistical Society, 39:1-38.
7. T. Hofmann. (2001). Unsupervised learning by probabilistic latent semantic analysis. Machine Learning, 42(1):177-196
8. J. Hopcroft and J. Ullman. (1979). Introduction to Automata Theory, Languages and Computation. Addison-Wesley.
9. F. Jelinek, J. Lafferty and R. Mercer. (1992). Basic methods of probabilistic context-free grammars. Speech Recognition and Understanding: Recent Advances, Trends, and Applications, P. Laface and R. De Mori, (Editors), 347-360, Springer-Verlag.
10. F. Jelinek. (1998). Statistical Methods for Speech Recognition. MIT Press.
11. F. Jelinek and C. Chelba. (1999). Putting language into language modeling. Proceedings of the 6th EuroSpeech Communication and Technology, 1-6.
12. F. Jelinek. (2004). Stochastic analysis of structured language modeling. Mathematical Foundations of Speech and Language Processing, M. Johnson, S. Khudanpur, M. Ostendorf and R. Rosenfeld (Editors), 37-72, Springer-Verlag.
13. S. Khudanpur and J. Wu. (2000). Maximum entropy techniques for exploiting syntactic, semantic and collocational dependencies in language modeling. Computer Speech and Language, 14(4):355-372.
14. F. Kschischang, B. Prey and H. Loeliger. (2001). Factor graphs and the sumproduct algorithm IEEE Transactions on Information Theory, 47(2):498-519.
15. J. Lafferty. (2000). A derivation of the inside-outside algorithm from the EM algorithm. IBM Research Report 21636.
16. K. Lari and S. Young. (1990). The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language, 4:35-56.
17. S. Lauritzen. (1996). Graphical Models. Oxford Press.
18. C. Shannon. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(2):379-423.
19. S. Wang, S. Wang, R. Greiner, D. Schuurmans and L. Cheng. (2005). Exploiting syntactic, semantic and lexical regularities in language modeling via directed Markov random fields. The 22nd International Conference on Machine Learning, 953-960.
20. 3. Information and Control, 10:198-208.