| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| favourites (0) - 27 freq favourite (1) - 234 freq favorits (2) - 1 freq favorite (2) - 2 freq favourit (2) - 7 freq 'favourite (2) - 1 freq favouring (3) - 1 freq fav'rite (3) - 2 freq favorit (3) - 2 freq favours (3) - 22 freq favour's (3) - 1 freq favourist (3) - 1 freq favoured (3) - 12 freq favourt (3) - 5 freq faivourit (3) - 1 freq favourin (3) - 1 freq savours (4) - 1 freq savoured (4) - 4 freq salyerites (4) - 1 freq figurines (4) - 2 freq flavourin (4) - 1 freq flavours (4) - 3 freq faavourt (4) - 1 freq faktories (4) - 1 freq hypocrites (4) - 9 freq |
favourites (0) - 27 freq favorits (2) - 1 freq favourite (2) - 234 freq favourit (3) - 7 freq favorite (3) - 2 freq favour's (4) - 1 freq faivourit (4) - 1 freq favours (4) - 22 freq favourt (4) - 5 freq 'favourite (4) - 1 freq favorit (4) - 2 freq favrit (5) - 6 freq fauvours (5) - 1 freq faavourt (5) - 1 freq frites (5) - 1 freq forrits (5) - 17 freq favourin (5) - 1 freq fav'rite (5) - 2 freq favoured (5) - 12 freq favourist (5) - 1 freq favouring (5) - 1 freq faeries (6) - 14 freq fatures (6) - 1 freq samarites (6) - 1 freq favourably (6) - 1 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 - FFRTS favourites - 27 freq favorits - 1 freq |
FAVOURITES |
| Time to execute Levenshtein function - 0.192436 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.384190 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.027985 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.037622 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.000909 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. |