Empirical methods for artificial intelligence
Empirical methods for artificial intelligence
A maximum entropy approach to natural language processing
Computational Linguistics
Head-driven statistical models for natural language parsing
Head-driven statistical models for natural language parsing
Building a large annotated corpus of English: the penn treebank
Computational Linguistics - Special issue on using large corpora: II
Stochastic attribute-value grammars
Computational Linguistics
Supertagging: an approach to almost parsing
Computational Linguistics
Efficient feature structure operations without compilation
Natural Language Engineering
Statistical parsing and language modeling based on constraint dependency grammar
Statistical parsing and language modeling based on constraint dependency grammar
Estimators for stochastic "Unification-Based" grammars
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Investigating GIS and smoothing for maximum entropy taggers
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Dynamic programming for parsing and estimation of stochastic unification-based grammars
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Parsing with generative models of predicate-argument structure
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Accurate unlexicalized parsing
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
A SNoW based supertagger with application to NP chunking
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
A comparison of algorithms for maximum entropy parameter estimation
COLING-02 proceedings of the 6th conference on Natural language learning - Volume 20
Parsing the WSJ using CCG and log-linear models
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Probabilistic disambiguation models for wide-coverage HPSG parsing
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Coarse-to-fine n-best parsing and MaxEnt discriminative reranking
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
The importance of supertagging for wide-coverage CCG parsing
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Bidirectional inference with the easiest-first strategy for tagging sequence data
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Maximum entropy estimation for feature forests
HLT '02 Proceedings of the second international conference on Human Language Technology Research
A statistical constraint dependency grammar (CDG) parser
IncrementParsing '04 Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
IJCNLP'04 Proceedings of the First international joint conference on Natural Language Processing
Pruning the search space of a hand-crafted parsing system with a probabilistic parser
DeepLP '07 Proceedings of the Workshop on Deep Linguistic Processing
Deterministic shift-reduce parsing for unification-based grammars by using default unification
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Fast full parsing by linear-chain conditional random fields
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Adapting a lexicalized-grammar parser to contrasting domains
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
A log-linear model with an n-gram reference distribution for accurate HPSG parsing
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Efficient HPSG parsing with supertagging and CFG-filtering
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Porting a lexicalized-grammar parser to the biomedical domain
Journal of Biomedical Informatics
Effective analysis of causes and inter-dependencies of parsing errors
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
HPSG supertagging: a sequence labeling view
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Dependency constraints for lexical disambiguation
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Descriptive and empirical approaches to capturing underlying dependencies among parsing errors
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3 - Volume 3
A simple approach for HPSG supertagging using dependency information
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Efficient staggered decoding for sequence labeling
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Forest-guided supertagger training
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Computational linguistics and natural language processing
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I
Hi-index | 0.00 |
This paper describes an extremely lexicalized probabilistic model for fast and accurate HPSG parsing. In this model, the probabilities of parse trees are defined with only the probabilities of selecting lexical entries. The proposed model is very simple, and experiments revealed that the implemented parser runs around four times faster than the previous model and that the proposed model has a high accuracy comparable to that of the previous model for probabilistic HPSG, which is defined over phrase structures. We also developed a hybrid of our probabilistic model and the conventional phrase-structure-based model. The hybrid model is not only significantly faster but also significantly more accurate by two points of precision and recall compared to the previous model.