Eliminative parsing with graded constraints
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Incremental dependency parsing
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Incremental parsing and reason maintenance
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Robust parsing with weighted constraints
Natural Language Engineering
Hi-index | 0.00 |
The results of an experiment are presented in which an approach for robust parsing has been applied incrementally. They confirm that due to the robust nature of the underlying technology an arbitrary prefix of a sentence can be analysed into an intermediate structural description which is able to direct the further analysis with a high degree of reliability. Most notably, this result can be achieved without adapting the grammar or the parsing algorithms to the case of incremental processing. The resulting incremental parsing procedure is significantly faster if compared to a non-incremental best-first search. Additionally it turns out that longer sentences benefit most from this acceleration.