| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| foofin (0) - 1 freq footin (1) - 1 freq fookin (1) - 2 freq roofin (1) - 1 freq dookin (2) - 20 freq florin (2) - 4 freq floodin (2) - 9 freq forgin (2) - 1 freq lookin (2) - 985 freq bootin (2) - 2 freq poonin (2) - 1 freq howfin (2) - 5 freq bookin (2) - 5 freq toolin (2) - 1 freq ootin (2) - 5 freq kookin (2) - 1 freq booin (2) - 17 freq doosin (2) - 2 freq foggin (2) - 1 freq foofed (2) - 1 freq coopin (2) - 1 freq fowlin (2) - 1 freq fouin (2) - 1 freq hoorin (2) - 3 freq coolfin (2) - 1 freq |
foofin (0) - 1 freq offin (2) - 20 freq roofin (2) - 1 freq footin (2) - 1 freq fookin (2) - 2 freq footan (3) - 1 freq foalin (3) - 1 freq foon (3) - 7 freq foamin (3) - 4 freq fuffin (3) - 2 freq boffin (3) - 2 freq doffin (3) - 2 freq loafin (3) - 1 freq soffin (3) - 1 freq coffin (3) - 67 freq froin (3) - 1 freq affin (3) - 2 freq boufin (3) - 3 freq effin (3) - 14 freq offen (3) - 17 freq faffin (3) - 1 freq foosion (3) - 1 freq coafin (3) - 1 freq foofed (3) - 1 freq fouin (3) - 1 freq |
SoundEx code - F150 fuffin - 2 freq fobbin - 3 freq faffin - 1 freq foofin - 1 freq fifin' - 1 freq fabiani - 5 freq fee-pyin - 1 freq fee-peyin - 1 freq feibn - 1 freq |
MetaPhone code - FFN fuffin - 2 freq faffin - 1 freq foofin - 1 freq fifin' - 1 freq viviane - 4 freq fvn - 1 freq |
FOOFIN |
| Time to execute Levenshtein function - 0.200597 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.382706 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.027845 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.036957 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.000801 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. |