Dependency Parsing with an Extended Finite State Approach

This paper 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, no independent items except sentential head, etc, are filtered via finite state filters. We have applied the parser to dependency parsing of Turkish.

[1]  Kimmo Koskenniemi,et al.  Compiling and Using Finite-State Syntactic Rules , 1992, COLING.

[2]  Rebecca N. Wright,et al.  Finite-State Approximation of Phrase Structure Grammars , 1991, ACL.

[3]  Jason Eisner,et al.  Three New Probabilistic Models for Dependency Parsing: An Exploration , 1996, COLING.

[4]  Daniel Dominic Sleator,et al.  Parsing English with a Link Grammar , 1995, IWPT.

[5]  Michael Collins,et al.  A New Statistical Parser Based on Bigram Lexical Dependencies , 1996, ACL.

[6]  David Elworthy.  A Finite-state Parser with Dependency Structure Output , 2000, IWPT.

[7]  Yves Schabes,et al.  Parsing with Finite-State Transducers , 1997 .

[8]  Jane J. Robinson.  Dependency Structures and Transformational Rules , 1970 .

[9]  Changning Huang,et al.  Dependency Grammar and the Parsing of Chinese Sentences , 1994, ArXiv.

[10]  Douglas E. Appelt,et al.  FASTUS: A Cascaded Finite-State Transducer for Extracting Information from Natural-Language Text , 1997, ArXiv.

[11]  Timo Järvinen,et al.  Towards an implementable dependency grammar , 1998, ArXiv.

[12]  Sofie Johansson Kokkinakis,et al.  A Cascaded Finite-State Parser for Syntactic Analysis of Swedish , 1999, EACL.

[13]  Deniz Yuret,et al.  Discovery of linguistic relations using lexical attraction , 1998, ArXiv.

[14]  Gregory Grefenstette,et al.  Regular expressions for language engineering , 1996, Natural Language Engineering.

[15]  Mark-Jan Nederhof,et al.  Context-Free Parsing through Regular Approximation , 1998 .

[16]  Igor Mel’čuk,et al.  Dependency Syntax: Theory and Practice , 1987 .

[17]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[18]  Jean-Pierre Chanod,et al.  Incremental Finite-State Parsing , 1997, ANLP.

[19]  John Lafferty,et al.  Grammatical Trigrams: A Probabilistic Model of Link Grammar , 1992 .

[20]  Emmanuel Giguet,et al.  From Part of Speech Tagging to Memory-based Deep Syntactic Analysis , 1997, IWPT.

[21]  Gregory Grefenstette.  Light parsing as finite state filtering , 1999 .

[22]  Gertjan van Noord.  FSA Utilities: A Toolbox to Manipulate Finite-State Automata , 1996, Workshop on Implementing Automata.

[23]  Edmund Grimley-Evans.  Approximating Context-Free Grammars with a Finite-State Calculus , 1997, ACL.

[24]  Timo Järvinen,et al.  A non-projective dependency parser , 1997, ANLP.

[25]  Dekang Lin,et al.  A dependency-based method for evaluating broad-coverage parsers , 1995, Natural Language Engineering.

[26]  Mark Johnson,et al.  Finite-state Approximation of Constraint-based Grammars using Left-corner Grammar Transforms , 1998, ACL.

[27]  Martin Kay,et al.  Regular Models of Phonological Rule Systems , 1994, CL.

[28]  Michael Collins,et al.  A Statistical Parser for Czech , 1999, ACL.

[29]  Kemal Oflazer.  Two-level description of Turkish morphology , 1993 .

[30]  Jorge Hankamer,et al.  Morphological parsing and the lexicon , 1989 .

[31]  Mehryar Mohri,et al.  A Rational Design for a Weighted Finite-State Transducer Library , 1997, Workshop on Implementing Automata.

[32]  Dekang Lin.  On the Structural Complexity of Natural Language Sentences , 1996, COLING.

[33]  Kimmo Koskenniemi,et al.  Finite-State Parsing and Disambiguation , 1990, COLING.

[34]  Mark-Jan Nederhof,et al.  Practical Experiments with Regular Approximation of Context-Free Languages , 1999, CL.

[35]  Alan W. Black.  Finite State Machines from Feature Grammars , 1989, IWPT.

[36]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[37]  Steven P. Abney.  Partial parsing via finite-state cascades , 1996, Natural Language Engineering.