Extended Abstract

Efficiency of Top-Down Parsing of Recursive Adjunction for Tree Adjoining Grammar

---

Abstract

CKY-type parser and Earley-type parser are two widely-used parsing algorithms for Tree Adjoining Grammar (TAG). In contrast, a standard top-down parser is not efficient since the looping problem occurs during both the left and right recursion of standard TAG derivation. Roark (2001) combines the top-down parser for CFG with a beam search, showing that the probabilistic top-down parser yields a perplexity improvement over previous results. In this paper, we define the stochastic tree adjoining grammar and apply the probabilistic top-down parser for CFG to TAG. Comparing the parsing efficiency of the standard and alternative TAG derivation of the recursive adjunction, we find that the alternative derivation is more efficient since it avoids the looping problem of the right recursion, increasing the parsing efficiency of our top-down parser.

Keywords: computational syntax, top-down parsing, Tree Adjoining Grammar

How to Cite:

Ji, J., (2021) “Efficiency of Top-Down Parsing of Recursive Adjunction for Tree Adjoining Grammar”, Society for Computation in Linguistics 4(1), 374-379. doi: https://doi.org/10.7275/2236-2333