PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Epsilon-Removal by Loop Reduction for Finite-state Automata over Complete Semirings
Thomas Hanneforth and Colin de la Higuera
In: FSMNLP 2009, 18-21 Jul 2009, Pretoria, South Africa.

Abstract

We propose an incremental "-removal algorithm for weighted finite-state automata. The key idea is that "-cycles are stepwise reduced to "-loops with same source and target state. The weight of these loops can be computed with a closure-operation which requires a complete semiring. Contrary to other approaches, this makes it unnecessary to approximate the contribution of "-cycles to the weight of a path in certain (non k-closed) semirings.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Talk)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Natural Language Processing
Theory & Algorithms
ID Code:6680
Deposited By:Colin de la Higuera
Deposited On:08 March 2010