| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| favrit (0) - 6 freq farrit (1) - 1 freq favorit (1) - 2 freq fauvrit (1) - 1 freq failit (2) - 2 freq lairit (2) - 2 freq fankit (2) - 2 freq fadit (2) - 10 freq harrit (2) - 1 freq flairit (2) - 1 freq faerie (2) - 8 freq forrit (2) - 529 freq faurrit (2) - 4 freq fashit (2) - 3 freq fackit (2) - 1 freq harit (2) - 1 freq fabric (2) - 19 freq favorite (2) - 2 freq arrit (2) - 1 freq fautit (2) - 3 freq fairin (2) - 13 freq favert (2) - 1 freq faert (2) - 4 freq varrit (2) - 1 freq forit (2) - 1 freq |
favrit (0) - 6 freq favorit (1) - 2 freq fauvrit (1) - 1 freq favourit (2) - 7 freq favert (2) - 1 freq farrit (2) - 1 freq favorite (2) - 2 freq favorits (3) - 1 freq fav'rite (3) - 2 freq firrit (3) - 1 freq forit (3) - 1 freq fart (3) - 29 freq varit (3) - 1 freq firit (3) - 1 freq favourite (3) - 234 freq favourt (3) - 5 freq faivourit (3) - 1 freq fairt (3) - 26 freq furrit (3) - 95 freq fearit (3) - 3 freq faert (3) - 4 freq fauret (3) - 1 freq fivert (3) - 2 freq flairit (3) - 1 freq forrit (3) - 529 freq |
SoundEx code - F163 favourt - 5 freq favourite - 234 freq fauvrit - 1 freq favoured - 12 freq favourites - 27 freq fevered - 2 freq faivourit - 1 freq favourit - 7 freq fav'rite - 2 freq 'favourite - 1 freq favorit - 2 freq faavourt - 1 freq fivert - 2 freq favorite - 2 freq favrit - 6 freq faburden - 1 freq favert - 1 freq fibert - 2 freq fuppertie-jig - 1 freq favorits - 1 freq favoritething - 1 freq fevertreemixers - 1 freq |
MetaPhone code - FFRT favourt - 5 freq favourite - 234 freq fauvrit - 1 freq favoured - 12 freq fevered - 2 freq faivourit - 1 freq favourit - 7 freq fav'rite - 2 freq 'favourite - 1 freq favorit - 2 freq faavourt - 1 freq fivert - 2 freq favorite - 2 freq favrit - 6 freq favert - 1 freq foghradh - 1 freq |
FAVRIT |
| Time to execute Levenshtein function - 0.194501 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.351960 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.027729 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.037784 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.000918 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. |