The ATIS spoken language systems pilot corpus
HLT '90 Proceedings of the workshop on Speech and Natural Language
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
A study of tree adjoining grammars
A study of tree adjoining grammars
Mathematical and computational aspects of lexicalized grammars
Mathematical and computational aspects of lexicalized grammars
Inside-outside reestimation from partially bracketed corpora
ACL '92 Proceedings of the 30th 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
Predicting Protein Secondary Structure Using Stochastic Tree Grammars
Machine Learning - Special issue on learning with probabilistic representations
The view from the trenches: issues in the ontology of restricted domains
Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
NLP '00 Proceedings of the Second International Conference on Natural Language Processing
A Theory of Stochastic Grammars
NLP '00 Proceedings of the Second International Conference on Natural Language Processing
Weighted deductive parsing and Knuth's algorithm
Computational Linguistics
An alternative conception of tree-adjoining derivation
Computational Linguistics
Computational Linguistics
Lexical rules in constraint-based grammars
Computational Linguistics
Natural Language Engineering
Automatic extraction of subcategorization from corpora
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Using an annotated corpus as a stochastic grammar
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Integrating symbolic and statistical representations: the lexicon pragmatics interface
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
Prefix probabilities from stochastic Tree Adjoining Grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Conditions on consistency of probabilistic Tree Adjoining Grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Distributional clustering of English words
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Bayesian grammar induction for language modeling
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Some novel applications of Explanation-Based Learning to parsing Lexicalized Tree-Adjoining Grammars
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Capturing CFLs with Tree Adjoining Grammars
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Similarity-based estimation of word cooccurrence probabilities
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Head automata and bilingual tiling: translation with minimal representations
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Inside-outside reestimation from partially bracketed corpora
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
An alternative conception of tree-adjoining derivation
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
A hybrid Japanese parser with hand-crafted grammar and statistics
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Probabilistic tree-adjoining grammar as a framework for statistical natural language processing
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Three new probabilistic models for dependency parsing: an exploration
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Efficient parsing for bilexical context-free grammars and head automaton grammars
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
An efficient implementation of a new DOP model
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Facilitating treebank annotation using a statistical parser
HLT '01 Proceedings of the first international conference on Human language technology research
Can subcategorization help a statistical dependency parser?
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
What is the minimal set of fragments that achieves maximal parse accuracy?
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Applying co-training methods to statistical parsing
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
Multitext Grammars and synchronous parsers
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Statistical parsing with an automatically-extracted tree adjoining grammar
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Inside-outside reestimation from partially bracketed corpora
HLT '91 Proceedings of the workshop on Speech and Natural Language
Head-Driven Statistical Models for Natural Language Parsing
Computational Linguistics
Two statistical parsing models applied to the Chinese Treebank
CLPW '00 Proceedings of the second workshop on Chinese language processing: held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics - Volume 12
Automated extraction of tags from the penn treebank
New developments in parsing technology
Automated extraction of Tree-Adjoining Grammars from treebanks
Natural Language Engineering
Cross-entropy and estimation of probabilistic context-free grammars
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Estimation of consistent probabilistic context-free grammars
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Cross parser evaluation and tagset variation: a French treebank study
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Using an annotated language corpus as a virtual stochastic grammar
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
A probabilistic model for sequence alignment with context-sensitive indels
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Computation of infix probabilities for probabilistic context-free grammars
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
An information-theoretic measure to evaluate parsing difficulty across treebanks
ACM Transactions on Speech and Language Processing (TSLP)
| Hi-index | 0.00 |
The notion of stochastic lexicalized tree-adjoining grammar (SLTAG) is formally defined. The parameters of a SLTAG correspond to the probability of combining two structures each one associated with a word. The characteristics of SLTAG are unique and novel since it is lexieally sensitive (as N-gram models or Hidden Markov Models) and yet hierarchical (as stochastic context-free grammars).Then, two basic algorithms for SLTAG arc introduced: an algorithm for computing the probability of a sentence generated by a SLTAG and an inside-outside-like iterative algorithm for estimating the parameters of a SLTAG given a training corpus.Finally, we should how SLTAG enables to define a lexicalized version of stochastic context-free grammars and we report preliminary experiments showing some of the advantages of SLTAG over stochastic context-free grammars.