Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
Constraint grammar as a framework for parsing running text
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Finite-state parsing and disambiguation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Robustness beyond shallowness: incremental deep parsing
Natural Language Engineering
Tagging and morphological disambiguation of Turkish text
ANLC '94 Proceedings of the fourth 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
Finite state morphology and information retrieval
Natural Language Engineering
Partial parsing via finite-state cascades
Natural Language Engineering
Ambiguity resolution in a reductionistic parser
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Tagging French: comparing a statistical and a constraint-based method
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
A syntax-based part-of-speech analyser
EACL '95 Proceedings of the seventh 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
Constructing lexical transducers
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Syntactic analysis of natural language using linguistic rules and corpus-based patterns
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Parallel replacement in finite state calculus
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Dependency parsing with an extended finite state approach
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Describing syntax with star-free regular expressions
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Dependency Parsing with an Extended Finite-State Approach
Computational Linguistics
Evita: a robust event recognizer for QA systems
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
WFSC: a new weighted finite state compiler
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Compiling simple context restrictions with nondeterministic automata
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Constraint grammar parsing with left and right sequential finite transducers
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
| Hi-index | 0.00 |
A language-independent framework for syntactic finite-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in this formalism. As a substantial example, fragments from a nontrivial finite-state grammar of English are discussed.The linguistic framework of the present approach is based on a surface syntactic tagging scheme by F. Karlsson. This representation is slightly less powerful than phrase structure tree notation, letting some ambiguous constructions be described more concisely.The finite-state rule compiler implements what was briefly sketched by Koskenniemi (1990). It is based on the calculus of finite-state machines. The compiler transforms rules into rule-automata. The run-time parser exploits one of certain alternative strategies in performing the effective intersection of the rule automata and the sentence automaton.Fragments of a fairly comprehensive finite-state grammar of English are presented here, including samples from non-finite constructions as a demonstration of the capacity of the present formalism, which goes far beyond plain disambiguation or part of speech tagging. The grammar itself is directly related to a parser and tagging system for English created as a part of project SIMPR using Karlsson's CG (Constraint Grammar) formalism.