A bag of useful techniques for efficient and robust parsing

Authors:
Bernd Kiefer;Hans-Ulrich Krieger;John Carroll;Rob Malouf
Affiliations:
German Research Center for Artificial Intelligence (DFKI), Saarbrücken;German Research Center for Artificial Intelligence (DFKI), Saarbrücken;University of Sussex Falmer, Brighton, UK;Stanford University, Stanford, CA
Venue:
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Year:
1999

Citing 10
Cited 38

Information-based syntax and semantics: Vol. 1: fundamentals

Information-based syntax and semantics: Vol. 1: fundamentals
Efficient implementation of lattice operations

ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to algorithms

Introduction to algorithms
Using restriction to extend parsing algorithms for complex-feature-based formalisms

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Quasi-destructive graph unification

ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
TDL: a type description language for constraint-based grammars

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
DISCO: an HPSG-based NLP system and its application for appointment scheduling

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Feature logic with disjunctive unification

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Strategic lazy incremental copy graph unification

COLING '90 Proceedings of the 13th 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

Preprocessing for Unification Parsing of Spoken Language

NLP '00 Proceedings of the Second International Conference on Natural Language Processing
Robustness beyond shallowness: incremental deep parsing

Natural Language Engineering
Introduction to this Special Issue

Natural Language Engineering
On building a more efficient grammar by exploiting types

Natural Language Engineering
Efficient feature structure operations without compilation

Natural Language Engineering
The LiLFeS Abstract Machine and its evaluation with the LinGO grammar

Natural Language Engineering
An HPSG parser with CFG filtering

Natural Language Engineering
Parser engineering and performance profiling

Natural Language Engineering
A compact architecture for dialogue management based on scripts and meta-outputs

ANLC '00 Proceedings of the sixth conference on Applied natural language processing
Ambiguity packing in constraint-based parsing: practical results

NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
A context-sensitive model for probabilistic LR parsing of spoken language with transformation-based postprocessing

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
An HPSG-to-CFG approximation of Japanese

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
An indexing scheme for typed feature structures

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 2
High precision extraction of grammatical relations

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Indexing methods for efficient parsing

NAACLstudent '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology: Proceedings of the HLT-NAACL 2003 student research workshop - Volume 3
High precision extraction of grammatical relations

New developments in parsing technology
On two classes of feature paths in large-scale unification grammars

New developments in parsing technology
A context-free superset approximation of unification-based grammars

New developments in parsing technology
Optimal ambiguity packing in context-free parsers with interleaved unification

New developments in parsing technology
Measure for measure: towards increased component comparability and exchange

New developments in parsing technology
Optimizing typed feature structure grammar parsing through non-statistical indexing

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
A polynomial parsing algorithm for the topological model: synchronizing constituent and dependency grammars, illustrated by German word order phenomena

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
The second release of the RASP system

COLING-ACL '06 Proceedings of the COLING/ACL on Interactive presentation sessions
Evaluating the accuracy of an unlexicalized statistical parser on the PARC DepBank

COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
From ubgs to cfgs a practical corpus-driven approach

Natural Language Engineering
Backbone extraction and pruning for speeding up a deep parser for dialogue systems

ScaNaLU '06 Proceedings of the Third Workshop on Scalable Natural Language Understanding
Efficacy of beam thresholding, unification filtering and hybrid parsing in probabilistic HPSG parsing

Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
The quick check pre-unification filter for typed grammars: extensions

Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Dependency constraints for lexical disambiguation

IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Offline compilation of chains for head-driven generation with constraint-based grammars

CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
Chart mining-based lexical acquisition with precision grammars

HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Extrinsic parse selection

HLT-SRWS '10 Proceedings of the NAACL HLT 2010 Student Research Workshop
Constraining robust constructions for broad-coverage parsing with precision grammars

COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Reducing overdetections in a French symbolic grammar checker by classification

CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part II
Approximate bit vectors for fast unification

MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
High efficiency realization for a wide-coverage unification grammar

IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
Large-scale corpus-driven PCFG approximation of an HPSG

IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
A formal approach to subgrammar extraction for NLP

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes new and improved techniques which help a unification-based parser to process input efficiently and robustly. In combination these methods result in a speed-up in parsing time of more than an order of magnitude. The methods are correct in the sense that none of them rule out legal rule applications.