忘恩负义的人
发表于 2025-3-23 10:01:00
http://reply.papertrans.cn/31/3030/302993/302993_11.png
Kidney-Failure
发表于 2025-3-23 15:05:38
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.
合适
发表于 2025-3-23 18:10:08
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.
缩短
发表于 2025-3-23 22:37:47
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
发表于 2025-3-24 03:10:07
http://reply.papertrans.cn/31/3030/302993/302993_15.png
不愿
发表于 2025-3-24 06:36:46
http://reply.papertrans.cn/31/3030/302993/302993_16.png
乱砍
发表于 2025-3-24 13:20:42
http://reply.papertrans.cn/31/3030/302993/302993_17.png
催眠
发表于 2025-3-24 16:49:13
The Springer International Series in Engineering and Computer Sciencehttp://image.papertrans.cn/e/image/302993.jpg
perimenopause
发表于 2025-3-24 23:04:48
https://doi.org/10.1007/978-1-4757-1885-0Parsing; algorithms; cognition; expert system; grammar; machine translation; natural language; natural lang
精确
发表于 2025-3-25 02:20:30
http://reply.papertrans.cn/31/3030/302993/302993_20.png