ACL RD-TEC 1.0 Summarization of C96-2215
Paper Title:
COMPUTATIONAL COMPLEXITY OF PROBABILISTIC DISAMBIGUATION BY MEANS OF TREE-GRAMMARS
COMPUTATIONAL COMPLEXITY OF PROBABILISTIC DISAMBIGUATION BY MEANS OF TREE-GRAMMARS
Primarily assigned technology terms:
Other assigned terms:
- alphabet
- case
- computational complexity
- conjunct
- context-free grammars
- derivation
- derivations
- evaluation function
- fact
- generative capacity
- grammar
- grammars
- heuristic
- human processing
- left-most derivation
- method
- normal form
- parse
- polynomial algorithm
- polynomial time
- probabilistic model
- probabilities
- probability
- sentence
- sentences
- stochastic context-free grammars
- symbols
- syntactic model
- technique
- terminals
- transformation
- tree
- tree grammars
- turing machine
- understanding
