ACL RD-TEC 1.0 Summarization of P01-1060
Paper Title:
PARSE FOREST COMPUTATION OF EXPECTED GOVERNORS
PARSE FOREST COMPUTATION OF EXPECTED GOVERNORS
Authors: Helmut Schmid and Mats Rooth
Primarily assigned technology terms:
- algorithm
- binary branching
- chunking
- computational linguistics
- cutoff
- exhaustive parsing
- governor algorithm
- induction
- inside-outside algorithm
- language engineering
- lexicalization
- parser
- parsers
- parsing
- probability function
- question answering
- question answering system
- ranking
- reading
- reading comprehension
- right-branching
- statistical parsing
- syntactic analysis
- tabular parsing
- tagging
- weighting
Other assigned terms:
- ambiguity
- annotation
- array
- british national corpus
- case
- chunks
- comprehension
- context free grammar
- context free grammars
- corpora
- fact
- feature
- finite verb
- forest
- formalism
- governor
- grammar
- grammar notation
- grammar rule
- grammar rules
- grammars
- grammatical relation
- grammatical relations
- hypothesis
- implementation
- induction hypothesis
- interpretation
- labeling
- lemma
- lexical head
- lexical rule
- lexicalized model
- lexicon
- linguistics
- mapping
- maps
- markup
- methodology
- modifier
- nonterminal
- parse
- parse forest
- pcfg
- pcfgs
- phrase
- probabilistic grammar
- probabilities
- probability
- probability model
- procedure
- relation
- relation markup
- representations
- semantic
- semantic representation
- semantic representations
- sentence
- sentences
- symbol
- symbols
- syntactic ambiguity
- syntactic categories
- syntactic structure
- syntactic trees
- syntax
- terminals
- terms
- text
- tree
- tree structure
- trees
- vector space
- verb
- verb phrase
- vertex
- word
- words
