Browse > Article
http://dx.doi.org/10.5626/JOK.2017.44.3.239

A Model of Probabilistic Parsing Automata  

Lee, Gyung-Ok (Hanshin Univ.)
Publication Information
Journal of KIISE / v.44, no.3, 2017 , pp. 239-245 More about this Journal
Abstract
Probabilistic grammar is used in natural language processing, and the parse result of the grammar has to preserve the probability of the original grammar. As for the representative parsing method, LL parsing and LR parsing, the former preserves the probability information of the original grammar, but the latter does not. A characteristic of a probabilistic parsing automaton has been studied; but, currently, the generating model of probabilistic parsing automata has not been known. The paper provides a model of probabilistic parsing automata based on the single state parsing automata. The generated automaton preserves the probability of the original grammar, so it is not necessary to test whether or not the automaton is probabilistic parsing automaton; defining a probability function for the automaton is not required. Additionally, an efficient automaton can be constructed by choosing an appropriate parameter.
Keywords
probabilistic parsing; probabilistic grammars; probabilistic parsing automata; single state parsing automata; natural language processing;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 G.-O. Lee, "Grammar Classes Generating Single State Parsing Automata," Journal of KIISE: Software and Applications, Vol. 41, No. 7, pp. 518-522, 2014. (in Korean)
2 G.-O. Lee, "Application of Single-State Parsing Automata to LR Grammars," Journal of KIISE: Software and Applications, Vol. 43, No. 10, pp. 1079-1084, 2016. (in Korean)   DOI
3 A.V. Aho and J.D. Ullman, The Theory of Parsing, Translation and Compiling, Vols. 1 & 2, Prentice-Hall, Englewood Cliffs, NJ, 1972, 1973.
4 S. Sippu and E. Soisalon-Soininen, Parsing Theory, Vols. I & II, Springer, Berlin, 1990.
5 T. Briscoe, J. Carroll, "Generalized Probabilistic LR Parsing of Natural Language (corpora) with Unification-Based Grammars," Computational Linguistics, Vol. 19, No. 1, pp. 25-59, 1993.
6 Kentaro Inui, Virach Sornlertlamvanich, Hozumi Tanaka, and Takenobu Tokunaga, "A New Formalization of Probabilistic GLR Parsing," Proc. of the 5th International Workshop on Parsing Technologies, pp. 123-134, 1997.
7 Steven Abney, David McAllester, Fernando Pereira, "Relating Probabilistic Grammars and Automata," ACL '99 Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics on Computational Linguistics, pp. 542-549, 1999.
8 M.-J. Nederhof and G. Satta, "Probabilistic Parsing Strategies," Proc. of the 42nd Annual Meeting of the Association for Computational Linguistics, Barcelona, Spain, pp. 543-550, Jul. 2004.
9 M.-J. Nederhof and G. Satta, "Probabilistic Parsing Strategies," Journal of the ACM, Vol. 53, No. 3, pp. 406-436, 2006.   DOI
10 G.-O. Lee, "Constructing a Single State Parsing Automaton," Journal of KIISE: Software and Applications, Vol. 35, No. 11, pp. 701-705, 2008. (in Korean)