Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
helper (0) - 5 freq helpers (1) - 12 freq helter (1) - 3 freq helpen (1) - 1 freq helped (1) - 92 freq heller (1) - 3 freq halper (1) - 2 freq helpin (2) - 87 freq yelped (2) - 4 freq hender (2) - 1 freq seller (2) - 11 freq halter (2) - 5 freq heppen (2) - 11 freq header (2) - 2 freq peyper (2) - 1 freq healer (2) - 3 freq help (2) - 1140 freq cheaper (2) - 15 freq heeder (2) - 1 freq helps (2) - 56 freq reaper (2) - 20 freq elyer (2) - 1 freq heles (2) - 1 freq keiper (2) - 1 freq helle (2) - 6 freq |
helper (0) - 5 freq halper (1) - 2 freq helped (2) - 92 freq heller (2) - 3 freq helpen (2) - 1 freq helter (2) - 3 freq helpers (2) - 12 freq helpfu (3) - 21 freq holder (3) - 2 freq helpit (3) - 52 freq harper (3) - 3 freq hyper (3) - 4 freq holler (3) - 2 freq helps (3) - 56 freq helpt (3) - 9 freq helpan (3) - 1 freq halped (3) - 2 freq hamper (3) - 3 freq halter (3) - 5 freq help (3) - 1140 freq healer (3) - 3 freq hellery (3) - 3 freq leper (3) - 2 freq helpin (3) - 87 freq hetter (4) - 5 freq |
SoundEx code - H416 helper - 5 freq half-frozen - 1 freq hellfire - 4 freq half-hairted - 1 freq hell-fire - 1 freq helpers - 12 freq hallvard - 2 freq hellebore - 1 freq halliburton - 1 freq hill-forts - 1 freq halfords - 2 freq half-fairt - 1 freq help-yersel - 1 freq half-heartedly - 1 freq half-written - 1 freq hellyiefers - 1 freq halberd's - 1 freq halbert - 2 freq half-rotten - 1 freq half-hearted - 1 freq heliport - 2 freq halper - 2 freq half-hard - 2 freq hellyeifers - 1 freq hillberry - 1 freq holburn - 3 freq heilbronn - 3 freq |
MetaPhone code - HLPR helper - 5 freq halper - 2 freq |
HELPER help - 1140 freq helper - 5 freq helps - 56 freq helped - 92 freq helping - 23 freq helpin - 87 freq |
Time to execute Levenshtein function - 0.180988 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.361110 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.027584 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.037342 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.000993 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. |