| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onyman (0) - 1 freq onywan (1) - 19 freq onymare (2) - 2 freq anywan (2) - 28 freq styman (2) - 1 freq onymair (2) - 38 freq onyway (2) - 22 freq ongan (2) - 2 freq onyin (2) - 1 freq onyhin (2) - 23 freq ongaan (2) - 1 freq onyday (2) - 1 freq onyyin (2) - 1 freq con-man (2) - 1 freq flyman (2) - 5 freq ony-ean (2) - 7 freq cayman (2) - 1 freq oman (2) - 2 freq onyeen (2) - 14 freq wyman (2) - 1 freq onyane (2) - 13 freq oilman (2) - 1 freq wan-man (3) - 1 freq oan (3) - 6040 freq glydan (3) - 1 freq |
onyman (0) - 1 freq onywan (2) - 19 freq oman (3) - 2 freq cayman (3) - 1 freq ony-ean (3) - 7 freq onyeen (3) - 14 freq onyane (3) - 13 freq nomin (3) - 1 freq namin (3) - 7 freq naaman (3) - 2 freq onyyin (3) - 1 freq wyman (3) - 1 freq oilman (3) - 1 freq onymare (3) - 2 freq onymair (3) - 38 freq anywan (3) - 28 freq onyin (3) - 1 freq ongan (3) - 2 freq onyhin (3) - 23 freq ongaan (3) - 1 freq nymy (4) - 1 freq animal (4) - 101 freq andean (4) - 1 freq omen (4) - 5 freq i'man (4) - 1 freq |
SoundEx code - O555 on-an-on - 1 freq on-mannan - 1 freq onyman - 1 freq omainnin - 3 freq |
MetaPhone code - ONMN onyman - 1 freq |
ONYMAN |
| Time to execute Levenshtein function - 0.229713 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.350958 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.028309 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.037439 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. |