POLITECHNIKA GDANSKA
Technical University of Gdańsk
Incremental Construction of Finite-State Automata and Transducers, and their Use in the Natural Language Processing

Jan Daciuk

Rozprawa doktorska ETI
WYDZIAŁ ELEKTRONIKI,
TELEKOMUNIKACJI I INFORMATYKI

G. Narutowicza 11/12 80-952 Gdańsk, Poland

 
• Contents
• List of Figures
• List of Tables
• Introduction
  • Motivation
  • Related Work
  • Overview of the Dissertation
  • Acknowledgements
• Basic Definitions
  • Finite State Automata
  • Finite State Transducers
• Data for Applications
  • Spelling and Restoration of Diacritics
  • Morphological Lexicon
    • With Transducers
    • With Automata - Acceptors
  • Morphological Analysis of Unknown Words
  • Perfect Hashing
• Construction Algorithms
  • Taxonomy
  • Incremental Construction
    • From Sorted Data
    • From Data in Arbitrary Order
  • Algorithm by Dominique Revuz
  • Representation
  • Discussion
• Construction of Guessing Automata
  • Motivation
  • Method Description
    • Lexicon Reduction
    • Default Annotations
    • More Generalization
  • Experimental Results
  • Related Work
  • Concluding Remarks
• Usage
  • Spelling Correction
  • Restoration of Diacritics
  • Morphology
    • Using Transducers
    • Using Automata - Acceptors
    • Unknown Words
  • Perfect Hashing
• Summary
• FSA Package
  • fsa95build
  • fsa95accent
  • fsa95guess
  • fsa95hash
  • fsa95morph
  • fsa95prefix
  • fsa95spell
• UTR Package
  • tr95ubuild
  • tr95accent
  • tr95morph
  • tr95prefix
  • tr95spell
• References
• Index
• About this document ...