| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onsg (0) - 1 freq ons (1) - 1 freq mnsg (1) - 1 freq gnsg (1) - 1 freq ong (1) - 2 freq mons (2) - 12 freq anse (2) - 4 freq onty (2) - 3 freq const (2) - 1 freq oney (2) - 15 freq cnag (2) - 1 freq onq (2) - 1 freq ones (2) - 31 freq oni (2) - 1 freq obg (2) - 1 freq oasz (2) - 1 freq onhe (2) - 1 freq ofkg (2) - 1 freq tong (2) - 7 freq once (2) - 129 freq on' (2) - 5 freq ung (2) - 1 freq ens (2) - 16 freq oqsd (2) - 1 freq on't (2) - 39 freq |
onsg (0) - 1 freq ong (2) - 2 freq gnsg (2) - 1 freq ons (2) - 1 freq mnsg (2) - 1 freq nsz (3) - 1 freq msg (3) - 1 freq ins (3) - 14 freq neg (3) - 1 freq ng (3) - 6 freq ense (3) - 15 freq isg (3) - 1 freq unst (3) - 12 freq nsa (3) - 1 freq psg (3) - 3 freq eng (3) - 10 freq nag (3) - 6 freq ions (3) - 3 freq nog (3) - 3 freq anso (3) - 1 freq nsh (3) - 1 freq yons (3) - 6 freq ans (3) - 2 freq ones (3) - 31 freq insy (3) - 4 freq |
SoundEx code - O520 once - 129 freq ones - 31 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 ounce - 5 freq ohms - 1 freq oonce - 2 freq onyways - 5 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 - ONSK onysake - 1 freq onsg - 1 freq |
ONSG |
| Time to execute Levenshtein function - 0.493053 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.676493 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.041098 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.074948 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.000882 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. |