Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
onks (0) - 1 freq ones (1) - 30 freq ons (1) - 1 freq donks (1) - 5 freq monks (1) - 23 freq onus (1) - 3 freq yonks (1) - 6 freq gonks (1) - 1 freq ouks (1) - 2 freq hnks (1) - 1 freq on's (1) - 4 freq oaks (1) - 1 freq zonks (1) - 1 freq honks (1) - 1 freq noks (2) - 1 freq hanks (2) - 2 freq oyls (2) - 1 freq fonds (2) - 1 freq only (2) - 1847 freq fons (2) - 1 freq maks (2) - 636 freq inky (2) - 8 freq oors (2) - 353 freq monk's (2) - 1 freq oils (2) - 2 freq |
onks (0) - 1 freq yonks (1) - 6 freq oaks (2) - 1 freq honks (2) - 1 freq on's (2) - 4 freq noks (2) - 1 freq nooks (2) - 2 freq yanks (2) - 13 freq hnks (2) - 1 freq zonks (2) - 1 freq ons (2) - 1 freq donks (2) - 5 freq ouks (2) - 2 freq monks (2) - 23 freq onus (2) - 3 freq ones (2) - 30 freq gonks (2) - 1 freq banks (3) - 130 freq lanks (3) - 1 freq nts (3) - 1 freq ngs (3) - 1 freq ink' (3) - 1 freq bouks (3) - 8 freq ints (3) - 1 freq anns (3) - 1 freq |
SoundEx code - O520 once - 123 freq ones - 30 freq on's - 4 freq ooneasy - 1 freq onieweys - 3 freq onyweys - 20 freq owns - 13 freq one's - 6 freq ouyang - 1 freq owens - 3 freq owen's - 1 freq oncy - 4 freq ohms - 1 freq oonce - 2 freq onyways - 5 freq ounce - 4 freq onic - 1 freq o-m-g - 1 freq oan's - 1 freq oonaesy - 4 freq ong - 2 freq onks - 1 freq owing - 2 freq omagh - 2 freq oncia - 1 freq onywyse - 1 freq ony's - 1 freq o'm's - 2 freq oams - 2 freq onus - 3 freq omnies - 1 freq oens - 1 freq onywyes - 2 freq onnieweys - 1 freq €˜owing - 1 freq onc - 1 freq €˜once - 1 freq onesie - 1 freq €œonce - 1 freq onieways - 1 freq oonagh - 3 freq omg - 13 freq €™owns - 1 freq ons - 1 freq oimzx - 1 freq oinz - 1 freq omcew - 1 freq onq - 1 freq onsg - 1 freq omggggg - 1 freq omxe - 1 freq omgx - 1 freq omiiws - 1 freq |
MetaPhone code - ONKS onks - 1 freq |
ONKS |
Time to execute Levenshtein function - 0.182298 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.341256 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.027709 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.037433 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.000802 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. |