ACL RD-TEC 1.0 Summarization of E99-1017
Paper Title:
TRANSDUCERS FROM REWRITE RULES WITH BACKREFERENCES
TRANSDUCERS FROM REWRITE RULES WITH BACKREFERENCES
Authors: Dale Gerdemann and Gertjan van Noord
Primarily assigned technology terms:
- algorithm
- automaton
- bracketing
- computational linguistics
- emacs
- filter transducer
- finite state
- finite state parsing
- finite state transducers
- finite-state parsing
- finite-state transducers
- language processing
- left-to-right processing
- longest matching
- matching
- morphology
- natural language processing
- nlp
- parsing
- processing
- prolog
- recognizer
- regular expression
- regular expression matching
- repair
- speech processing
- spelling
- spelling correction
- text processing
- top-down filtering
- transducer
- transducers
- transduction
Other assigned terms:
- alphabet
- approach
- automata
- bottom-up approach
- case
- complementation
- composition
- disjunction
- empty string
- fact
- feature
- finite automaton
- fsa utilities
- function words
- implementation
- input string
- interpretation
- lambda
- linguistics
- logic
- names
- natural language
- negation
- quantifier
- regular expressions
- reordering
- rewrite rules
- suffix
- symbol
- symbols
- syntax
- technique
- terms
- text
- universal language
- user
- vowel
- word
- words
