| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unlatch (0) - 1 freq clatch (2) - 3 freq sclatch (2) - 1 freq natch (2) - 2 freq latch (2) - 11 freq nwatch (2) - 1 freq platch (2) - 3 freq snatch (2) - 14 freq splatch (2) - 7 freq aneath (3) - 106 freq unlaek (3) - 3 freq knitch (3) - 1 freq inlat (3) - 32 freq nuthatch (3) - 1 freq bycatch (3) - 1 freq wratch (3) - 1 freq patch (3) - 79 freq ablach (3) - 3 freq unlawfu (3) - 3 freq swaatch (3) - 4 freq inlats' (3) - 1 freq inlats (3) - 21 freq unlock (3) - 7 freq 'laach (3) - 1 freq waatch (3) - 67 freq |
unlatch (0) - 1 freq platch (3) - 3 freq latch (3) - 11 freq nwatch (3) - 1 freq natch (3) - 2 freq clatch (3) - 3 freq ultach (4) - 17 freq notch (4) - 6 freq fuilitch (4) - 1 freq blotch (4) - 6 freq latchy (4) - 4 freq clutch (4) - 11 freq splatch (4) - 7 freq sclatch (4) - 1 freq snatch (4) - 14 freq inlack (5) - 1 freq plootch (5) - 1 freq snitch (5) - 8 freq maatch (5) - 4 freq batch (5) - 13 freq lach (5) - 62 freq swatch (5) - 99 freq -watch (5) - 1 freq thatch (5) - 5 freq lauch (5) - 160 freq |
SoundEx code - U543 unload - 3 freq unloadin - 6 freq unhealthy - 9 freq unilateral - 1 freq unloadit - 1 freq unwieldy - 1 freq umlaut - 3 freq unloddan - 1 freq unyauld - 1 freq unlatch - 1 freq unloaded - 1 freq unladin - 1 freq unilaterally - 5 freq umlauts - 2 freq unliterally - 1 freq |
MetaPhone code - UNLX unleash - 2 freq unlatch - 1 freq |
UNLATCH |
| Time to execute Levenshtein function - 0.389545 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.531095 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.028652 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.040237 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001041 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |