| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| in-bye (0) - 1 freq inbye (1) - 66 freq up-bye (2) - 1 freq inaby (2) - 2 freq inby (2) - 69 freq in-box (2) - 1 freq in-bred (2) - 1 freq intay (3) - 3 freq 'a-aye (3) - 1 freq inte (3) - 129 freq intry (3) - 3 freq incite (3) - 1 freq im-bru (3) - 1 freq insece (3) - 1 freq enable (3) - 4 freq innate (3) - 3 freq yin-eyed (3) - 1 freq bye-bye (3) - 1 freq inside (3) - 563 freq tie-dye (3) - 1 freq inglys (3) - 1 freq is-but (3) - 1 freq oorbye (3) - 1 freq ingate (3) - 4 freq noble (3) - 30 freq |
in-bye (0) - 1 freq inbye (2) - 66 freq in-box (3) - 1 freq inby (3) - 69 freq inaby (3) - 2 freq up-bye (3) - 1 freq bye-bye (4) - 1 freq yin-eyed (4) - 1 freq on-tae (4) - 1 freq onby (4) - 1 freq n-e (4) - 2 freq in- (4) - 1 freq go-by (4) - 2 freq inbi (4) - 1 freq yin-but (4) - 2 freq ye-be (4) - 1 freq nebe (4) - 4 freq in-bred (4) - 1 freq is'be (5) - 1 freq -wye (5) - 4 freq intiae (5) - 1 freq bye (5) - 114 freq ineae (5) - 1 freq wan-wye (5) - 1 freq furbye (5) - 6 freq |
SoundEx code - I510 inby - 69 freq inbye - 66 freq info - 35 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 |
IN-BYE |
| Time to execute Levenshtein function - 0.195616 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.375942 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.032887 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.048172 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.000986 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. |