Elements of the Theory of Computation
Elements of the Theory of Computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computational Complexity and Natural Language
Computational Complexity and Natural Language
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Probabilistic tree-adjoining grammar as a framework for statistical natural language processing
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
A computational model of language performance: Data Oriented Parsing
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
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
Natural Language Engineering
Context-sensitive spoken dialogue processing with the DOP model
Natural Language Engineering
A DOP model for semantic interpretation
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
Spoken dialogue interpretation with the DOP model
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Parsing with the shortest derivation
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
A statistical theory of dependency syntax
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
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
Tree-gram parsing lexical dependencies and structural relations
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Robust data oriented spoken language understanding
New developments in parsing technology
Learning tree patterns for syntactic parsing
Acta Cybernetica
Statistical machine translation by parsing
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
An all-subtrees approach to unsupervised parsing
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
A better N-best list: practical determinization of weighted finite tree automata
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Unsupervised parsing with U-DOP
CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
Monte carlo inference and maximization for phrase-based translation
CoNLL '09 Proceedings of the Thirteenth Conference on Computational Natural Language Learning
Linguistic theory in statistical language learning
NeMLaP3/CoNLL '98 Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning
A unified model of structural organization in language and music
Journal of Artificial Intelligence Research
Bayesian learning of a tree substitution grammar
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
Variational decoding for statistical machine translation
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 2 - Volume 2
Simple, accurate parsing with an all-fragments grammar
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Viterbi training for PCFGs: hardness results and competitiveness of uniform initialization
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Accurate parsing with compact tree-substitution grammars: Double-DOP
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Exact inference for generative probabilistic non-projective dependency parsing
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Finding the most probable string and the consensus string: an algorithmic study
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Discontinuous data-oriented parsing: a mildly context-sensitive all-fragments grammar
SPMRL '11 Proceedings of the Second Workshop on Statistical Parsing of Morphologically Rich Languages
Bayesian induction of syntactic language models for brazilian portuguese
PROPOR'12 Proceedings of the 10th international conference on Computational Processing of the Portuguese Language
Deciding the twins property for weighted tree automata over extremal semifields
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
Improving NLP through marginalization of hidden syntactic structure
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Word segmentation, unknown-word resolution, and morphological agreement in a hebrew parsing system
Computational Linguistics
| Hi-index | 0.00 |
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the following problems are NP-hard: computing the Most Probable Parse from a sentence or from a word-graph, and computing the Most Probable Sentence (MPS) from a word-graph. The NP-hardness of computing the MPS from a word-graph also holds for Stochastic Context-Free Grammars (SCFGs).