E
Enrique Vidal
Researcher at Polytechnic University of Valencia
Publications - 313
Citations - 8370
Enrique Vidal is an academic researcher from Polytechnic University of Valencia. The author has contributed to research in topics: Language model & Handwriting recognition. The author has an hindex of 43, co-authored 306 publications receiving 7664 citations. Previous affiliations of Enrique Vidal include James I University & University of Valencia.
Papers
More filters
Journal ArticleDOI
Computation of normalized edit distance and applications
Andrés Marzal,Enrique Vidal +1 more
TL;DR: Experiments in hand-written digit recognition are presented, revealing that the normalized edit distance consistently provides better results than both unnormalized or post-normalized classical edit distances.
Journal ArticleDOI
A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements
TL;DR: The results show that the new version of the AESA, referred to as ‘Linear AESA’ (LAESA), achieves a search performance similar to that of the ASIC, while definitely overcoming the quadratic costs bottleneck.
Journal ArticleDOI
Probabilistic finite-state machines - part II
TL;DR: The relation of probabilistic finite-state automata with other well-known devices that generate strings as hidden Markov models and n-grams is studied and theorems, algorithms, and properties that represent a current state of the art of these objects are provided.
Journal ArticleDOI
Statistical approaches to computer-assisted translation
Sergio Barrachina,Oliver Bender,Francisco Casacuberta,Jorge Civera,Elsa Cubel,Shahram Khadivi,Antonio Lagarda,Hermann Ney,Jesús Tomás,Enrique Vidal,Juan-Miguel Vilar +10 more
TL;DR: Alignment templates, phrase-based models, and stochastic finite-state transducers are used to develop computer-assisted translation systems in a European project in two real tasks.
Journal ArticleDOI
Optimum polygonal approximation of digitized curves
Juan-Carlos Perez,Enrique Vidal +1 more
TL;DR: An efficient algorithm is proposed to find M points, among those given, which define a polygonal curve that is a globally optimal approximation to the given points.