| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| favourable (0) - 1 freq favourably (1) - 1 freq favourite (3) - 234 freq adorable (3) - 8 freq honourable (3) - 8 freq favoured (4) - 12 freq unavoidable (4) - 3 freq favourin (4) - 1 freq valuable (4) - 18 freq resounable (4) - 1 freq parable (4) - 54 freq arable (4) - 8 freq meisurable (4) - 2 freq favourit (4) - 7 freq favourt (4) - 5 freq favour (4) - 69 freq favouring (4) - 1 freq favourites (4) - 27 freq favorite (4) - 2 freq favours (4) - 22 freq unavoydable (4) - 1 freq favour's (4) - 1 freq available (4) - 128 freq vocable (4) - 1 freq 'favourite (4) - 1 freq |
favourable (0) - 1 freq favourably (1) - 1 freq honourable (5) - 8 freq adorable (5) - 8 freq favourite (5) - 234 freq vocable (6) - 1 freq memorable (6) - 10 freq available (6) - 128 freq unavoydable (6) - 1 freq saveable (6) - 1 freq favour's (6) - 1 freq incurable (6) - 1 freq friable (6) - 2 freq variable (6) - 5 freq favours (6) - 22 freq 'available (6) - 1 freq vailuable (6) - 4 freq favourist (6) - 1 freq avaelable (6) - 2 freq valuable (6) - 18 freq arable (6) - 8 freq favoured (6) - 12 freq favourin (6) - 1 freq favorite (6) - 2 freq meisurable (6) - 2 freq |
SoundEx code - F161 five-year-plans - 1 freq favourable - 1 freq favourably - 1 freq |
MetaPhone code - FFRBL favourable - 1 freq favourably - 1 freq |
FAVOURABLE |
| Time to execute Levenshtein function - 0.217714 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.397343 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.028015 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.044655 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.001308 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. |