| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oams (0) - 2 freq cams (1) - 54 freq goams (1) - 2 freq oaks (1) - 1 freq rams (1) - 6 freq orams (1) - 1 freq oaps (1) - 4 freq oam (1) - 2 freq gams (1) - 1 freq tams (1) - 4 freq yoams (1) - 2 freq oats (1) - 37 freq oars (1) - 25 freq ohms (1) - 1 freq oags (1) - 2 freq oafs (1) - 1 freq bams (1) - 28 freq mams (1) - 5 freq lams (1) - 2 freq jams (1) - 3 freq dams (1) - 6 freq hams (1) - 10 freq laes (2) - 2 freq gans (2) - 51 freq tam' (2) - 1 freq |
oams (0) - 2 freq yoams (1) - 2 freq mas (2) - 7 freq aims (2) - 14 freq amos (2) - 3 freq jams (2) - 3 freq dams (2) - 6 freq hams (2) - 10 freq maes (2) - 7 freq aamos (2) - 5 freq amys (2) - 1 freq ms (2) - 29 freq maas (2) - 7 freq aums (2) - 1 freq maus (2) - 1 freq ems (2) - 4 freq mais (2) - 3 freq yums (2) - 3 freq lams (2) - 2 freq oaps (2) - 4 freq oam (2) - 2 freq gams (2) - 1 freq orams (2) - 1 freq rams (2) - 6 freq cams (2) - 54 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 - OMS ohms - 1 freq o'm's - 2 freq oams - 2 freq omcew - 1 freq omiiws - 1 freq |
OAMS |
| Time to execute Levenshtein function - 0.254996 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.381336 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.030167 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.038439 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.001212 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. |