ACL RD-TEC 1.0 Summarization of P96-1034
Paper Title:
EFFICIENT TRANSFORMATION-BASED PARSING
EFFICIENT TRANSFORMATION-BASED PARSING
Authors: Girogion Satta and Eric Brill
Primarily assigned technology terms:
- algorithm
- automaton
- deterministic finite state automata
- fast parsing
- final state
- finite state
- finite state automata
- induction
- language and speech processing
- matching
- matching algorithm
- parser
- parsing
- parsing algorithm
- pattern matching
- preprocessing
- processing
- reading
- recognition
- rule representation
- speech processing
- terminology
- top-down matching
- transformation-based parsing
- translation algorithm
- variable substitution
Other assigned terms:
- alphabet
- array
- automata
- case
- computational complexity
- data structure
- data structures
- device
- fact
- finite alphabet
- finite set
- finite state device
- formalism
- formalisms
- grammars
- index
- input string
- leaf
- lemma
- linear space
- linear time
- mapping
- method
- natural language
- parse
- parse structure
- parse tree
- procedure
- process
- recursion
- relation
- root node
- rule sequence
- rule set
- running time
- sentence
- standard terminology
- subtree
- subtrees
- suffix
- suffixes
- symbol
- symbols
- technique
- terms
- theorem
- time complexity
- topics
- transformation
- transformation-based tree
- translation problem
- tree
- tree automata
- tree automaton
- trees
