| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inaby (0) - 2 freq inby (1) - 69 freq loaby (2) - 3 freq indy (2) - 57 freq inapt (2) - 1 freq inate (2) - 1 freq aby (2) - 11 freq ingy (2) - 14 freq inablo (2) - 5 freq boaby (2) - 6 freq inty (2) - 21 freq invy (2) - 2 freq snawy (2) - 6 freq inny (2) - 3 freq iday (2) - 19 freq inwy (2) - 1 freq inemy (2) - 8 freq snab (2) - 1 freq inimy (2) - 1 freq snaba (2) - 2 freq -nay (2) - 1 freq inbye (2) - 66 freq baby (2) - 121 freq intay (2) - 3 freq inaw (2) - 7 freq |
inaby (0) - 2 freq inby (1) - 69 freq inbye (2) - 66 freq inbi (2) - 1 freq nab (2) - 10 freq onby (2) - 1 freq inalo (3) - 1 freq inas (3) - 1 freq nib (3) - 10 freq iny (3) - 6 freq navy (3) - 45 freq inky (3) - 8 freq insy (3) - 4 freq inane (3) - 2 freq namby (3) - 1 freq onay (3) - 1 freq nob (3) - 1 freq naeb (3) - 8 freq nub (3) - 5 freq nebo (3) - 1 freq onyb (3) - 1 freq nb (3) - 4 freq incy (3) - 1 freq ina (3) - 99 freq in-bye (3) - 1 freq |
SoundEx code - I510 inby - 69 freq inbye - 66 freq info - 36 freq imp - 3 freq inaby - 2 freq invy - 2 freq invie - 1 freq in-bye - 1 freq imph - 1 freq imbue - 1 freq inbi - 1 freq imf - 2 freq inuff - 1 freq infy - 1 freq inov - 1 freq |
MetaPhone code - INB inby - 69 freq inaby - 2 freq inbi - 1 freq |
INABY |
| Time to execute Levenshtein function - 0.257288 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.381360 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.027932 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.037748 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.001168 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. |