Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
An efficient augmented-context-free parsing algorithm
Computational Linguistics
Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
HLT '91 Proceedings of the workshop on Speech and Natural Language
An efficient context-free parsing algorithm
Communications of the ACM
Computational Complexity and Natural Language
Computational Complexity and Natural Language
Deterministic Techniques for Efficient Non-Deterministic Parsers
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars
Computational Linguistics - Special issue on using large corpora: I
The interface between phrasal and functional constraints
Computational Linguistics
Head-driven parsing for lexicalist grammars: experimental results
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
The syntactic regularity of English noun phrases
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Polynomial time and space shift-reduce parsing of arbitrary context-free grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Quasi-destructive graph unification
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
DCG induction using MDL and parsed corpora
Learning language in logic
An efficient implementation of the head-corner parser
Computational Linguistics
On building a more efficient grammar by exploiting types
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
Experiments with corpus-based LFG specialization
ANLC '00 Proceedings of the sixth conference on Applied natural language processing
Automatic extraction of subcategorization from corpora
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Maximizing top-down constraints for unification-based systems
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Guided parsing of range concatenation languages
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
A generic approach to parallel chart parsing with an application to LinGO
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Parallel distributed grammar engineering for practical applications
COLING-GEE '02 Proceedings of the 2002 workshop on Grammar engineering and evaluation - Volume 15
Development in parsing technology: from theory to application
New developments in parsing technology
Measure for measure: towards increased component comparability and exchange
New developments in parsing technology
Force deployment analysis with generalized grammar
Information Fusion
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
Left-corner unification-based natural language processing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Efficient large-scale parsing: a survey
Proceedings of the COLING-2000 Workshop on Efficiency In Large-Scale Parsing Systems
| Hi-index | 0.00 |
The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorithms, using a wide-coverage grammar. The results imply that the study and optimisation of unification-based parsing must rely on empirical data until complexity theory can more accurately predict the practical behaviour of such parsers1.