Titlebook: Efficient Parsing for Natural Language; A Fast Algorithm for Masaru Tomita Book 1986 Springer Science+Business Media New York 1986 Parsing.

OWL

BUST

Concluding Remarks, processing. The experiments have shown that this parsing algorithm seems significantly more efficient than Earley’s algorithm and perhaps any other general context-free parsing algorithms, as far as practical natural language processing is concerned.

好开玩笑

故意钓到白杨

贪心

Comparison with Other Algorithms,al n. algorithms only when an input sentence is tremendously long. Practically speaking, on the other hand, the most well-known parsing algorithm is Earley’s algorithm [21, 20, 1, 25], which runs in time .(n.). This book compares our algorithm mainly with this algorithm.

思考才皱眉

fluoroscopy

Sentence Disambiguation by Asking,. In practice, however, not all ambiguity problems can be solved by those techniques at the current state of the art. Moreover, some sentences are . ambiguous, that is, even a human cannot disambiguate them, unless he knows the intent of the speaker.

驳船

Interactive/Personal Machine Translation,ach to machine translation. This pilot system adopts neither our parsing algorithm nor on-line parsing, and is far away from being practical, but some promising data have been found from experiments with the system.

谎言

R. Kraschutzki (Tresor-Kassirer)tand it here. Although we give a formal specification of the algorithm in chapter 4, it is provided mainly for proving correctness of the algorithm in appendix B, and is not intended to help the reader understand the algorithm.

ESO