论文信息 - An Alternative LR Algorithm for TAGs

An Alternative LR Algorithm for TAGs

We present a new LR algorithm for tree-adjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much simpler, being very close to traditional LR parsing for context-free grammars. The construction of derived trees and the computation of features also become straightforward.

Mark-Jan Nederhof | M. Nederhof

[1] Masaru Tomita,et al. Efficient parsing for natural language , 1985 .

[2] Masaru Tomita,et al. Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems , 1985 .

[3] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[4] Aravind K. Joshi,et al. An Introduction to Tree Adjoining Grammar , 1987 .

[5] Eljas Soisalon-Soininen,et al. Parsing Theory: Volume II Lr(k) and Ll(k) Parsing , 1990 .

[6] Eljas Soisalon-Soininen,et al. LR(k) and LL(k) parsing , 1990 .

[7] K. Vijay-Shanker,et al. Deterministic Left to Right Parsing of Tree Adjoining Languages , 1990, ACL.

[8] Mark-Jan Nederhof,et al. Increasing the Applicability of LR Parsing , 1993, IWPT.

[9] Harry Bunt,et al. Recent Advances in Parsing Technology , 1996 .

[10] Mark-Jan Nederhof. Linear Indexed Automata and Tabulation of TAG Parsing , 1998, TAPD.