A modular architecture for constraint-based parsing

Authors:
François Barthélemy;François Rouaix
Affiliations:
INRIA Rocquencourt, Le Chesnay, France;INRIA Rocquencourt, Le Chesnay, France
Venue:
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Year:
1994

Citing 5
Cited 0

AID: An alternative implementation of DCBs

New Generation Computing
Deterministic Techniques for Efficient Non-Deterministic Parsers

Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Subsumption-oriented Push-Down Automata

PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Using restriction to extend parsing algorithms for complex-feature-based formalisms

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Parsing as deduction

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a framework and a system for implementing, comparing and analyzing parsers for the some classes of Constraint-Based Grammars. The framework consists in a uniform theoretic description of parsing algorithms, and provides the structure for decomposing the system into logical components, with possibly several interchangeable implementations. Many parsing algorithms can be obtained by composition of the modules of our system. Modularity is also a way of achieving code sharing for the common parts of these various algorithms. Furthemore, the design helps reusing the existing modules when implementing, other algorithms. The system uses the flexible modularity provided by the programing languages Alcool-90, based on a type system that ensures the safety of module composition.