Evaluation of a parallel chart parser

Authors:
Ralph Grishman;Mahesh Chitrao
Affiliations:
New York University, New York, New York;New York University, New York, New York
Venue:
ANLC '88 Proceedings of the second conference on Applied natural language processing
Year:
1988

Citing 4
Cited 2

Upper Bounds for Speedup in Parallel Parsing

Journal of the ACM (JACM)
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling
Meta-rules as a basis for processing ill-formed input

Computational Linguistics - Special issue on ill-formed input
Chart parsing and rule schemata in PSG

ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics

A bibliography on parallel parsing

ACM SIGPLAN Notices
An efficient Parallel Substrate for Typed Feature Structures on shared memory parallel machines

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a parallel implementation of a chart parser for a shared-memory multiprocessor. The speed-ups obtained with this parser have been measured for a number of small natural-language grammars. For the largest of these, part of an operational question-answering system, the parser ran 5 to 7 times faster than the serial version.