| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onby (0) - 1 freq onny (1) - 3 freq onay (1) - 1 freq oney (1) - 15 freq ony (1) - 2222 freq only (1) - 1876 freq oncy (1) - 4 freq onty (1) - 3 freq inby (1) - 69 freq eny (2) - 7 freq on- (2) - 3 freq bnb (2) - 1 freq one (2) - 766 freq on's (2) - 4 freq onwye (2) - 4 freq ojly (2) - 1 freq by (2) - 4600 freq honey (2) - 413 freq nhy (2) - 1 freq toney (2) - 1 freq obe (2) - 2 freq loaby (2) - 3 freq boaby (2) - 6 freq gonny (2) - 17 freq obey (2) - 8 freq |
onby (0) - 1 freq inby (1) - 69 freq nb (2) - 4 freq onyb (2) - 1 freq inbi (2) - 1 freq inbye (2) - 66 freq onty (2) - 3 freq inaby (2) - 2 freq onay (2) - 1 freq onny (2) - 3 freq oncy (2) - 4 freq oney (2) - 15 freq only (2) - 1876 freq ony (2) - 2222 freq onti (3) - 8 freq otb (3) - 1 freq ootby (3) - 128 freq iny (3) - 6 freq omb (3) - 3 freq enjy (3) - 2 freq dounby (3) - 3 freq ny (3) - 8 freq nob (3) - 1 freq nbs (3) - 1 freq onta (3) - 2 freq |
SoundEx code - O510 onfaw - 4 freq oonhappy - 1 freq oomph - 4 freq oompa - 1 freq onhappie - 1 freq one-aff - 1 freq omb - 3 freq onby - 1 freq onieb - 1 freq onyb - 1 freq onafi - 1 freq ohhomaob - 1 freq |
MetaPhone code - ONB onby - 1 freq onieb - 1 freq onyb - 1 freq |
ONBY |
| Time to execute Levenshtein function - 0.213305 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.676030 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.076300 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.087100 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.000904 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. |