An Earley-type recognizer for dependency grammar

Lombardo, V.; Lesmo, Leonardo

doi:10.3115/993268.993294

Cited by 19 publications

(18 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The time complexity of projective parsers is comparable with context-free parsers: for the sentences of length n, it is in O(n 3 ) in the case of functional and bilexical dependency grammars (Lombardo andLesmo 1996, Eisner 1997). However, the projectivity condition for the parses restricts the admissible analyses to the subset of dependency trees that do not contain dependencies that cross one other in the drawings of the trees.…”

Section: Introductionmentioning

confidence: 83%

On Dependency Analysis via Contractions and Weighted FSTs

Yli-Jyrä

2012

Shall We Play the Festschrift Game?

View full text Add to dashboard Cite

Arc contractions in syntactic dependency graphs can be used to decide which graphs are trees. The paper observes that these contractions can be expressed with weighted finite-state transducers (weighted FST) that operate on stringencoded trees. The observation gives rise to a finite-state parsing algorithm that computes the parse forest and extracts the best parses from it. The algorithm is customizable to functional and bilexical dependency parsing, and it can be extended to non-projective parsing via a multi-planar encoding with prior results on high recall. Our experiments support an analysis of projective parsing according to which the worst-case time complexity of the algorithm is quadratic to the sentence length, and linear to the overlapping arcs and the number of functional categories of the arcs. The results suggest several interesting directions towards efficient and highprecision dependency parsing that takes advantage of the flexibility and the demonstrated ambiguity-packing capacity of such a parser.

show abstract

Section: Introductionmentioning

confidence: 83%

On Dependency Analysis via Contractions and Weighted FSTs

Yli-Jyrä

2012

Shall We Play the Festschrift Game?

View full text Add to dashboard Cite

show abstract

“…The dependency structure is the analysis focusing on the modifying and modified relations among the words. The importance of such an approach has been widely recognized in recent years, and there are studies of the analysis procedure [4,7,9,21]. Proposed have been a method to resolve the syntactic ambiguity based on the dependency structure [5], and a method to generate the translated sentence based on the dependency structure [2,14].…”

Section: Introductionmentioning

confidence: 99%

“…(1) The method where the dependency is generated based on the dependency constraint [7,21] (2) The head information is attached to the grammatical rule, and the parse tree is converted to the dependency structure based on that information [4,5,9] In either method, there arises a problem when the incremental dependency parsing is to be realized.…”

Section: Introductionmentioning

confidence: 99%

Incremental dependency parsing based on headed context-free grammar

et al. 2005

View full text Add to dashboard Cite

SUMMARYThis paper proposes the incremental dependency parsing method based on the context-free grammar with dependency information. In the proposed method, the reachability, which represents the relation between categories, is used. In parallel to the inputting of sentence, the dependency, which is the relation between the modifying word and the modified word, is computed. In the proposed method, the parse tree to cover the inputted fragment of the sentence is not needed. Consequently, the method can compute the dependency more efficiently than the method that computes the dependency from the parse tree. As a result of a parsing experiment using ATIS corpus, the proposed method utilizing the reachability is demonstrated to be effective in reducing the parsing time.

show abstract

“…To overcome the inadequacy of such formalisms, [5] suggests extending the notation of [4] with regular expressions in the righthand side, similar to the approach used in extended context-free grammars (for example, [6]). This approach was worked out in some detail in [7], and in a similar manner in [8], who present a string-rewriting version of gdg.…”

Section: Related Workmentioning

confidence: 99%