| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tacksmen (0) - 3 freq tacksman (1) - 1 freq backmen (2) - 1 freq tacken (2) - 2 freq packmen (2) - 2 freq tackie (3) - 2 freq fackson (3) - 1 freq taykeen (3) - 1 freq jacksie (3) - 3 freq rathsmen (3) - 1 freq tacked (3) - 2 freq tredsmen (3) - 2 freq backbeen (3) - 1 freq taisten (3) - 1 freq tackle (3) - 30 freq tacket (3) - 1 freq takken (3) - 15 freq tradesmen (3) - 1 freq lacken (3) - 1 freq jackson (3) - 38 freq tacklin (3) - 4 freq taken (3) - 122 freq tackles (3) - 3 freq tacks (3) - 3 freq tackin (3) - 1 freq |
tacksmen (0) - 3 freq tacksman (1) - 1 freq packmen (4) - 2 freq tacken (4) - 2 freq backmen (4) - 1 freq tradesmen (5) - 1 freq hackston (5) - 14 freq packman (5) - 3 freq tacks (5) - 3 freq backson (5) - 12 freq tacklin (5) - 4 freq jackson (5) - 38 freq tredsmen (5) - 2 freq tackan (5) - 1 freq fackson (5) - 1 freq tackin (5) - 1 freq jackman (5) - 2 freq tuck-in (6) - 1 freq jeckson (6) - 1 freq tredsman (6) - 3 freq excisemen (6) - 2 freq tickan (6) - 2 freq scotsmen (6) - 6 freq ticklin (6) - 6 freq tribesmen (6) - 1 freq |
SoundEx code - T255 tacksmen - 3 freq taakin-an - 1 freq tichenin - 1 freq taxman - 2 freq tax-mannie - 3 freq tax-mannies - 3 freq taxmannie - 1 freq tacksman - 1 freq tsunami - 8 freq thickenan - 1 freq tsunamis - 1 freq taxonomically - 1 freq thickening - 1 freq tasminasheikh - 1 freq twickenham - 1 freq |
MetaPhone code - TKSMN tacksmen - 3 freq taxman - 2 freq tax-mannie - 3 freq taxmannie - 1 freq tacksman - 1 freq |
TACKSMEN |
| Time to execute Levenshtein function - 0.222420 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.358062 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.029328 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.037010 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.000935 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. |