自然语言处理中的概率语法.PDFVIP

Journal of Contemporary Linguistics, 2005, No. 2. Probabilistic Grammar in Natural Language Processing (revised) Feng Zhiwei Korterm, KAIST, Daejeon, Korea Ministry of Education, Institute of Applied Linguistics, Beijing, China e-mail: zwfeng@world.kaist.ac.kr zwfengde@ Abstract: Probabilistic grammar assigns a probability to a sentence or a string of words, while attempting to capture more sophisticated syntactic information than the context-free grammar (CFG). A probabilistic context-free grammar (PCFG) is a context-free grammar in which every rule is annotated with the probability of choosing that rule. Each PCFG rule is treated as if it were conditionally independent; thus the probability of a sentence is computed by multiplying the probabilities of each rule in the parse of the sentence. The CYK algorithm is a bottom-up dynamic programming parsing algorithm. It can be augmented to compute the probability of a parse while it is parsing a sentence. PCFG probabilities can be learned by counting in a parsed corpus (tree-bank), or by parsing a corpus. The Inside-Outside algorithm is a way of dealing with the fact that the sentence being parsed is ambiguous. Probabilistic lexicalized context-free grammar augments PCFG with a lexical head for each rule. The probability of a rule can be conditioned on the lexical head or nearby head. Keyword: context-free grammar, probabilistic context-free grammar, probabilistic CYK algorithm, probabilistic lexicalized context-free grammar 《当代语言学》，2005 年，第 2 期 自然语言处理中的概率语法（修改稿） 冯志伟 韩国科学技术院计算机系, Korterm, KAIST 教育部语言文字应用研究所 摘要 上下文无关语法在处理句法歧义时遇到了困难，概率上下文无关语法和概