Computational complexity of probabilistic disambiguation: NP-completeness results for parsing problems that arise in speech and language processing applications

Grammars

Volumn 5, Issue 2, 2002, Pages 125-151

  Sima'an, Khalil ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Computational complexity; Formal grammars; NP Completeness; Probabilistic ambiguity resolution

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; NATURAL LANGUAGE PROCESSING SYSTEMS; OPTIMIZATION;

NATURAL LANGUAGE PROCESSING (NLP);

FORMAL LANGUAGES;

EID: 0036341851     PISSN: 13861793     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (43)

1. Towards history-based grammars: Using richer models for probabilistic parsing
2. A computational model of language performance: Data Oriented Parsing
3. Monte Carlo parsing
4. The problem of computing the most probable tree in data-oriented parsing and stochastic tree grammars
5. A probabilistic corpus-driven approach for Lexical Functional Grammar
6. Experiments with corpus-based LFG specialization
7. New figures of merit for best-first probabilistic chart parsing
8. Tree-bank grammars
9. Statistical parsing with an automatically-extracted tree adjoining grammar
10. A new statistical parser based on bigram lexical dependencies
11. Three generative, lexicalized models for statistical parsing
12. Computability, complexity and languages: Fundamentals of theoretical computer science
13. Decision tree parsing using a hidden derivation model
14. Tree adjoining grammars: How much context sensitivity is required to provide a reasonable structural description
15. Statistical decision-tree models for parsing
16. Building a large annotated corpus of English: The Penn treebank
17. Preliminary analysis of a Breadth-First Parsing Algorithm: Theoretical and experimental results
18. Word graphs: An efficient interface between continuous-speech recognition and language understanding
19. Inside-outside reestimation from partially bracketed corpora
20. An introduction to hidden Markov models
21. A linear observed time statistical parser based on maximum entropy models
22. Probabilistic tree-adjoining grammar as a framework for statistical natural language processing
23. A universal prior for integers and estimation by minimum description length
24. Probabilistic and weighted grammars
25. Language theory and language technology; Competence and performance
26. Stochastic lexicalized tree-adjoining grammars
27. Stochastic lexicalized context-free grammar
28. A corpus-based probabilistic grammar with only two non-terminals
29. Tree-gram parsing: Lexical dependencies and structural relations
30. Building a tree-bank of modern Hebrew texts
31. The intersection of finite state automata and definite clause grammars