Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
faivourit (0) - 1 freq favourit (1) - 7 freq faivourin (1) - 1 freq favourin (2) - 1 freq favourite (2) - 234 freq favorit (2) - 2 freq faavourt (2) - 1 freq favourt (2) - 5 freq saivourin (2) - 2 freq favourist (2) - 1 freq flavourin (3) - 1 freq favorite (3) - 2 freq favoured (3) - 12 freq favourites (3) - 27 freq favour's (3) - 1 freq faitherit (3) - 1 freq favours (3) - 22 freq favorits (3) - 1 freq faavour (3) - 1 freq savourin (3) - 7 freq favour (3) - 69 freq 'favourite (3) - 1 freq fauvours (3) - 1 freq fauvrit (3) - 1 freq fauvour (3) - 3 freq |
faivourit (0) - 1 freq favourit (1) - 7 freq faavourt (2) - 1 freq favorit (2) - 2 freq favourt (2) - 5 freq faivourin (2) - 1 freq favourite (2) - 234 freq favorite (3) - 2 freq favrit (3) - 6 freq fauvrit (3) - 1 freq favourist (3) - 1 freq favourin (3) - 1 freq 'favourite (4) - 1 freq fauvours (4) - 1 freq favour (4) - 69 freq fivert (4) - 2 freq faavour (4) - 1 freq fauvour (4) - 3 freq favert (4) - 1 freq favoured (4) - 12 freq favourites (4) - 27 freq saivourin (4) - 2 freq favours (4) - 22 freq favorits (4) - 1 freq fairt (5) - 26 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 |
FAIVOURIT |
Time to execute Levenshtein function - 0.273416 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.420810 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.029412 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.039757 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.000928 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. |