| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onymare (0) - 2 freq anymare (1) - 17 freq onygate (2) - 1 freq onyman (2) - 1 freq anymaire (2) - 11 freq anymore (2) - 14 freq onymair (2) - 37 freq onysake (2) - 1 freq onyane (2) - 13 freq onyways (3) - 5 freq onyone (3) - 23 freq onywan (3) - 19 freq onywaly (3) - 1 freq onlmaps (3) - 1 freq onigate (3) - 1 freq onboard (3) - 2 freq neymar (3) - 1 freq onyday (3) - 1 freq onywyse (3) - 1 freq othmar (3) - 1 freq notare (3) - 1 freq onyplace (3) - 4 freq onytime (3) - 11 freq unmade (3) - 5 freq lyare (3) - 1 freq |
onymare (0) - 2 freq anymare (1) - 17 freq anymaire (2) - 11 freq onymair (2) - 37 freq anymore (2) - 14 freq anymair (3) - 31 freq neymar (3) - 1 freq onyman (3) - 1 freq onygate (4) - 1 freq onysake (4) - 1 freq noymarp (4) - 1 freq unmade (4) - 5 freq namer (4) - 1 freq nare (4) - 1 freq animate (4) - 1 freq annmari (4) - 2 freq notare (4) - 1 freq mare (4) - 190 freq unaware (4) - 6 freq onyane (4) - 13 freq oniemair (4) - 4 freq numero (4) - 1 freq kenmore (5) - 1 freq ymir (5) - 3 freq endre (5) - 1 freq |
SoundEx code - O556 onymair - 37 freq oniemair - 4 freq onniemair - 1 freq onymare - 2 freq |
MetaPhone code - ONMR onymair - 37 freq oniemair - 4 freq onniemair - 1 freq onymare - 2 freq |
ONYMARE |
| Time to execute Levenshtein function - 0.183485 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.396513 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.029638 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.038388 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.000789 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. |