• Publications
  • Influence
Computation of Normalized Edit Distance and Applications
  • A. Marzal, E. Vidal
  • Computer Science
  • IEEE Trans. Pattern Anal. Mach. Intell.
  • 1 September 1993
TLDR
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
  • 324
  • 30
  • PDF
Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison
TLDR
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
  • 225
  • 17
A Lazy Version of Eppstein's K Shortest Paths Algorithm
TLDR
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
  • 61
  • 7
Fast Computation of Normalized Edit Distances
TLDR
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
  • 64
  • 4
  • PDF
The UJIpenchars Database: a Pen-Based Database of Isolated Handwritten Characters
TLDR
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
  • 43
  • 2
  • PDF
Speeding up the computation of the edit distance for cyclic strings
TLDR
A new algorithm to compute the edit distance between cyclic strings is presented that is faster than Maes' and Gregor and Thomason's algorithms. Expand
  • 34
  • 2
Computation of the N Best Parse Trees for Weighted and Stochastic Context-Free Grammars
TLDR
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
  • 39
  • 2
  • PDF
Car License Plates Extraction and Recognition Based on Connected Components Analysis and HMM Decoding
TLDR
A system for finding and recognizing car license plates by means of Hidden Markov Models is presented. Expand
  • 60
  • 1
Automatic speech recognition to teleoperate a robot via Web
TLDR
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
  • 20
  • 1