Mathematical and computational aspects of lexicalized grammars
Mathematical and computational aspects of lexicalized grammars
Towards efficient statistical parsing using lexicalized grammatical information
Towards efficient statistical parsing using lexicalized grammatical information
An alternative conception of tree-adjoining derivation
Computational Linguistics
Computational Linguistics
Recovering latent information in treebanks
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
On the parameter space of generative lexicalized statistical parsing models
On the parameter space of generative lexicalized statistical parsing models
A uniform method of grammar extraction and its applications
EMNLP '00 Proceedings of the 2000 Joint SIGDAT conference on Empirical methods in natural language processing and very large corpora: held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics - Volume 13
Bridge the gap between statistical and hand-crafted grammars
Computer Speech and Language
| Hi-index | 0.00 |
This paper discusses a novel probabilistic synchronous TAG formalism, synchronous Tree Substitution Grammar with sister adjunction (TSG+SA). We use it to parse a language for which there is no training data, by leveraging off a second, related language for which there is abundant training data. The grammar for the resource-rich side is automatically extracted from a treebank; the grammar on the resource-poor side and the synchronization are created by handwritten rules. Our approach thus represents a combination of grammar-based and empirical natural language processing. We discuss the approach using the example of Levantine Arabic and Standard Arabic.