TY - JOUR T1 - A Model of Probabilistic Parsing Automata AU - Lee, Gyung-Ok JO - Journal of KIISE, JOK PY - 2017 DA - 2017/1/14 DO - KW - probabilistic parsing KW - probabilistic grammars KW - probabilistic parsing automata KW - single state parsing automata KW - natural language processing AB - 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.