Generic -removal and input -normalization algorithms for weighted transducers

Research output: Contribution to journalArticle

Abstract

We present a new generic -removal algorithm for weighted automata and transducers defined over a semiring. The algorithm can be used with any semiring covered by our framework and works with any queue discipline adopted. It can be used in particular in the case of unweighted automata and transducers and weighted automata and transducers defined over the tropical semiring. It is based on a general shortest-distance algorithm that we briefly describe. We give a full description of the algorithm including its pseudocode and its running time complexity, discuss the more efficient case of acyclic automata, an on-the-fly implementation of the algorithm and an approximation algorithm in the case of the semirings not covered by our framework. We illustrate the use of the algorithm with several semirings. We also describe an input -normalization algorithm for weighted transducers based on the general shortest-distance algorithm. The algorithm, which works with all semirings covered by our framework, admits an on-the-fly implementation.

Original languageEnglish (US)
Pages (from-to)129-143
Number of pages15
JournalInternational Journal of Foundations of Computer Science
Volume13
Issue number1
DOIs
StatePublished - 2002

Fingerprint

Transducers
Approximation algorithms

Keywords

  • -removal
  • finite automata
  • finite-state transducers
  • rational power series
  • semirings
  • shortest-paths algorithms

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

@article{2ce146d2014949559cffe6b8a9d8ad7b,
title = "Generic -removal and input -normalization algorithms for weighted transducers",
abstract = "We present a new generic -removal algorithm for weighted automata and transducers defined over a semiring. The algorithm can be used with any semiring covered by our framework and works with any queue discipline adopted. It can be used in particular in the case of unweighted automata and transducers and weighted automata and transducers defined over the tropical semiring. It is based on a general shortest-distance algorithm that we briefly describe. We give a full description of the algorithm including its pseudocode and its running time complexity, discuss the more efficient case of acyclic automata, an on-the-fly implementation of the algorithm and an approximation algorithm in the case of the semirings not covered by our framework. We illustrate the use of the algorithm with several semirings. We also describe an input -normalization algorithm for weighted transducers based on the general shortest-distance algorithm. The algorithm, which works with all semirings covered by our framework, admits an on-the-fly implementation.",
keywords = "-removal, finite automata, finite-state transducers, rational power series, semirings, shortest-paths algorithms",
author = "Mehryar Mohri",
year = "2002",
doi = "10.1142/S0129054102000996",
language = "English (US)",
volume = "13",
pages = "129--143",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "1",

}

TY - JOUR

T1 - Generic -removal and input -normalization algorithms for weighted transducers

AU - Mohri, Mehryar

PY - 2002

Y1 - 2002

N2 - We present a new generic -removal algorithm for weighted automata and transducers defined over a semiring. The algorithm can be used with any semiring covered by our framework and works with any queue discipline adopted. It can be used in particular in the case of unweighted automata and transducers and weighted automata and transducers defined over the tropical semiring. It is based on a general shortest-distance algorithm that we briefly describe. We give a full description of the algorithm including its pseudocode and its running time complexity, discuss the more efficient case of acyclic automata, an on-the-fly implementation of the algorithm and an approximation algorithm in the case of the semirings not covered by our framework. We illustrate the use of the algorithm with several semirings. We also describe an input -normalization algorithm for weighted transducers based on the general shortest-distance algorithm. The algorithm, which works with all semirings covered by our framework, admits an on-the-fly implementation.

AB - We present a new generic -removal algorithm for weighted automata and transducers defined over a semiring. The algorithm can be used with any semiring covered by our framework and works with any queue discipline adopted. It can be used in particular in the case of unweighted automata and transducers and weighted automata and transducers defined over the tropical semiring. It is based on a general shortest-distance algorithm that we briefly describe. We give a full description of the algorithm including its pseudocode and its running time complexity, discuss the more efficient case of acyclic automata, an on-the-fly implementation of the algorithm and an approximation algorithm in the case of the semirings not covered by our framework. We illustrate the use of the algorithm with several semirings. We also describe an input -normalization algorithm for weighted transducers based on the general shortest-distance algorithm. The algorithm, which works with all semirings covered by our framework, admits an on-the-fly implementation.

KW - -removal

KW - finite automata

KW - finite-state transducers

KW - rational power series

KW - semirings

KW - shortest-paths algorithms

UR - http://www.scopus.com/inward/record.url?scp=84892889057&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84892889057&partnerID=8YFLogxK

U2 - 10.1142/S0129054102000996

DO - 10.1142/S0129054102000996

M3 - Article

VL - 13

SP - 129

EP - 143

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 1

ER -