Abstract
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.
| Keywords: | bottom-up parser; top-down parser; Earley algorithm; backtracking; leftcorner table; chart; dotted rule; Directed Acyclic Graph (DAG) |
|---|
[Chinese Version | Index | Applied Linguistics (Yuyan Wenzi Yingyong) | Other Journals | Subscription form | Enquiry ]
Mail any comments and suggestions to
hkier-journal@cuhk.edu.hk .