| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oanyone (0) - 1 freq onyone (1) - 23 freq anyone (1) - 67 freq 'anyone (1) - 1 freq onyane (2) - 13 freq lanyon (2) - 1 freq canyon (2) - 1 freq oanline (2) - 36 freq onyene (2) - 1 freq anyont (2) - 1 freq annone (2) - 1 freq hansome (3) - 3 freq cannon (3) - 13 freq canon' (3) - 2 freq onion (3) - 14 freq ransome (3) - 1 freq hanson (3) - 1 freq outdone (3) - 1 freq anoonce (3) - 1 freq abandone (3) - 1 freq alone (3) - 72 freq apone (3) - 3 freq navyne (3) - 3 freq nyne (3) - 4 freq anon (3) - 6 freq |
oanyone (0) - 1 freq anyone (1) - 67 freq onyone (1) - 23 freq onyane (2) - 13 freq 'anyone (2) - 1 freq onyene (2) - 1 freq onion (3) - 14 freq none (3) - 57 freq onyin (3) - 1 freq anyun (3) - 1 freq nyne (3) - 4 freq anon (3) - 6 freq annone (3) - 1 freq oanline (3) - 36 freq canyon (3) - 1 freq anne (3) - 77 freq anyont (3) - 1 freq lanyon (3) - 1 freq jayne (4) - 2 freq 'none (4) - 1 freq canne (4) - 7 freq antoni (4) - 1 freq 'anne (4) - 3 freq manne (4) - 1 freq ayne (4) - 3 freq |
SoundEx code - O550 onyhin - 23 freq ownin - 22 freq onion - 14 freq onyane - 13 freq onywan - 19 freq onieyin - 4 freq owaaanannnnnnnyyyeooooo - 1 freq oman - 2 freq onyin - 1 freq onyeen - 14 freq ony-ean - 7 freq onyone - 23 freq omen - 5 freq onnen - 2 freq onyyin - 1 freq onyene - 1 freq ony'hin' - 1 freq oniehin - 3 freq onieane - 1 freq onhin - 2 freq o'mine - 4 freq oanyone - 1 freq |
MetaPhone code - ONYN onyane - 13 freq onieyin - 4 freq onyin - 1 freq onyeen - 14 freq onyone - 23 freq onyene - 1 freq oanyone - 1 freq |
OANYONE |
| Time to execute Levenshtein function - 0.251936 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.640121 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.027880 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.070596 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.001298 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. |