標題: Titlebook: Efficient Parsing for Natural Language; A Fast Algorithm for Masaru Tomita Book 1986 Springer Science+Business Media New York 1986 Parsing. [打印本頁] 作者: tricuspid-valve 時間: 2025-3-21 18:41
書目名稱Efficient Parsing for Natural Language影響因子(影響力)
書目名稱Efficient Parsing for Natural Language影響因子(影響力)學科排名
書目名稱Efficient Parsing for Natural Language網(wǎng)絡公開度
書目名稱Efficient Parsing for Natural Language網(wǎng)絡公開度學科排名
書目名稱Efficient Parsing for Natural Language被引頻次
書目名稱Efficient Parsing for Natural Language被引頻次學科排名
書目名稱Efficient Parsing for Natural Language年度引用
書目名稱Efficient Parsing for Natural Language年度引用學科排名
書目名稱Efficient Parsing for Natural Language讀者反饋
書目名稱Efficient Parsing for Natural Language讀者反饋學科排名
作者: OREX 時間: 2025-3-22 00:10 作者: 系列 時間: 2025-3-22 03:55 作者: pericardium 時間: 2025-3-22 06:29
Der Gesetzgeber und die Gentechnikalgorithm. Valiant [55] reduced the context-free parsing problem to the Boolean Matrix Multiplication problem [22], and his algorithm runs in time .(n.). This algorithm is, however, of only theoretical interest, because the coefficient of n. is so large that the algorithm runs faster than convention作者: Canvas 時間: 2025-3-22 11:16
Organisation von Produktionssystemen,hms, including Earley’s algorithm and breath-first ATN, also have this characteristic, only a few practical systems, if any, have taken advantage of it. Taking advantage of this left-to-right-ness, we have implemented on-line parsing on the basis of our parsing algorithm. The on-line parser starts p作者: glomeruli 時間: 2025-3-22 16:21 作者: glomeruli 時間: 2025-3-22 17:43 作者: 縱欲 時間: 2025-3-23 01:13 作者: 現(xiàn)實 時間: 2025-3-23 04:58
Efficient Parsing for Natural Language978-1-4757-1885-0Series ISSN 0893-3405 作者: Abbreviate 時間: 2025-3-23 08:01 作者: 忘恩負義的人 時間: 2025-3-23 10:01 作者: Kidney-Failure 時間: 2025-3-23 15:05
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
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
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 作者: 不愿 時間: 2025-3-24 06:36 作者: 亂砍 時間: 2025-3-24 13:20 作者: 催眠 時間: 2025-3-24 16:49
The Springer International Series in Engineering and Computer Sciencehttp://image.papertrans.cn/e/image/302993.jpg作者: perimenopause 時間: 2025-3-24 23:04
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 作者: aphasia 時間: 2025-3-25 05:04 作者: thalamus 時間: 2025-3-25 09:55
0893-3405 e-Mellon University. My advisers, Herb Simon and Jaime Carbonell, deserve many thanks for their unfailing support, advice and encouragement during my graduate s978-1-4419-5198-4978-1-4757-1885-0Series ISSN 0893-3405 作者: GNAW 時間: 2025-3-25 15:36 作者: 裂隙 時間: 2025-3-25 18:20
Book 1986to the continuous speech recognition project at Carnegie-Mellon University. This work was done while I was pursuing a Ph.D degree at Carnegie-Mellon University. My advisers, Herb Simon and Jaime Carbonell, deserve many thanks for their unfailing support, advice and encouragement during my graduate s作者: 專心 時間: 2025-3-26 00:02 作者: 技術(shù) 時間: 2025-3-26 03:30 作者: dyspareunia 時間: 2025-3-26 08:08 作者: Interferons 時間: 2025-3-26 11:16
Comparison with Other Algorithms,algorithm. Valiant [55] reduced the context-free parsing problem to the Boolean Matrix Multiplication problem [22], and his algorithm runs in time .(n.). This algorithm is, however, of only theoretical interest, because the coefficient of n. is so large that the algorithm runs faster than convention作者: FANG 時間: 2025-3-26 16:02 作者: Needlework 時間: 2025-3-26 19:53
Sentence Disambiguation by Asking,hanism to select one intended parse out of a batch of parses. In theory, it is desirable for the system to be able to disambiguate a sentence by semantics and pragmatics, and a large number of techniques using semantic information have been developed to resolve natural language ambiguity [13, 45, 7]作者: OWL 時間: 2025-3-26 22:54 作者: BUST 時間: 2025-3-27 02:05
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-27 06:43 作者: 故意釣到白楊 時間: 2025-3-27 09:26 作者: 貪心 時間: 2025-3-27 14:20
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.作者: 思考才皺眉 時間: 2025-3-27 21:32 作者: fluoroscopy 時間: 2025-3-28 01:54
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.作者: 駁船 時間: 2025-3-28 03:23
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.作者: 謊言 時間: 2025-3-28 06:17
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 時間: 2025-3-28 13:57 作者: Perennial長期的 時間: 2025-3-28 14:47
Organisation von Produktionssystemen,arsing as soon as the user types in the first word of a sentence, without waiting for the end of line. In this section, we describe the benefits of instantiation of on-line parsing, and discuss some of its practical applications.作者: 字的誤用 時間: 2025-3-28 22:15
https://doi.org/10.1007/978-3-531-19351-9. 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.
