Introduction to algorithms
Morphological parsing and the lexicon
Lexical representation and process
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
SIAM Journal on Computing
Light parsing as finite state filtering
Extended finite state models of language
Finite-State Language Processing
Finite-State Language Processing
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
FSA Utilities: A Toolbox to Manipulate Finite-State Automata
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
A Rational Design for a Weighted Finite-State Transducer Library
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
Discovery of linguistic relations using lexical attraction
Discovery of linguistic relations using lexical attraction
Practical experiments with regular approximation of context-free languages
Computational Linguistics - Special issue on finite-state methods in NLP
A non-projective dependency parser
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Incremental finite-state parsing
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Regular expressions for language engineering
Natural Language Engineering
Partial parsing via finite-state cascades
Natural Language Engineering
Two-level description of Turkish morphology
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
A cascaded finite-state parser for syntactic analysis of Swedish
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Approximating context-free grammars with a finite-state calculus
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Finite-state approximation of constraint-based grammars using left-corner grammar transforms
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
A new statistical parser based on bigram lexical dependencies
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Compiling and using finite-state syntactic rules
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Three new probabilistic models for dependency parsing: an exploration
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
On the structural complexity of natural language sentences
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Finite-state parsing and disambiguation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
A statistical parser for Czech
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Context-free parsing through regular approximation
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
A dependency-based method for evaluating broad-coverage parsers
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Pseudo-projective dependency parsing
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Morphology-syntax interface for Turkish LFG
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Deterministic dependency parsing of English text
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Annotating grammatical functions for German using finite-state cascades
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Natural language watermarking via morphosyntactic alterations
Computer Speech and Language
Computational Linguistics
LAW '07 Proceedings of the Linguistic Annotation Workshop
ICCPOL'06 Proceedings of the 21st international conference on Computer Processing of Oriental Languages: beyond the orient: the research challenges ahead
Regular approximation of link grammar
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
Approximating dependency grammars through intersection of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Turkish constituent chunking with morphological and contextual features
CICLing'13 Proceedings of the 14th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
| Hi-index | 0.00 |
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.