| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inbye (0) - 66 freq in-bye (1) - 1 freq inby (1) - 69 freq inate (2) - 1 freq insyde (2) - 1 freq invie (2) - 1 freq €˜bye (2) - 1 freq insy (2) - 4 freq iny (2) - 6 freq intee (2) - 1 freq inny (2) - 3 freq 'bye (2) - 1 freq inbye't (2) - 1 freq ingyne (2) - 8 freq onby (2) - 1 freq invyte (2) - 1 freq ingy (2) - 14 freq enjye (2) - 1 freq inbi (2) - 1 freq incy (2) - 1 freq inty (2) - 21 freq inbox (2) - 4 freq invy (2) - 2 freq ine (2) - 3 freq intae (2) - 4690 freq |
inbye (0) - 66 freq inby (1) - 69 freq inaby (2) - 2 freq inbi (2) - 1 freq onby (2) - 1 freq in-bye (2) - 1 freq infy (3) - 1 freq upbye (3) - 2 freq ineae (3) - 1 freq inde (3) - 4 freq inwy (3) - 1 freq in'ae (3) - 13 freq inben (3) - 5 freq inane (3) - 2 freq indie (3) - 1 freq indy (3) - 57 freq bye (3) - 115 freq inky (3) - 8 freq onyb (3) - 1 freq inte (3) - 129 freq onwye (3) - 4 freq nb (3) - 4 freq imbue (3) - 1 freq intue (3) - 1 freq inge (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 - INBY inbye - 66 freq in-bye - 1 freq |
INBYE |
| Time to execute Levenshtein function - 0.218320 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.396697 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.029826 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.038295 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.000914 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. |