Finite-state registered automata and their uses in natural languages

Yael Cohen-Sygal, Shuly Wintner

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We extend finite-state registered automata (FSRA) to account for medium-distance dependencies in natural languages. We provide an extended regular expression language whose expressions denote arbitrary FSRAs and use it to describe some morphological and phonological phenomena. We also define several dedicated operators which support an easy and efficient implementation of some non-trivial morphological phenomena. In addition, we extend FSRA to finite-state registered transducers and demonstrate their space efficiency.

Original languageEnglish
Title of host publicationFinite-State Methods and Natural Language Processing - 5th InternationalWorkshop, FSMNLP 2005, Revised Papers
EditorsAnssi Yli-Jyra, Lauri Karttunen, Juhani Karhumaki
PublisherSpringer Verlag
Pages43-54
Number of pages12
ISBN (Print)9783540354673
DOIs
StatePublished - 2006
Event5th International Workshop of Finite-State Methods and Natural Language Processing, FSMNLP 2005 - Helsinki, Finland
Duration: 1 Sep 20052 Sep 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4002 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Workshop of Finite-State Methods and Natural Language Processing, FSMNLP 2005
Country/TerritoryFinland
CityHelsinki
Period1/09/052/09/05

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2006.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Finite-state registered automata and their uses in natural languages'. Together they form a unique fingerprint.

Cite this