Dependency parsing with an extended finite-state approach
K Oflazer - Computational Linguistics, 2003 - direct.mit.edu
Computational Linguistics, 2003•direct.mit.edu
This article presents a dependency parsing scheme using an extended finite-state
approach. The parser augments input representation with “channels” so that links
representing syntactic dependency relations among words can be accommodated and
iterates on the input a number of times to arrive at a fixed point. Intermediate configurations
violating various constraints of projective dependency representations such as no crossing
links and no independent items except sentential head are filtered via finite-state filters. We …
approach. The parser augments input representation with “channels” so that links
representing syntactic dependency relations among words can be accommodated and
iterates on the input a number of times to arrive at a fixed point. Intermediate configurations
violating various constraints of projective dependency representations such as no crossing
links and no independent items except sentential head are filtered via finite-state filters. We …
Abstract
This article presents a dependency parsing scheme using an extended finite-state approach. The parser augments input representation with “channels” so that links representing syntactic dependency relations among words can be accommodated and iterates on the input a number of times to arrive at a fixed point. Intermediate configurations violating various constraints of projective dependency representations such as no crossing links and no independent items except sentential head are filtered via finite-state filters. We have applied the parser to dependency parsing of Turkish.
MIT Press