On the equivalence of weighted finite-state transducers

Authors:
Julien Quint
Affiliations:
National Institute of Informatics, Chiyoda-ku, Tokyo, Japan
Venue:
ACLdemo '04 Proceedings of the ACL 2004 on Interactive poster and demonstration sessions
Year:
2004

Citing 5
Cited 0

Rational series and their languages

Rational series and their languages
On the Determinization of Weighted Finite Automata

SIAM Journal on Computing
A Rational Design for a Weighted Finite-State Transducer Library

WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
An efficient incremental DFA minimization algorithm

Natural Language Engineering
Two parsing algorithms by means of finite state transducers

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although they can be topologically different, two distinct transducers may actually recognize the same rational relation. Being able to test the equivalence of transducers allows to implement such operations as incremental minimization and iterative composition. This paper presents an algorithm for testing the equivalence of deterministic weighted finite-state transducers, and outlines an implementation of its applications in a prototype weighted finite-state calculus tool.