Handbook of formal languages, vol. 3
Large Margin Classification Using the Perceptron Algorithm
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Head-driven statistical models for natural language parsing
Head-driven statistical models for natural language parsing
Lr parsing for tree adjoining grammars and its application to corpus-based natural language parsing
Lr parsing for tree adjoining grammars and its application to corpus-based natural language parsing
Building a large annotated corpus of English: the penn treebank
Computational Linguistics - Special issue on using large corpora: II
Probabilistic top-down parsing and language modeling
Computational Linguistics
A maximum-entropy-inspired parser
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Long-distance scrambling and tree adjoining grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Bidirectional parsing of lexicalized tree adjoining grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Building parallel LTAG for French and Italian
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Some computational properties of Tree Adjoining Grammars
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Disambiguation of super parts of speech (or supertags): almost parsing
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Coordination in Tree Adjoining Grammars: formalization and implementation
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Statistical parsing with an automatically-extracted tree adjoining grammar
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
A classification of grammar development strategies
COLING-GEE '02 Proceedings of the 2002 workshop on Grammar engineering and evaluation - Volume 15
The Proposition Bank: An Annotated Corpus of Semantic Roles
Computational Linguistics
Incremental parsing with the perceptron algorithm
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Creating a CCGbank and a wide-coverage CCG lexicon for German
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
TAG, dynamic programming, and the perceptron for efficient, feature-rich parsing
CoNLL '08 Proceedings of the Twelfth Conference on Computational Natural Language Learning
LTAG dependency parsing with bidirectional incremental construction
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Accurate parsing of the proposition bank
NAACL-Short '06 Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers
MICA: a probabilistic dependency parser based on tree insertion grammars application note
NAACL-Short '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers
Learning with annotation noise
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1
Exploration of the LTAG-spinal formalism and Treebank for semantic role labeling
GEAF '09 Proceedings of the 2009 Workshop on Grammar Engineering Across Frameworks
String-to-dependency statistical machine translation
Computational Linguistics
An unsupervised approach for linking automatically extracted and manually crafted LTAGs
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I
Top-down recognizers for MCFGs and MGs
CMCL '11 Proceedings of the 2nd Workshop on Cognitive Modeling and Computational Linguistics
Incremental, predictive parsing with psycholinguistically motivated tree-adjoining grammar
Computational Linguistics
| Hi-index | 0.01 |
We present a very efficient statistical incremental parser for LTAG-spinal, a variant of LTAG. The parser supports the full adjoining operation, dynamic predicate coordination, and non-projective dependencies, with a formalism of provably stronger generative capacity as compared to CFG. Using gold standard POS tags as input, on section 23 of the PTB, the parser achieves an f-score of 89.3% for syntactic dependency defined on LTAG derivation trees, which are deeper than the dependencies extracted from PTB alone with head rules (for example, in Magerman's style).