| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fattenin (0) - 2 freq fastenin (1) - 1 freq flattenin (1) - 1 freq hastenin (2) - 1 freq matterin (2) - 1 freq wattenn (2) - 1 freq yatterin (2) - 4 freq watterin (2) - 12 freq faistenin (2) - 1 freq flatterin (2) - 1 freq attendin (2) - 11 freq natterin (2) - 4 freq fattened (2) - 2 freq fatten (2) - 1 freq festenin (2) - 1 freq patterin (2) - 6 freq batterin (2) - 28 freq attennin (2) - 1 freq flattenin' (2) - 1 freq banterin (3) - 1 freq pertenin (3) - 1 freq batherin (3) - 5 freq attend (3) - 36 freq fiftein (3) - 1 freq nytterin (3) - 1 freq |
fattenin (0) - 2 freq flattenin (2) - 1 freq fastenin (2) - 1 freq fattened (3) - 2 freq faistenin (3) - 1 freq fatten (3) - 1 freq festenin (3) - 1 freq wattenn (3) - 1 freq flattenin' (4) - 1 freq fitteen (4) - 1 freq fittin (4) - 44 freq fettin (4) - 1 freq buttonin (4) - 4 freq futtlin (4) - 1 freq attennin (4) - 1 freq fettlin (4) - 6 freq fitten (4) - 22 freq watterin (4) - 12 freq batterin (4) - 28 freq yatterin (4) - 4 freq matterin (4) - 1 freq hastenin (4) - 1 freq attendin (4) - 11 freq flatterin (4) - 1 freq patterin (4) - 6 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 - FTNN fattenin - 2 freq |
FATTENIN |
| Time to execute Levenshtein function - 0.196609 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.372492 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.027581 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.037219 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.000896 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. |