Levenshtein automaton
id:
levenshtein-automaton-254-10206930
title:
Levenshtein automaton
text:
In computer science, a Levenshtein automaton for a string w and a number n is a finite-state automaton that can recognize the set of all strings whose Levenshtein distance from w is at most n. That is, a string x is in the formal language recognized by the Levenshtein automaton if and only if x can be transformed into w by at most n single-character insertions, deletions, and substitutions.
brand slug:
wiki
category slug:
encyclopedia
description:
Mathematical model for string comparison
original url:
https://en.wikipedia.org/wiki/Levenshtein_automaton
date created:
date modified:
2023-09-27T14:16:06Z
main entity:
{"identifier":"Q6535190","url":"https://www.wikidata.org/entity/Q6535190"}
image:
fields total:
13
integrity:
14