计算机科学 ›› 2011, Vol. 38 ›› Issue (1): 207-209.
• 人工智能 • 上一篇 下一篇
韩习武,Roland Hausser
出版日期:
发布日期:
基金资助:
HAN Xi-wu,Roland Hausser
Online:
Published:
摘要: 概率Earley句法分析算法采用Viterbi路径构造输入序列的句法树,由于文法限制,存在空树问题。提出了扩展启始状态、省略未覆盖句首和补充未覆盖子树等方法来对Viterbi路径进行扩展,解决了绝大多数空树问题,并有效提高了Earley算法的整体性能。
关键词: Viterbi路径,句法分析,概率Earley算法
Abstract: Probabilistic Earlcy algorithm applies Viterbi path to construct parse trees for input sequences, but the grammar limits often result in many empty trees.This paper exploited optional start states, new sequential beginnings and more subtrees to extend the traditional Viterbi path, removed almost all empty trees, and improved the general parsing performance of Earley algorithm.
Key words: Viterbi path, Parsing, Probabilistic earley algorithm
韩习武,Roland Hausser. 基于扩展Viterbi路径的概率Earley算法[J]. 计算机科学, 2011, 38(1): 207-209. https://doi.org/
HAN Xi-wu,Roland Hausser. Probabilistic Earley Algorithm Based on Extended Viterbi Path[J]. Computer Science, 2011, 38(1): 207-209. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2011/V38/I1/207
Cited