ACL RD-TEC 1.0 Summarization of N06-1045
Paper Title:
A BETTER N-BEST LIST: PRACTICAL DETERMINIZATION OF WEIGHTED FINITE TREE AUTOMATA
A BETTER N-BEST LIST: PRACTICAL DETERMINIZATION OF WEIGHTED FINITE TREE AUTOMATA
Authors: Jonathan May and Kevin Knight
Primarily assigned technology terms:
- algorithm
- approximation
- automaton
- beam search
- cky algorithm
- data-oriented parsing
- decoder
- finite-state tree automata
- machine translation
- machine translation system
- nlp
- parser
- parsing
- quantitative analysis
- ranking
- reading
- recognition
- recognizer
- search
- statistical nlp
- subsequential transducer
- transducer
- transducers
- translation system
- tree transducer
- tuning
- visualization
- weighted automata
- weighted determinization
- weighting
Other assigned terms:
- alphabet
- automata
- beam
- bleu
- bleu scores
- case
- community
- composition
- concept
- data consortium
- debugging
- derivation
- derivations
- english parse
- estimation
- f-measure
- finite set
- forest
- formalisms
- generation
- grammars
- interpretation
- linguistic
- linguistic data
- linguistic data consortium
- mapping
- measure
- method
- methodology
- nlp applications
- parse
- parse forest
- parsing model
- penn treebank
- precision
- reordering
- representations
- sentences
- subtrees
- symbol
- symbols
- system performance
- technique
- test corpus
- training
- translations
- tree
- tree automata
- treebank
- trees
- words
