Linear-Space Computation of the Edit-Distance between a String and a Finite Automaton

Details Linear-Space Computation of the Edit-Distance between a String and a Finite Automaton Linear-Space Computation of the Edit-Distance between a String and a Finite Automaton

2009-04-29

arxiv.org/abs/0904.4686v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

The problem of computing the edit-distance between a string and a finite automaton arises in a variety of applications in computational biology, text processing, and speech recognition. This paper presents linear-space algorithms for computing the edit-distance between a string and an arbitrary weighted automaton over the tropical semiring, or an unambiguous weighted automaton over an arbitrary semiring. It also gives an efficient linear-space algorithm for finding an optimal alignment of a string and such a weighted automaton.

Affiliated with

Also associated with

No associations

Rating

Linear-Space Computation of the Edit-Distance between a String and a Finite Automaton does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear-Space Computation of the Edit-Distance between a String and a Finite Automaton, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear-Space Computation of the Edit-Distance between a String and a Finite Automaton will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-512890