| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| helper (0) - 5 freq helter (1) - 3 freq heller (1) - 3 freq helpers (1) - 12 freq helpen (1) - 1 freq helped (1) - 91 freq halper (1) - 2 freq elyer (2) - 1 freq hefner (2) - 1 freq cheeper (2) - 4 freq veeper (2) - 2 freq reaper (2) - 16 freq helpt (2) - 9 freq herber (2) - 5 freq hender (2) - 1 freq hemmer (2) - 21 freq deeper (2) - 51 freq cheaper (2) - 14 freq felder (2) - 1 freq healer (2) - 1 freq sherper (2) - 2 freq hesped (2) - 1 freq temper (2) - 50 freq heiter (2) - 1 freq elmer (2) - 2 freq |
helper (0) - 5 freq halper (1) - 2 freq heller (2) - 3 freq helped (2) - 91 freq helter (2) - 3 freq helpen (2) - 1 freq helpers (2) - 12 freq helpin (3) - 87 freq helpit (3) - 52 freq hellery (3) - 3 freq helpan (3) - 1 freq hyper (3) - 4 freq harper (3) - 3 freq hamper (3) - 3 freq halter (3) - 5 freq leper (3) - 2 freq helpfu (3) - 21 freq help (3) - 1128 freq holler (3) - 2 freq halped (3) - 2 freq helps (3) - 55 freq holder (3) - 2 freq helpt (3) - 9 freq healer (3) - 1 freq melter (4) - 1 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 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 - 1128 freq helper - 5 freq helps - 55 freq helped - 91 freq helping - 23 freq helpin - 87 freq |
| Time to execute Levenshtein function - 0.183241 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.348281 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.027164 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.038215 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.000868 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. |