Implementation issues in the development of the PARSEC parser
Software—Practice & Experience
Structural disambiguation with constraint propagation
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Constraint grammar as a framework for parsing running text
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Robustness beyond shallowness: incremental deep parsing
Natural Language Engineering
An experiment on incremental analysis using robust parsing techniques
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Charting the depths of robust speech parsing
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Robust parsing with weighted constraints
Natural Language Engineering
Hybrid processing for grammar and style checking
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Numbat: abolishing privileges when licensing new constituents in constraint-oriented parsing
CSLP '06 Proceedings of the Third Workshop on Constraints and Language Processing
Multiword expressions as dependency subgraphs
MWE '04 Proceedings of the Workshop on Multiword Expressions: Integrating Processing
A model-theoretic framework for grammaticality judgements
FG'09 Proceedings of the 14th international conference on Formal grammar
Gradience, constructions and constraint systems
CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing
Problems of inducing large coverage constraint-based dependency grammar for czech
CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing
| Hi-index | 0.00 |
Natural language parsing is conceived to be a procedure of disambiguation, which successively reduces an initially totally ambiguous structural representation towards a single interpretation. Graded constraints are used as means to express well-formedness conditions of different strength and to decide which partial structures are locally least preferred and, hence, can be deleted. This approach facilitates a higher degree of robustness of the analysis, allows to introduce resource adaptivity into the parsing procedure, and exhibits a high potential for parallelization of the computation.