Computing the Expected Edit Distance from a String to a PFA

DOI10.1007/978-3-319-40946-7_4zbMath1379.68219OpenAlexW2491045106MaRDI QIDQ2830206

Jorge Calvo-Zaragoza, Jose Oncina, Colin de la Higuera

Publication date: 9 November 2016

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10045/56997

zbMATH Keywords

edit distanceprobabilistic finite state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton

Cites Work

• Fast string correction with Levenshtein automata
• Topology of strings: median string is NP-complete
• Fast Approximate Search in Large Dictionaries
• A theory of the learnable
• Biological Sequence Analysis
• Order- n correction for regular languages
• Median strings for k-nearest neighbour classification
• Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton
• The most probable string: an algorithmic study
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the Expected Edit Distance from a String to a PFA