Tree-bank Grammars
Towards efficient statistical parsing using lexicalized grammatical information
Towards efficient statistical parsing using lexicalized grammatical information
Building a large annotated corpus of English: the penn treebank
Computational Linguistics - Special issue on using large corpora: II
Supertagging: an approach to almost parsing
Computational Linguistics
A maximum-entropy-inspired parser
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
New models for improving supertag disambiguation
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
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
Statistical decision-tree models for parsing
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
A new statistical parser based on bigram lexical dependencies
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Probabilistic tree-adjoining grammar as a framework for statistical natural language processing
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Stochastic lexicalized tree-adjoining grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Towards automatic generation of natural language generation systems
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Statistical parsing with an automatically-extracted tree adjoining grammar
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
The Penn Treebank: annotating predicate argument structure
HLT '94 Proceedings of the workshop on Human Language Technology
CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank
Computational Linguistics
Complexity, parsing, and factorization of tree-local multi-component tree-adjoining grammar
Computational Linguistics
| Hi-index | 0.00 |
The accuracy of statistical parsing models can be improved with the use of lexical information. Statistical parsing using Lexicalized tree adjoining grammar (LTAG), a kind of lexicalized grammar, has remained relatively unexplored. We believe that is largely in part due to the absence of large corpora accurately bracketed in terms of a perspicuous yet broad coverage LTAG. Our work attempts to alleviate this difficulty. We extract different LTAGs from the Penn Treebank. We show that certain strategies yield an improved extracted LTAG in terms of compactness, broad coverage, and supertagging accuracy. Furthermore, we perform a preliminary investigation in smoothing these grammars by means of an external linguistic resource, namely, the tree families of the XTAG grammar, a hand built grammar of English.