| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| voldemort (0) - 7 freq voldermort (1) - 1 freq €˜voldemort (2) - 1 freq voldermort' (2) - 1 freq roedemor (3) - 2 freq solder (4) - 2 freq dolders (4) - 1 freq polkemmet (4) - 2 freq commemorat (4) - 1 freq odanort (4) - 3 freq poudert (4) - 2 freq feliamort (4) - 1 freq soudert (4) - 1 freq guldert (4) - 13 freq fordert (4) - 4 freq teleport (4) - 1 freq wondert (4) - 10 freq foremost (4) - 1 freq toremore (4) - 1 freq ordert (4) - 12 freq golders (4) - 3 freq holders (4) - 3 freq golder (4) - 1 freq voller (4) - 2 freq oldest (4) - 3 freq |
voldemort (0) - 7 freq voldermort (2) - 1 freq voldermort' (4) - 1 freq €˜voldemort (4) - 1 freq feliamort (6) - 1 freq guldert (6) - 13 freq roedemor (6) - 2 freq vladimir (6) - 2 freq holder (7) - 2 freq dolder (7) - 1 freq yollert (7) - 2 freq powdert (7) - 2 freq older (7) - 27 freq solempt (7) - 1 freq bolder (7) - 2 freq gollert (7) - 7 freq moidert (7) - 1 freq laddert (7) - 1 freq damart (7) - 1 freq bulderit (7) - 1 freq fulmart (7) - 1 freq volunteert (7) - 1 freq walmart (7) - 1 freq folder (7) - 4 freq looderit (7) - 1 freq |
SoundEx code - V435 vladimir - 2 freq vaultin - 1 freq volition - 2 freq voldemort - 7 freq €˜voldemort - 1 freq vulltums - 5 freq |
MetaPhone code - FLTMRT voldemort - 7 freq €˜voldemort - 1 freq |
VOLDEMORT |
| Time to execute Levenshtein function - 0.223083 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.361445 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.027698 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.041230 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.000907 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. |