| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| favoured (0) - 12 freq flavoured (1) - 1 freq savoured (1) - 4 freq favour's (2) - 1 freq favours (2) - 22 freq laboured (2) - 5 freq favourit (2) - 7 freq favour (2) - 69 freq faured (2) - 3 freq favourin (2) - 1 freq favourt (2) - 5 freq devoured (2) - 3 freq flured (3) - 1 freq favourite (3) - 234 freq jalouzed (3) - 4 freq faivourin (3) - 1 freq savoury (3) - 1 freq captured (3) - 30 freq loured (3) - 4 freq fauvours (3) - 1 freq taured (3) - 2 freq faavourt (3) - 1 freq savours (3) - 1 freq aroused (3) - 1 freq forred (3) - 1 freq |
favoured (0) - 12 freq flavoured (2) - 1 freq savoured (2) - 4 freq favourin (3) - 1 freq favourt (3) - 5 freq faured (3) - 3 freq fevered (3) - 2 freq devoured (3) - 3 freq favour (3) - 69 freq favours (3) - 22 freq favourit (3) - 7 freq devored (4) - 1 freq favorit (4) - 2 freq fared (4) - 11 freq figured (4) - 11 freq faivourit (4) - 1 freq davered (4) - 1 freq faavour (4) - 1 freq forred (4) - 1 freq faired (4) - 2 freq faidered (4) - 1 freq fiegured (4) - 1 freq fauvour (4) - 3 freq faered (4) - 20 freq faavourt (4) - 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 - 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 |
FAVOURED |
| Time to execute Levenshtein function - 0.225250 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.383407 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.028220 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.039029 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.000986 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. |