Next: About this document
Up: POLITECHNIKA GDANSKA Technical
Previous: References
- acyclic automaton
- Finite State Automata
- alphabet
- Finite State Automata | Finite State Automata | Finite State Automata | Finite State Automata | Finite State Transducers | Data for Applications | Discussion
- annotation separator
- With Automata - Acceptors | With Automata - Acceptors | With Automata - Acceptors | Morphological Analysis of Unknown | Morphological Analysis of Unknown | Morphological Analysis of Unknown | Default Annotations | Default Annotations | More Generalization | Spelling Correction | Using Automata - Acceptors
- annotation"separator
- With Automata - Acceptors
- automaton
- Finite State Automata | Finite State Automata
- acyclic
- Finite State Automata
- deterministic
- Finite State Automata
- deterministic acyclic
- Finite State Automata
- with final"transitions
- Finite State Automata
- language
- Finite State Automata | Finite State Automata | Finite State Automata
- minimal
- Finite State Automata
- minimality
- Finite State Automata
- start-useful
- Finite State Automata
- useful
- Finite State Automata | Finite State Automata | Finite State Automata
- with final transitions
- Finite State Automata
- binary automaton
- Representation
- binary"state
- Representation
- cloning
- From Data in Arbitrary
- common prefix
- From Sorted Data
- confluence state
- From Data in Arbitrary | From Data in Arbitrary
- coverage
- Unknown Words
- cut-off edit distance
- Spelling Correction | Spelling Correction | Spelling Correction
- DAFSA-FT
- Finite State Automata | Discussion
- default state
- Default Annotations
- deterministic acyclic automaton
- Finite State Automata
- deterministic acyclic FSA with final"transitions
- Finite State Automata | Discussion
- deterministic automaton
- Finite State Automata
- digram
- Spelling Correction
- edit distance
- Spelling Correction | Spelling Correction | Spelling Correction | Spelling Correction | Spelling Correction | Spelling Correction | Spelling Correction | Spelling Correction | Spelling Correction | Spelling Correction | Summary | DESCRIPTION | OPTIONS | OPTIONS | OPTIONS
- emission function
- Finite State Transducers
- failure" transition
- Representation
- first annotated state
- More Generalization
- FSA-FT
- Finite State Automata
- hashing
- Related Work | Perfect Hashing to Perfect Hashing | Perfect Hashing to Perfect Hashing | OPTIONS | fsa95hash
- infix code
- With Automata - Acceptors | Morphological Analysis of Unknown
- language of an automaton
- Finite State Automata | Finite State Automata | Finite State Automata
- longest common suffix
- Algorithm by Dominique Revuz
- minimal automaton
- Related Work | Finite State Automata | Finite State Automata | Incremental Construction | Incremental Construction | Incremental Construction | Incremental Construction | From Sorted Data | From Sorted Data | Lexicon Reduction | Usage | Summary
- minimality
- Finite State Automata | Finite State Automata | Finite State Automata | From Sorted Data
- minimization
- Related Work | Incremental Construction | Incremental Construction | Incremental Construction | From Sorted Data | From Data in Arbitrary | From Data in Arbitrary | Discussion | Summary
- morphological
- annotation
- Morphological Lexicon | With Automata - Acceptors
- category
- With Automata - Acceptors | Morphological Analysis of Unknown | Morphological Analysis of Unknown | Spelling Correction | Morphology | Using Automata - Acceptors
- lexicon
- Morphological Lexicon to With Automata - Acceptors | Discussion | Restoration of Diacritics | Summary | Summary
- morphology
- Motivation | Related Work
- analysis
- Related Work | Spelling Correction | Morphology to Unknown Words | fsa95guess | fsa95morph | tr95morph
- guessing
- Morphological Analysis of Unknown to Morphological Analysis of Unknown | Motivation | fsa95guess
- moving markers
- Finite State Automata | Finite State Automata
- neighborhood matrix
- Representation
- omission key
- Spelling Correction
- perfect hashing
- Related Work | Perfect Hashing to Perfect Hashing | Perfect Hashing to Perfect Hashing | OPTIONS | fsa95hash
- precision
- Unknown Words
- prefix
- With Automata - Acceptors
- prefix code
- With Automata - Acceptors
- proper state
- Representation
- pseudo-minimization
- Related Work | Discussion | Summary
- rational function
- Finite State Transducers
- rational transduction
- Finite State Transducers
- reachable state
- Finite State Automata
- recall
- Unknown Words
- restoration of diacritics
- Spelling and Restoration of | Restoration of Diacritics to Restoration of Diacritics
- right language
- Finite State Automata | Finite State Automata | Finite State Automata | Incremental Construction | Incremental Construction | From Sorted Data | From Data in Arbitrary
- right"language
- Finite State Automata
- sequential transducer
- Finite State Transducers
- skeleton key
- Spelling Correction
- spelling correction
- Related Work | Spelling and Restoration of | Spelling Correction to Spelling Correction | fsa95spell | tr95spell
- start-useful automaton
- Finite State Automata
- state
- Finite State Automata
- binary
- Representation
- cloning
- From Data in Arbitrary
- confluence
- From Data in Arbitrary | From Data in Arbitrary
- default
- Default Annotations
- first annotated
- More Generalization
- proper
- Representation
- reachable
- Finite State Automata
- right language
- Finite State Automata | Finite State Automata | Finite State Automata | Finite State Automata | Incremental Construction | Incremental Construction | From Sorted Data | From Data in Arbitrary
- statistical techniques
- in restoration of diacritics
- Restoration of Diacritics
- in spelling correction
- Spelling Correction
- subsequential transducer
- Finite State Transducers
- transducer
- Finite State Transducers to Finite State Transducers
- construction
- Discussion
- finding words with similar pronunciation
- Spelling Correction
- in morphological analysis
- Using Transducers
- morphological data
- With Transducers
- sequential
- Finite State Transducers
- software package
- UTR Package to BUGS
- subsequential
- Finite State Transducers
- weighted
- Spelling Correction
- transition
- Finite State Automata
- failure
- Representation
- function
- Finite State Transducers
- trigram
- Spelling Correction
- useful automaton
- Finite State Automata | Finite State Automata | Finite State Automata
- Zipf's law
- Motivation
Jan Daciuk
Wed Jun 3 14:37:17 CEST 1998
Software at http://www.pg.gda.pl/~jandac/fsa.html