K. Atsumi et S. Masuyama, ON THE AMBIGUITY REDUCTION ABILITY OF A PROBABILISTIC CONTEXT-FREE GRAMMAR, IEICE transactions on fundamentals of electronics, communications and computer science, E81A(5), 1998, pp. 825-831
Citations number
14
Categorie Soggetti
Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture","Computer Science Information Systems
This paper studies the ambiguity reduction ability of a probabilistic
context-free grammar. We theoretically analyze a common behavior of an
y probabilistic context-free grammar. Moreover, we confirm by experime
nts that a probabilistic context-free grammar learnt from Japanese cor
pus has the ambiguity reduction ability as expected by the theoretical
analysis.