| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| favorit (0) - 2 freq favorits (1) - 1 freq favorite (1) - 2 freq favrit (1) - 6 freq favourit (1) - 7 freq fav'rite (2) - 2 freq favourist (2) - 1 freq faurrit (2) - 4 freq faivourit (2) - 1 freq favourin (2) - 1 freq favor (2) - 1 freq favourt (2) - 5 freq favourite (2) - 234 freq forit (2) - 1 freq favert (2) - 1 freq fauvrit (2) - 1 freq farrit (2) - 1 freq raport (3) - 1 freq forst (3) - 1 freq fadit (3) - 10 freq fairt (3) - 26 freq saiprit (3) - 5 freq fauret (3) - 1 freq fashit (3) - 3 freq varrit (3) - 1 freq |
favorit (0) - 2 freq favrit (1) - 6 freq favourit (1) - 7 freq favorite (1) - 2 freq faivourit (2) - 1 freq favourt (2) - 5 freq favourite (2) - 234 freq favert (2) - 1 freq fauvrit (2) - 1 freq favorits (2) - 1 freq faavourt (3) - 1 freq fivert (3) - 2 freq farrit (3) - 1 freq forit (3) - 1 freq favourist (3) - 1 freq fav'rite (3) - 2 freq faurrit (3) - 4 freq favourin (3) - 1 freq favor (3) - 1 freq favours (4) - 22 freq favoured (4) - 12 freq flairit (4) - 1 freq davert (4) - 1 freq floret (4) - 1 freq fart (4) - 29 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 |
FAVORIT |
| Time to execute Levenshtein function - 0.238255 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.384294 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.027617 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.037573 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.005481 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. |