| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unavoidable (0) - 3 freq unavoydable (1) - 1 freq unavailable (2) - 1 freq unviable (3) - 1 freq untholable (4) - 1 freq avoidance (4) - 4 freq untholeable (4) - 1 freq unmendable (4) - 1 freq 'available (4) - 1 freq undesirable (4) - 1 freq unsociable (4) - 2 freq available (4) - 126 freq unjoukable (4) - 2 freq unreadable (4) - 2 freq unsuitable (4) - 2 freq unreliable (4) - 2 freq unassailable (4) - 1 freq unsolvable (4) - 1 freq enviable (4) - 1 freq unvisible (4) - 1 freq inevitable (4) - 26 freq undeniable (4) - 1 freq unstoppable (4) - 5 freq favourable (4) - 1 freq unevytable (4) - 2 freq |
unavoidable (0) - 3 freq unavoydable (1) - 1 freq unavailable (3) - 1 freq unviable (4) - 1 freq unevytable (5) - 2 freq unvisible (5) - 1 freq inevitable (5) - 26 freq enviable (5) - 1 freq unreadable (5) - 2 freq undeniable (6) - 1 freq inaudible (6) - 2 freq invaluable (6) - 6 freq invisible (6) - 44 freq unreliable (6) - 2 freq favourable (6) - 1 freq inevitably (6) - 10 freq unmendable (6) - 1 freq 'available (6) - 1 freq unsociable (6) - 2 freq available (6) - 126 freq unsuitable (6) - 2 freq unjoukable (6) - 2 freq advisable (7) - 4 freq insatiable (7) - 4 freq inaudibly (7) - 1 freq |
SoundEx code - U513 unbathert - 1 freq unbidden - 6 freq unbuttonin - 1 freq unevytable - 2 freq umpteenth - 8 freq umpteen - 15 freq unbooed - 1 freq unboadied - 1 freq unfaddomed - 1 freq unbeatable - 2 freq unpattrened - 2 freq unfaddomable - 1 freq unbuttoned - 4 freq unfettered - 2 freq unfaithful - 2 freq unbodie't - 3 freq unavoydable - 1 freq unbutton - 2 freq unpatentit - 1 freq unhappt - 1 freq unbowed - 1 freq unmouped - 1 freq unavoidable - 3 freq unmapped - 1 freq unified - 3 freq unbiddan - 1 freq unpaid - 3 freq unfit - 1 freq |
MetaPhone code - UNFTBL unevytable - 2 freq unavoydable - 1 freq unavoidable - 3 freq |
UNAVOIDABLE |
| Time to execute Levenshtein function - 0.182440 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.354525 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.027459 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.046343 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.000819 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. |