Paper: Compact Representations By Finite-State Transducers

ACL ID P94-1028
Title Compact Representations By Finite-State Transducers
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1994
  • Mehryar Mohri (University of Marne la Vallee, Marne la Vallee France)

Finite-state transducers give efficient represen- tations of many Natural Language phenomena. They allow to account for complex lexicon restric- tions encountered, without involving the use of a large set of complex rules difficult to analyze. We here show that these representations can be made very compact, indicate how to perform the corre- sponding minimization, and point out interesting linguistic side-effects of this operation. 1. MOTIVATION Finite-state transducers constitute appropriate representations of Natural Language phenomena. Indeed, they have been shown to be sufficient tools to describe morphological and phonetic forms of a language (Kaxttunen et al. , 1992; Kay and Ka- plan, 1994). Transducers can then be viewed as functions which map lexical representations to the surface...