| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jackman (0) - 2 freq packman (1) - 3 freq jakman (1) - 2 freq pac-man (2) - 1 freq jackdaw (2) - 2 freq packmen (2) - 2 freq backmen (2) - 1 freq walkman (2) - 3 freq wachman (2) - 1 freq cacklan (2) - 1 freq jackson (2) - 38 freq jackal (2) - 1 freq tacksman (2) - 1 freq tackan (2) - 1 freq backbane (3) - 2 freq taakan (3) - 2 freq wakkan (3) - 1 freq rackin (3) - 8 freq achan (3) - 2 freq fancyman (3) - 1 freq talkan (3) - 18 freq jack's (3) - 6 freq bockan (3) - 7 freq back-en (3) - 15 freq dalaman (3) - 1 freq |
jackman (0) - 2 freq packman (2) - 3 freq jakman (2) - 2 freq backmen (3) - 1 freq packmen (3) - 2 freq jackson (3) - 38 freq jackal (4) - 1 freq tacksman (4) - 1 freq jockin (4) - 1 freq jeckson (4) - 1 freq tackan (4) - 1 freq cacklan (4) - 1 freq walkman (4) - 3 freq jackdaw (4) - 2 freq wachman (4) - 1 freq pac-man (4) - 1 freq cacklin (5) - 2 freq lacken (5) - 1 freq tacklin (5) - 4 freq hackin (5) - 7 freq calman (5) - 1 freq tickan (5) - 2 freq caiman (5) - 1 freq incoman (5) - 1 freq jackals (5) - 1 freq |
SoundEx code - J255 jejunum - 1 freq jessamine - 4 freq jugement - 3 freq jugemint - 1 freq jackman - 2 freq jakman - 2 freq jessenoonan - 1 freq |
MetaPhone code - JKMN jackman - 2 freq jakman - 2 freq |
JACKMAN |
| Time to execute Levenshtein function - 0.306825 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.708271 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.059296 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.039476 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. |