A Predictive Left-Corner Parser for Tree Adjoining Grammars
نویسندگان
چکیده
Tree Adjoining Grammar (TAG) is a formalism that has become very popular for the description of natural languages. However, the parsers for TAG that have been defined on the basis of the Earley’s algorithm entail important computational costs. In this article, we propose to extend the left corner relation from Context Free Grammar (CFG) to TAG in order to define an efficient left corner parser for TAG that improves the performance of the Earley-like parsers guaranteeing the valid prefix property, due to a remarkable reduction in the number of predictions operations with respect to Earley-like parsing algorithms.
منابع مشابه
A Left Corner Parser for Tree Adjoining Grammars
Tabular parsers can be defined as deduction systems where formulas, called items, are sets of complete or incomplete constituents (Sikkel, 1997; Shieber, Schabes and Pereira, 1995). Formally, given an input string w = a1 . . . an with n ≥ 0 and a grammar G, a parser IP is a tuple (I,H,D) where I is a set of items, H is a set of hypothesis ([ai, i − 1, i] with 1 ≤ i ≤ n) that encodes the input s...
متن کاملHead-Corner Parsing for TAG
This paper describes a bidirectional head-corner parser for (uniication-based versions of) Lexicalized Tree Adjoining Grammars.
متن کاملPractical experiments in parsing using Tree Adjoining Grammars
We present an implementation of a chart-based head-corner parsing algorithm for lexicalized Tree Adjoining Grammars. We report on some practical experiments where we parse 2250 sentences from the Wall Street Journal using this parser. In these experiments the parser is run without any statistical pruning; it produces all valid parses for each sentence in the form of a shared derivation forest. ...
متن کاملDeterministic Left to Right Parsing of Tree Adjoining Languages
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended to Tree Adjoining Grammars (TAGs). We use a machine, called Bottom-up Embedtied Push Down Automaton (BEPDA), that recognizes in a bottom-up fashion the set of Tree Adjoining Languages (and exactly this se0. Each parser...
متن کاملXTAG - A Graphical Workbench for Developing Tree-Adjoining Grammars
We describe a workbench (XTAG) for the development of tree-adjoining grammars and their parsers, and discuss some issues that arise in the design of the graphical interface. Contrary to string rewriting grammars generating trees, the elementary objects manipulated by a tree-adjoining grammar are extended trees (i.e. trees of depth one or more) which capture syntactic information of lexical item...
متن کامل