摘要
最大熵模型已被广泛应用于多种自然语言处理任务,但一些现有研究工作在解码算法上存在有待改进的地方。本文提出了一个最大熵模型的树-栅格最优N解码算法,并对算法性能进行了分析和比较。算法的另一优点在于可以在解码过程中检测并控制潜在的标注冲突。
Maximum entropy models have been widely adapted in various natural language processing tasks. But there are some deficiencies in the decoding algorithm used by many previous researches. A n-best tree trellis algorithm is proposed for decoding in maximum entropy models. The performance analysis and comparison with other decoding algorithms are also presented. Another advantage of our method is that the possible collision in action sequences can be detected and eliminated.
出处
《计算机科学》
CSCD
北大核心
2005年第10期167-169,共3页
Computer Science
基金
国家自然科学基金(编号60272088)
