We show that the normalized edit distance can be computed by first obtaining the conventional (unnormalized) edit distance between X and Y and then normalizing this value by the length of the corresponding editing path.Expand

A new algorithm to compute the K shortest paths (in order of increasing length) between a given pair of nodes in a digraph with n nodes and m arcs is presented.Expand

We consider the problem ofen umerating, in order ofin - creasing length, the K shortest paths between a given pair of nodes in a weighted digraph G with n nodes and m arcs.Expand

The normalized edit distance (NED) between two strings X and Y is defined as the minimum quotient between the sum of weights of the edit operations required to transform X into Y and the length of the editing path corresponding to these operations.Expand

This paper describes the current state of our own database, UJIpenchars, whose first version contains online representations of 1 364 isolated handwritten characters produced by 11 writers and is freely available at the UCI Machine Learning Repository.Expand

We propose an efficient algorithm to solve one of the problems associated to the use of weighted and stochastic Context-Free Grammars: the problem of computing the N best parse trees of a given string.Expand

This article shows the way a speech recognition module has been implemented that provides the translation between voice input and the convenient text based commands to be executed on an already existing web robot.Expand