Levenshtein distance
id:
levenshtein-distance-162-18452092
title:
Levenshtein distance
text:
In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. The Levenshtein distance between two words is the minimum number of single-character edits required to change one word into the other. It is named after Soviet mathematician Vladimir Levenshtein, who defined the metric in 1965. Levenshtein distance may also be referred to as edit distance, although that term may also denote a larger family of d
brand slug:
wiki
category slug:
encyclopedia
description:
Computer science metric for string similarity
original url:
https://en.wikipedia.org/wiki/Levenshtein_distance
date created:
2003-12-18T04:33:02Z
date modified:
2024-08-28T15:04:36Z
main entity:
{"identifier":"Q496939","url":"https://www.wikidata.org/entity/Q496939"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/d1/Levenshtein_distance_animation.gif","width":1319,"height":860}
fields total:
13
integrity:
16