| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| therealbennoooo (0) - 1 freq thereaboot (6) - 5 freq thereaboots (6) - 15 freq thereabouts (7) - 1 freq whereaboots (7) - 4 freq heeeeeeeooooo (7) - 1 freq theraboots (7) - 1 freq thareaboots (7) - 1 freq hereaboot (7) - 1 freq therealtimcore (7) - 1 freq hereaboots (7) - 31 freq hereabout (8) - 1 freq hereablo (8) - 1 freq threatens (8) - 3 freq here-aboots (8) - 2 freq threatenin (8) - 20 freq threaten (8) - 10 freq therealmac (8) - 1 freq hereanent (8) - 1 freq threepenny (8) - 1 freq whereabout (8) - 1 freq threatened (8) - 17 freq thereiversroad (8) - 2 freq threatening (8) - 2 freq threatent (8) - 3 freq |
therealbennoooo (0) - 1 freq thereaboots (9) - 15 freq thereaboot (9) - 5 freq threepenny (10) - 1 freq threatenin (10) - 20 freq thareaboots (10) - 1 freq therealrayquinn (10) - 1 freq theraboots (10) - 1 freq thereabouts (10) - 1 freq threatent (11) - 3 freq thriepenny (11) - 1 freq threatenit (11) - 1 freq threatening (11) - 2 freq thruppenny (11) - 1 freq threatnin (11) - 1 freq thrupenny (11) - 1 freq thripenny (11) - 1 freq threitenin (11) - 4 freq theringroon (11) - 1 freq threatened (11) - 17 freq whereaboots (11) - 4 freq hereaboots (11) - 31 freq therealtimcore (11) - 1 freq hereaboot (11) - 1 freq threatens (11) - 3 freq |
SoundEx code - T641 trollope - 2 freq trollops - 1 freq tirl-aff - 1 freq trollop - 1 freq trilby - 7 freq trailaboot - 1 freq treelip - 2 freq treelips - 2 freq trollopy - 1 freq treelipin - 2 freq trowlybuses - 1 freq therealbennoooo - 1 freq true-life - 1 freq |
MetaPhone code - 0RLBN therealbennoooo - 1 freq |
THEREALBENNOOOO |
| Time to execute Levenshtein function - 0.268752 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.465345 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.028577 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.040264 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.000916 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. |