Algorithm schemata and data structures in syntactic processing
Readings in natural language processing
Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
A comparison of rule-invocation strategies in context-free chart parsing
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
A practical comparison of parsing strategies
ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics
A process-activation based parsing algorithm for the development of Natural Language Grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Language As a Cognitive Process: Syntax
Language As a Cognitive Process: Syntax
| Hi-index | 0.00 |
A new approach to bottom-up parsing that extends Augmented Context-Free Grammar to a Process Grammar is formally presented. A Processor Grammar (PG) defines a set of rules suited for bottom-up parsing and conceived as processes that are applied by a PG Processor. The matching phase is a crucial step for process application, and a parsing structure for efficient matching is also presented. The PG Processor is composed of a process scheduler that allows immediate constituent analysis of structures, and behaves in a non-deterministic fashion. On the other side, the PG offers means for implementing specific parsing strategies improving the lack of determinism innate in the processor.