| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fitmen (0) - 1 freq fitten (1) - 22 freq fitman (1) - 22 freq binmen (2) - 1 freq fiter (2) - 1 freq pitten (2) - 207 freq finnen (2) - 1 freq fit'n (2) - 1 freq wimen (2) - 1 freq fitteen (2) - 1 freq fite (2) - 199 freq withen (2) - 5 freq fishen (2) - 1 freq fittin (2) - 44 freq wimmen (2) - 39 freq aitten (2) - 2 freq aiten (2) - 4 freq ritten (2) - 1 freq batmen (2) - 1 freq fatten (2) - 1 freq filmed (2) - 9 freq firmed (2) - 1 freq kitten (2) - 6 freq pitman (2) - 1 freq sitten (2) - 12 freq |
fitmen (0) - 1 freq fitman (1) - 22 freq fatman (2) - 1 freq fitten (2) - 22 freq footmen (2) - 1 freq atmen (3) - 1 freq footman (3) - 11 freq fatten (3) - 1 freq fitin (3) - 4 freq pitman (3) - 1 freq bitumen (3) - 1 freq firemen (3) - 4 freq fairmen (3) - 1 freq faemen (3) - 1 freq finman (3) - 2 freq batmen (3) - 1 freq fittan (3) - 1 freq filmin (3) - 2 freq fitteen (3) - 1 freq fittin (3) - 44 freq fit'n (3) - 1 freq framin (4) - 4 freq fitna (4) - 40 freq faeman (4) - 1 freq teemen (4) - 2 freq |
SoundEx code - F355 fitman - 22 freq fitmen - 1 freq fitman's - 2 freq fattenin - 2 freq fee'd-man - 2 freq fee'd-men - 2 freq footman - 11 freq footmen - 1 freq footman's - 1 freq fittininment - 1 freq fatman - 1 freq |
MetaPhone code - FTMN fitman - 22 freq fitmen - 1 freq vitamin - 34 freq fee'd-man - 2 freq fee'd-men - 2 freq footman - 11 freq footmen - 1 freq fatman - 1 freq |
FITMEN |
| Time to execute Levenshtein function - 0.235752 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.387250 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.028892 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.038937 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.001182 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. |