| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fwmre (0) - 1 freq aware (2) - 61 freq swure (2) - 3 freq fume (2) - 4 freq wore (2) - 121 freq fure (2) - 1 freq were (2) - 4095 freq faire (2) - 1 freq fare (2) - 64 freq owre (2) - 607 freq fre (2) - 2 freq wire (2) - 62 freq flure (2) - 13 freq fiere (2) - 4 freq fire (2) - 705 freq 'were (2) - 4 freq ftore (2) - 1 freq fwe (2) - 1 freq wure (2) - 5 freq fowre (2) - 25 freq femme (2) - 2 freq fmrj (2) - 1 freq famie (2) - 1 freq wyre (2) - 5 freq fibre (2) - 8 freq |
fwmre (0) - 1 freq fowre (3) - 25 freq fere (4) - 18 freq swire (4) - 1 freq fyre (4) - 27 freq fayre (4) - 8 freq swore (4) - 25 freq fibre (4) - 8 freq sware (4) - 1 freq ware (4) - 27 freq wme (4) - 1 freq flyre (4) - 1 freq fame (4) - 48 freq fawr (4) - 1 freq fewr (4) - 1 freq fower (4) - 697 freq fowr (4) - 23 freq fewar (4) - 1 freq fewer (4) - 11 freq flare (4) - 10 freq fore (4) - 157 freq fowmart (4) - 4 freq wyre (4) - 5 freq fawm (4) - 2 freq fare (4) - 64 freq |
SoundEx code - F560 finer - 14 freq finerie - 2 freq fooner - 4 freq finery - 5 freq funner - 1 freq faemier - 2 freq famour - 1 freq funnier - 7 freq fweohnor - 1 freq fnaar - 2 freq fwmre - 1 freq |
MetaPhone code - FMR faemier - 2 freq famour - 1 freq vimmer - 3 freq fwmre - 1 freq |
FWMRE |
| Time to execute Levenshtein function - 0.318388 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.475067 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.027641 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.037054 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.000872 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. |