Compact representations by finite-state transducers

Research output: Contribution to journalConference articlepeer-review


Finite-state transducers give efficient representations of many Natural Language phenomena. They allow to account for complex lexicon restrictions 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 corresponding minimization, and point out interesting linguistic side-effects of this operation.

Original languageEnglish (US)
Pages (from-to)204-209
Number of pages6
JournalProceedings of the Annual Meeting of the Association for Computational Linguistics
StatePublished - 1994
Event32nd Annual Meeting of the Association for Computational Linguistics, ACL 1994 - Las Cruces, United States
Duration: Jun 27 1994Jun 30 1994

ASJC Scopus subject areas

  • Computer Science Applications
  • Linguistics and Language
  • Language and Linguistics


Dive into the research topics of 'Compact representations by finite-state transducers'. Together they form a unique fingerprint.

Cite this