ACL RD-TEC 1.0 Summarization of E95-1015
Paper Title:
THE PROBLEM OF COMPUTING THE MOST PROBABLE TREE IN DATA-ORIENTED PARSING AND STOCHASTIC TREE GRAMMARS
THE PROBLEM OF COMPUTING THE MOST PROBABLE TREE IN DATA-ORIENTED PARSING AND STOCHASTIC TREE GRAMMARS
Primarily assigned technology terms:
- algorithm
- approximation
- atis
- blind testing
- bottom-up parsing
- chart parsing
- chart parsing algorithm
- collapsing
- computing
- data-oriented parsing
- disambiguation
- disambiguation algorithm
- disambiguation process
- distributed processing
- heuristic optimization
- information system
- modeling
- monte carlo algorithm
- monte carlo disambiguation
- monte carlo methods
- optimization
- optimization algorithm
- parsing
- parsing algorithm
- processing
- pruning
- random sampling
- sampling
- search
- sentence perception
- viterbi
- viterbi algorithm
- viterbi optimization
Other assigned terms:
- ambiguity
- approach
- case
- context-free grammar
- contextual information
- convergence
- corpora
- cpu time
- cubic time
- derivation
- derivation forest
- derivations
- distribution
- elementary tree
- estimation
- events
- exponential time
- fact
- feature
- forest
- generation
- grammar
- grammars
- heuristic
- hypothesis
- implementation
- input string
- interpretation
- knowledge
- language corpus
- method
- opinion
- parse
- parse forest
- parse tree
- part-of-speech
- pennsylvania treebank
- phrase
- polynomial time
- prepositional phrase
- probabilities
- probability
- probability distribution
- procedure
- process
- processing paradigm
- random sample
- sentence
- sentences
- sparse data
- spoken language
- spoken language corpus
- stochastic context-free grammar
- stochastic tree-adjoining grammar
- substring
- subtree
- subtrees
- syntactic categories
- tags
- test set
- theory
- time complexity
- training
- training set
- tree
- tree-adjoining grammar
- treebank
- trees
- verb
- word
- word strings
- words
