On the disambiguation of weighted automata

Mehryar Mohri, Michael D. Riley

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present a disambiguation algorithm for weighted automata. The algorithm admits two main stages: a pre-disambiguation stage followed by a transition removal stage. We give a detailed description of the algorithm and the proof of its correctness. The algorithm is not applicable to all weighted automata but we prove sufficient conditions for its applicability in the case of the tropical semiring by introducing the weak twins property. In particular, the algorithm can be used with all acyclic weighted automata and more generally any determinizable weighted automata. While disambiguation can sometimes be achieved using determinization, our disambiguation algorithm in some cases can return a result that is exponentially smaller than any equivalent deterministic automaton. We also present some empirical evidence of the space benefits of disambiguation over determinization in speech recognition and machine translation applications.

Original languageEnglish (US)
Title of host publicationImplementation and Application of Automata - 20th International Conference, CIAA 2015, Proceedings
PublisherSpringer Verlag
Pages263-278
Number of pages16
Volume9223
ISBN (Print)9783319223599
DOIs
StatePublished - 2015
Event20th International Conference on Implementation and Application of Automata, CIAA 2015 - Umea, Sweden
Duration: Aug 18 2015Aug 21 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9223
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other20th International Conference on Implementation and Application of Automata, CIAA 2015
CountrySweden
CityUmea
Period8/18/158/21/15

Fingerprint

Weighted Automata
Proof of correctness
Machine Translation
Semiring
Speech Recognition
Speech recognition
Automata
Sufficient Conditions

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Mohri, M., & Riley, M. D. (2015). On the disambiguation of weighted automata. In Implementation and Application of Automata - 20th International Conference, CIAA 2015, Proceedings (Vol. 9223, pp. 263-278). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9223). Springer Verlag. https://doi.org/10.1007/978-3-319-22360-5_22

On the disambiguation of weighted automata. / Mohri, Mehryar; Riley, Michael D.

Implementation and Application of Automata - 20th International Conference, CIAA 2015, Proceedings. Vol. 9223 Springer Verlag, 2015. p. 263-278 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9223).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mohri, M & Riley, MD 2015, On the disambiguation of weighted automata. in Implementation and Application of Automata - 20th International Conference, CIAA 2015, Proceedings. vol. 9223, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9223, Springer Verlag, pp. 263-278, 20th International Conference on Implementation and Application of Automata, CIAA 2015, Umea, Sweden, 8/18/15. https://doi.org/10.1007/978-3-319-22360-5_22
Mohri M, Riley MD. On the disambiguation of weighted automata. In Implementation and Application of Automata - 20th International Conference, CIAA 2015, Proceedings. Vol. 9223. Springer Verlag. 2015. p. 263-278. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-22360-5_22
Mohri, Mehryar ; Riley, Michael D. / On the disambiguation of weighted automata. Implementation and Application of Automata - 20th International Conference, CIAA 2015, Proceedings. Vol. 9223 Springer Verlag, 2015. pp. 263-278 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{8df1db1f11dc41e495e5535330517d25,
title = "On the disambiguation of weighted automata",
abstract = "We present a disambiguation algorithm for weighted automata. The algorithm admits two main stages: a pre-disambiguation stage followed by a transition removal stage. We give a detailed description of the algorithm and the proof of its correctness. The algorithm is not applicable to all weighted automata but we prove sufficient conditions for its applicability in the case of the tropical semiring by introducing the weak twins property. In particular, the algorithm can be used with all acyclic weighted automata and more generally any determinizable weighted automata. While disambiguation can sometimes be achieved using determinization, our disambiguation algorithm in some cases can return a result that is exponentially smaller than any equivalent deterministic automaton. We also present some empirical evidence of the space benefits of disambiguation over determinization in speech recognition and machine translation applications.",
author = "Mehryar Mohri and Riley, {Michael D.}",
year = "2015",
doi = "10.1007/978-3-319-22360-5_22",
language = "English (US)",
isbn = "9783319223599",
volume = "9223",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "263--278",
booktitle = "Implementation and Application of Automata - 20th International Conference, CIAA 2015, Proceedings",

}

TY - GEN

T1 - On the disambiguation of weighted automata

AU - Mohri, Mehryar

AU - Riley, Michael D.

PY - 2015

Y1 - 2015

N2 - We present a disambiguation algorithm for weighted automata. The algorithm admits two main stages: a pre-disambiguation stage followed by a transition removal stage. We give a detailed description of the algorithm and the proof of its correctness. The algorithm is not applicable to all weighted automata but we prove sufficient conditions for its applicability in the case of the tropical semiring by introducing the weak twins property. In particular, the algorithm can be used with all acyclic weighted automata and more generally any determinizable weighted automata. While disambiguation can sometimes be achieved using determinization, our disambiguation algorithm in some cases can return a result that is exponentially smaller than any equivalent deterministic automaton. We also present some empirical evidence of the space benefits of disambiguation over determinization in speech recognition and machine translation applications.

AB - We present a disambiguation algorithm for weighted automata. The algorithm admits two main stages: a pre-disambiguation stage followed by a transition removal stage. We give a detailed description of the algorithm and the proof of its correctness. The algorithm is not applicable to all weighted automata but we prove sufficient conditions for its applicability in the case of the tropical semiring by introducing the weak twins property. In particular, the algorithm can be used with all acyclic weighted automata and more generally any determinizable weighted automata. While disambiguation can sometimes be achieved using determinization, our disambiguation algorithm in some cases can return a result that is exponentially smaller than any equivalent deterministic automaton. We also present some empirical evidence of the space benefits of disambiguation over determinization in speech recognition and machine translation applications.

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

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

U2 - 10.1007/978-3-319-22360-5_22

DO - 10.1007/978-3-319-22360-5_22

M3 - Conference contribution

SN - 9783319223599

VL - 9223

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 263

EP - 278

BT - Implementation and Application of Automata - 20th International Conference, CIAA 2015, Proceedings

PB - Springer Verlag

ER -