| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| favourin (0) - 1 freq favouring (1) - 1 freq savourin (1) - 7 freq faivourin (1) - 1 freq favourit (1) - 7 freq flavourin (1) - 1 freq favour's (2) - 1 freq favourist (2) - 1 freq favorit (2) - 2 freq favour (2) - 69 freq flavouring (2) - 1 freq favourt (2) - 5 freq faivourit (2) - 1 freq favours (2) - 22 freq favourite (2) - 234 freq devourin (2) - 6 freq saivourin (2) - 2 freq labourin (2) - 3 freq favoured (2) - 12 freq carousin (3) - 2 freq smourin (3) - 1 freq favourites (3) - 27 freq flavoured (3) - 1 freq flavour (3) - 27 freq labourin' (3) - 1 freq |
favourin (0) - 1 freq faivourin (1) - 1 freq favourit (2) - 7 freq flavourin (2) - 1 freq savourin (2) - 7 freq favouring (2) - 1 freq favourite (3) - 234 freq devourin (3) - 6 freq favoured (3) - 12 freq faivourit (3) - 1 freq saivourin (3) - 2 freq favours (3) - 22 freq favourt (3) - 5 freq favour (3) - 69 freq favorit (3) - 2 freq furin (4) - 1 freq favorite (4) - 2 freq devoorin (4) - 2 freq favor (4) - 1 freq faerin (4) - 1 freq favrit (4) - 6 freq florin (4) - 4 freq fauvours (4) - 1 freq haverin (4) - 25 freq faavour (4) - 1 freq |
SoundEx code - F165 faivourin - 1 freq favourin - 1 freq favouring - 1 freq |
MetaPhone code - FFRN foghorn - 4 freq faivourin - 1 freq favourin - 1 freq |
FAVOURIN |
| Time to execute Levenshtein function - 0.425203 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.882786 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.028327 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.073098 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.000868 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. |