Learning stochastic edit distance: application in handwritten character recognition

DOI10.1016/J.PATCOG.2006.03.011MaRDI QIDQ2498646zbMATH OpenOpenAlexFDO

Authors Jose Oncina, Marc Sebban

Publication date 16 August 2006

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2006.03.011

zbMATH Keywords

finite-state transducershandwritten character recognitionstochastic edit distance

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• A Discriminative Model of Stochastic Edit Distance in the Form of a Conditional Transducer
• Learning probabilistic models of tree edit distance
• Learning state machine-based string edit kernels
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
• Comparison of AESA and LAESA search algorithms using string and tree-edit-distances

Cites work

• Comparison of AESA and LAESA search algorithms using string and tree-edit-distances
• scientific article; zbMATH DE number 3567782 (Why is no real title available?)

Cited in

(6)

• On measuring similarity for sequences of itemsets
• Good edit similarity learning by loss minimization
• A Discriminative Model of Stochastic Edit Distance in the Form of a Conditional Transducer
• A sum-over-paths extension of edit distances accounting for all sequence alignments
• Learning probabilistic models of tree edit distance
• Learning state machine-based string edit kernels

This page was built for publication: Learning stochastic edit distance: application in handwritten character recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2498646)