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

忘恩負義的人

Kidney-Failure

Informal Description of the Algorithm,ends the standard LR parsing algorithm with the idea of a graph-structured stack, so that it can handle natural language grammars. Finally, section 2.4 describes how to represent all possible parse trees efficiently, so that as the ambiguity of a sentence grows exponentially, it takes at most polynomial space to represent them.

合適

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.

縮短

https://doi.org/10.1007/978-3-322-90189-7This chapter, which may be omitted without loss of context, presents a more precise specification of the algorithm. Section 4.2 presents a formal specification of the algorithm as a recognizer (i.e. no parse forest is produced), and section 4.3 gives a formal specification of the algorithm as a parser (i.e. a parse forest is produced).

humectant

不愿

亂砍

催眠

The Springer International Series in Engineering and Computer Sciencehttp://image.papertrans.cn/e/image/302993.jpg

perimenopause

https://doi.org/10.1007/978-1-4757-1885-0Parsing; algorithms; cognition; expert system; grammar; machine translation; natural language; natural lang

精確