Jump to content

Levenshtein algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Falcon8765 (talk | contribs) at 20:27, 21 April 2010 (Tagging page for speedy deletion, redirect to nonexistent page (HG)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This redirect may meet Wikipedia's criteria for speedy deletion as a redirect to a page which has never existed or has been deleted. Some redirects can plausibly be retargeted elsewhere. Redirects that were broken as a result of their target being moved should not be speedily deleted, but should instead be retargeted to the page's new name, unless the fixed redirect would be eligible for speedy deletion under CSD R2. See CSD G8.

If this redirect does not meet the criteria for speedy deletion, please remove this notice.

Administrators: check links, talk, history (last), and logs before deletion.
This page was last edited by Falcon8765 (contribs | logs) at 20:27, 21 April 2010 (UTC) (15 years ago)

REDIRECT Wikipedia:Levenshtein distance

Retrieved from "https://en.wikipedia.org/w/index.php?title=Levenshtein_algorithm&oldid=357473674"

Hidden categories: