Dependency Parsing with an Extended Finite-State Approach
Bibliographic Data
| ID | 12156101 |
|---|---|
| Authors | Kemal Oflazer (0000-0002-4977-0079, Faculty of Engineering and Natural Sciences, Sabanci University, Orhanli, 34956, Tuzla, Istanbul, Turkey., corresponding author) |
| Year | 2003 |
| Volume | 29 |
| Issue | 4 |
| Pages | 515-544 |
| Publication date | 2003-12-01 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Computational Linguistics (JOURNAL) |
| Journal identifiers | ISSN: 0891-2017 • E-ISSN: 1530-9312 |
| Publisher | Association for Computational Linguistics (PUBLISHER • US) |
| DOI | 10.1162/089120103322753338 |
| OpenAlex | W2028908189 |
| Language | EN |
| Citations received | 2 |
| References cited | 6 |
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
Bottom-up parsing · Dependency (UML · Dependency grammar · Iterated function · Natural language processing · Parsing · Representation (politics · Top-down parsing · Computer Science · Mathematics · Natural Language Processing Techniques · semigroups and automata theory · Topic Modeling · Artificial Intelligence · Theoretical Computer Science
| Citations per year | 0.11 |
|---|---|
| Citation span | 2008 - 2008 (1) |
| Highly cited | No |