On some applications of finite-state automata theory to natural language processing

Research output: Contribution to journalArticle

Abstract

We describe new applications of the theory of automata to natural language processing: the representation of very large scale dictionaries and the indexation of natural language texts. They are based on new algorithms that we introduce and describe in detail. In particular, we give pseudocodes for the determination of string to string transducers, the deterministic union of p-subsequential string to string transducers, and the indexation by automata. We report on several experiments illustrating the applications.

Original languageEnglish (US)
Pages (from-to)61-80
Number of pages20
JournalNatural Language Engineering
Volume2
Issue numberpt 1
DOIs
StatePublished - Mar 1996

ASJC Scopus subject areas

  • Software
  • Language and Linguistics
  • Linguistics and Language
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'On some applications of finite-state automata theory to natural language processing'. Together they form a unique fingerprint.

  • Cite this