| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onley (0) - 18 freq onlee (1) - 2 freq onles (1) - 2 freq oney (1) - 15 freq only (1) - 1847 freq onby (2) - 1 freq rowley (2) - 13 freq olly (2) - 6 freq oily (2) - 7 freq onee (2) - 2 freq filey (2) - 12 freq soley (2) - 2 freq onnly (2) - 37 freq motley (2) - 2 freq iley (2) - 4 freq onner (2) - 3 freq nle (2) - 1 freq moniey (2) - 1 freq honey (2) - 413 freq oyle (2) - 3 freq gyley (2) - 1 freq oudey (2) - 1 freq noncey (2) - 1 freq cley (2) - 23 freq coney (2) - 2 freq |
onley (0) - 18 freq only (1) - 1847 freq onlee (1) - 2 freq anly (2) - 1 freq nle (2) - 1 freq onli (2) - 40 freq oanly (2) - 7 freq onles (2) - 2 freq onlie (2) - 102 freq oney (2) - 15 freq alley (3) - 4 freq 'only (3) - 3 freq riley (3) - 4 freq ony (3) - 2214 freq lonly (3) - 2 freq ney (3) - 5 freq souley (3) - 1 freq oniwey (3) - 3 freq haley (3) - 1 freq onay (3) - 1 freq onny (3) - 3 freq pley (3) - 45 freq fonly (3) - 1 freq ainle (3) - 2 freq caley (3) - 4 freq |
SoundEx code - O540 only - 1847 freq onlie - 102 freq oanly - 7 freq onley - 18 freq oneywuly - 12 freq onywaly - 1 freq oneywuliy - 1 freq onywely - 4 freq 'only - 3 freq onnly - 37 freq o'neil - 1 freq onli - 40 freq €˜only - 1 freq o'neill - 5 freq €™only - 1 freq onlee - 2 freq “only - 1 freq oneill - 2 freq 'only' - 1 freq |
MetaPhone code - ONL only - 1847 freq onlie - 102 freq oanly - 7 freq onley - 18 freq 'only - 3 freq onnly - 37 freq o'neil - 1 freq onli - 40 freq €˜only - 1 freq o'neill - 5 freq €™only - 1 freq onlee - 2 freq “only - 1 freq oneill - 2 freq 'only' - 1 freq |
ONLEY |
| Time to execute Levenshtein function - 0.207079 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.362937 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.027582 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.037076 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.002149 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. |