| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anbile (0) - 1 freq angils (2) - 1 freq snaile (2) - 1 freq amble (2) - 3 freq anvil (2) - 5 freq abbie (2) - 59 freq able (2) - 436 freq angie (2) - 36 freq andie (2) - 1 freq awhile (2) - 15 freq hannile (2) - 1 freq anvils (2) - 1 freq ankle (2) - 36 freq ansible (2) - 2 freq abide (2) - 15 freq mobile (2) - 57 freq angle (2) - 22 freq agile (2) - 2 freq anlie (2) - 15 freq annie (2) - 108 freq aible (2) - 2 freq 'bile (2) - 2 freq aprile (2) - 36 freq nile (2) - 14 freq abie (2) - 1 freq |
anbile (0) - 1 freq 'bile (3) - 2 freq habile (3) - 6 freq aible (3) - 2 freq anlie (3) - 15 freq angle (3) - 22 freq bile (3) - 56 freq mobile (3) - 57 freq nobil (3) - 1 freq enable (3) - 4 freq onabil (3) - 1 freq noble (3) - 32 freq unable (3) - 19 freq nile (3) - 14 freq anvil (3) - 5 freq amble (3) - 3 freq able (3) - 436 freq ansible (3) - 2 freq ankle (3) - 36 freq anglo (4) - 2 freq gable (4) - 8 freq inbye (4) - 66 freq nle (4) - 1 freq inhale (4) - 2 freq ingle (4) - 29 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 - ANBL anbile - 1 freq annabel - 1 freq |
ANBILE |
| Time to execute Levenshtein function - 0.183693 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.373166 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.027791 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.045758 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.000903 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. |