| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| amiable (0) - 1 freq amicable (1) - 2 freq friable (2) - 2 freq mable (2) - 2 freq aible (2) - 2 freq affable (2) - 1 freq amble (2) - 3 freq arable (2) - 8 freq variable (2) - 5 freq viable (2) - 11 freq liable (2) - 4 freq cable (3) - 12 freq able (3) - 436 freq 'mibbie (3) - 3 freq gable (3) - 8 freq warkable (3) - 1 freq aizle (3) - 1 freq feable (3) - 1 freq abominable (3) - 1 freq 'mibbe (3) - 24 freq available (3) - 128 freq smile (3) - 458 freq rewable (3) - 1 freq habitable (3) - 4 freq miracle (3) - 43 freq |
amiable (0) - 1 freq amicable (2) - 2 freq mable (2) - 2 freq amble (2) - 3 freq viable (3) - 11 freq liable (3) - 4 freq arable (3) - 8 freq aible (3) - 2 freq taible (4) - 2 freq gamble (4) - 13 freq marble (4) - 21 freq mumble (4) - 3 freq deeable (4) - 1 freq seeable (4) - 1 freq ible (4) - 1 freq ramble (4) - 3 freq mile (4) - 278 freq ambled (4) - 1 freq mibe (4) - 3 freq -able (4) - 1 freq yable (4) - 7 freq mabel (4) - 91 freq wimble (4) - 1 freq sable (4) - 2 freq mibbie (4) - 104 freq |
SoundEx code - A514 anvilflush - 1 freq anvil - 5 freq amplify - 2 freq ambulance - 37 freq ambulances - 1 freq aimbulance - 3 freq ample - 9 freq anvils - 1 freq ainvils - 1 freq amble - 3 freq amblin - 3 freq ambles - 2 freq amplifies - 1 freq amplifiers - 1 freq annville - 1 freq amplified - 1 freq anbile - 1 freq €™ambulance - 1 freq amplifyin - 2 freq annabel - 1 freq amplifier - 1 freq ambled - 1 freq annbloom - 1 freq amiable - 1 freq |
MetaPhone code - AMBL amiable - 1 freq |
AMIABLE |
| Time to execute Levenshtein function - 0.211137 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.340698 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.027686 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.037629 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.000885 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. |