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

DOI10.1142/S0129054117400093zbMath1380.68250OpenAlexW2771846077MaRDI QIDQ4605516

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

Publication date: 22 February 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054117400093

zbMATH Keywords

edit distanceprobabilistic finite state automatamedian string

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Computing the Expected Edit Distance from a String to a PFA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast string correction with Levenshtein automata
• Topology of strings: median string is NP-complete
• Computing the Expected Edit Distance from a String to a PFA
• 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
• The most probable string: an algorithmic study
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS

This page was built for publication: Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton