| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| farmville (0) - 1 freq camille (3) - 1 freq annville (3) - 1 freq faimilie (3) - 21 freq saville (3) - 5 freq familie (3) - 1 freq forms'll (4) - 1 freq farmin (4) - 1 freq seville (4) - 1 freq grille (4) - 1 freq marbill (4) - 1 freq melville (4) - 1 freq barmie (4) - 1 freq braille (4) - 6 freq hardhill (4) - 2 freq mille (4) - 1 freq fareweill (4) - 6 freq firmil (4) - 2 freq camilla (4) - 2 freq revile (4) - 3 freq arvie (4) - 1 freq fairisle (4) - 2 freq harvie (4) - 3 freq formulae (4) - 3 freq fertile (4) - 21 freq |
farmville (0) - 1 freq formally (5) - 7 freq formulae (6) - 3 freq bournville (6) - 1 freq firmil (6) - 2 freq fareweill (6) - 6 freq farvel (6) - 1 freq parkvall (6) - 2 freq reveille (6) - 1 freq fairhill (6) - 1 freq firmlee (6) - 1 freq farrell (6) - 1 freq far'll (6) - 3 freq torvill (6) - 1 freq faimilie (6) - 21 freq saville (6) - 5 freq familie (6) - 1 freq forms'll (6) - 1 freq farewell (6) - 13 freq frilly (6) - 8 freq annville (6) - 1 freq camille (6) - 1 freq formulate (7) - 2 freq corbeille (7) - 1 freq maryhill (7) - 3 freq |
SoundEx code - F651 fryin-pan - 2 freq frumple - 1 freq fermbiggin - 1 freq farmfoods - 1 freq faur-an-aboot - 1 freq farmville - 1 freq frump - 1 freq fryinpan - 1 freq four-in-ablocks - 1 freq fryan-pan - 1 freq frumples - 1 freq ferm-wife - 1 freq fermfowk - 2 freq ferm-wife's - 1 freq frumpy - 1 freq fermwife - 17 freq fairynuff - 2 freq |
MetaPhone code - FRMFL farmville - 1 freq |
FARMVILLE |
| Time to execute Levenshtein function - 0.317849 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.700740 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.078721 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.036795 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.000797 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. |