一种无回溯的自然语言分析算法

An Algorithm Without Backtracking for Natural Language Parsing

在自然语言的自动分析中 ,如果回溯过多会严重地降低分析的效率。依尔利算法 ,可以完全避免回溯。本文介绍了依尔利算法的基本原理 ,它的三种基本操作 ,并以实例详细地描述了依尔利算法分析句子的过程。

In natural language parsing, too much backtracking seriously decreases the parsing effect. The Earley algorithm, however, can completely avoid backtracking. In this paper, the author introduces the basic principles of Earley algorithm and its 3 fundamental operators. The parsing process of a sentence is described in detail as an example.