ACL RD-TEC 1.0 Summarization of W94-0204
Paper Title:
DEFAULT FINITE STATE MACHINES AND FINITE STATE PHONOLOGY
DEFAULT FINITE STATE MACHINES AND FINITE STATE PHONOLOGY
Authors: Gerald Penn and Richmond Thomason
Primarily assigned technology terms:
- algorithm
- automaton
- compiler
- complexity analysis
- encoding
- final state
- finite state
- finite state automata
- finite state machines
- finite-state transducer
- finite-state transducers
- illustration
- indexing
- listing
- prioritization
- processing
- reasoning
- recognition
- regular expression
- rule compiler
- software engineering
- spelling
- terminology
- tile
- transducer
- transducers
- word processing
- word-processing
Other assigned terms:
- alphabet
- approach
- automata
- bias
- case
- community
- computational complexity
- computational model
- conjunct
- context-sensitive grammar
- declarative rule
- derivation
- derivations
- empty string
- fact
- feature
- finite alphabet
- finite set
- formalism
- formalisms
- generation
- generative phonology
- grammar
- grammars
- hypotheses
- implementation
- input string
- interpretation
- language membership
- lemma
- linguistic
- linguistic adequacy
- linguistic description
- linguists
- logic
- meaning
- method
- morpheme
- morpheme boundary
- nonterminal
- phonological rule
- phonological rules
- phrase
- polynomial time
- process
- programming approach
- projection
- regular expressions
- relation
- rewrite rules
- rule formalism
- rule notation
- run-time
- stem
- substring
- suffix
- suffixes
- surface form
- symbol
- symbols
- technique
- technology
- terminals
- theorem
- theories
- translations
- vowel
- vowel harmony
- word
- word boundary
