Building a large annotated corpus of English: the penn treebank
Computational Linguistics - Special issue on using large corpora: II
PCFG models of linguistic tree representations
Computational Linguistics
A maximum-entropy-inspired parser
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Three generative, lexicalised models for statistical parsing
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Text chunking using regularized Winnow
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
The necessity of parsing for predicate argument recognition
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Chunking with support vector machines
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
Single-classifier memory-based phrase chunking
ConLL '00 Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning - Volume 7
Deterministic dependency parsing of English text
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Graph transformations in data-driven dependency parsing
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
A fast, accurate deterministic parser for Chinese
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Advances in discriminative parsing
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Discriminative classifiers for deterministic dependency parsing
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
A best-first probabilistic shift-reduce parser
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Probabilistic Models for Action-Based Chinese Dependency Parsing
ECML '07 Proceedings of the 18th European conference on Machine Learning
Computational Linguistics
Algorithms for deterministic incremental dependency parsing
Computational Linguistics
Unsupervised search-based structured prediction
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Toward a psycholinguistically-motivated model of language processing
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
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
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Parser combination by reparsing
NAACL-Short '06 Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers
NAACL-Short '07 Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers
Ungreedy methods for Chinese deterministic dependency parsing
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Symbolic preference using simple scoring
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
Computational challenges in parsing by classification
CHSLP '06 Proceedings of the Workshop on Computationally Hard Problems and Joint Inference in Speech and Language Processing
Constituent parsing by classification
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Analysis of discourse structure with syntactic dependencies and data-driven shift-reduce parsing
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Transition-based parsing of the Chinese treebank using a global discriminative model
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
A deterministic method to predict phrase boundaries of a syntactic tree
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
Tree topological features for unlexicalized parsing
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
An analysis of tree topological features in classifier-based unlexicalized parsing
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I
Syntactic processing using the generalized perceptron and beam search
Computational Linguistics
Optimistic backtracking: a backtracking overlay for deterministic incremental parsing
HLT-SS '11 Proceedings of the ACL 2011 Student Session
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
ICCPOL'06 Proceedings of the 21st international conference on Computer Processing of Oriental Languages: beyond the orient: the research challenges ahead
A machine learning parser using an unlexicalized distituent model
CICLing'10 Proceedings of the 11th international conference on Computational Linguistics and Intelligent Text Processing
CuteForce: deep deterministic HPSG parsing
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Discourse structure and language technology
Natural Language Engineering
| Hi-index | 0.00 |
We present a classifier-based parser that produces constituent trees in linear time. The parser uses a basic bottom-up shift-reduce algorithm, but employs a classifier to determine parser actions instead of a grammar. This can be seen as an extension of the deterministic dependency parser of Nivre and Scholz (2004) to full constituent parsing. We show that, with an appropriate feature set used in classification, a very simple one-path greedy parser can perform at the same level of accuracy as more complex parsers. We evaluate our parser on section 23 of the WSJ section of the Penn Treebank, and obtain precision and recall of 87.54% and 87.61%, respectively.