Dependency parsing with an extended finite-state approach

Kemal Oflazer

Research output: Contribution to journalArticle

27 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)515-544
Number of pages30
JournalComputational Linguistics
Issue number4
Publication statusPublished - Dec 2003
Externally publishedYes


ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Linguistics and Language
  • Language and Linguistics

Cite this