Dependency parsing with an extended finite-state approach

Warning The system is temporarily closed to updates for reporting purpose.

Oflazer, Kemal (2003) Dependency parsing with an extended finite-state approach. Computational Linguistics, 29 (4). pp. 515-544. ISSN 0891-2017

PDF (Open Access) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1162/089120103322753338


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.

Item Type:Article
Additional Information:WoS - Open Access (Other Gold) / Scopus - Open Access
Subjects:Q Science > QA Mathematics > QA075 Electronic computers. Computer science
P Language and Literature > P Philology. Linguistics > P101-410 Language. Linguistic theory. Comparative grammar
ID Code:14099
Deposited By:Kemal Oflazer
Deposited On:01 Jul 2010 14:58
Last Modified:17 Jun 2020 16:29

Repository Staff Only: item control page