| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| orgy (0) - 1 freq orty (1) - 1 freq org (1) - 26 freq argy (1) - 6 freq gray (2) - 87 freq cry (2) - 369 freq ort (2) - 2 freq jorg (2) - 1 freq fry (2) - 39 freq frey (2) - 1 freq corpy (2) - 1 freq ore (2) - 1 freq oany (2) - 16 freq sorny (2) - 2 freq wbgy (2) - 1 freq worky (2) - 1 freq forty (2) - 103 freq rgm (2) - 1 freq mgy (2) - 1 freq wormy (2) - 1 freq wordy (2) - 11 freq engy (2) - 2 freq lory (2) - 42 freq horny (2) - 1 freq olly (2) - 6 freq |
orgy (0) - 1 freq argy (1) - 6 freq org (1) - 26 freq origo (2) - 1 freq ergo (2) - 1 freq rg (2) - 4 freq urge (2) - 27 freq argo (2) - 6 freq orig (2) - 1 freq rgo (2) - 1 freq orty (2) - 1 freq rgu (2) - 1 freq ury (3) - 2 freq rig (3) - 45 freq torge (3) - 1 freq erly (3) - 3 freq oeg (3) - 1 freq ry (3) - 7 freq orti (3) - 1 freq norge (3) - 1 freq or (3) - 9305 freq ragu (3) - 1 freq edgy (3) - 7 freq arky (3) - 1 freq rgx (3) - 1 freq |
SoundEx code - O620 oors - 357 freq or's - 1 freq oars - 25 freq owerreach - 1 freq owersee - 2 freq ours - 16 freq oors' - 2 freq ooers - 11 freq oor's - 6 freq orras - 1 freq 'oors - 18 freq orra's - 1 freq orr's - 4 freq ower-uiss - 2 freq orgy - 1 freq ower's - 2 freq ¬‚ooers - 1 freq oweruiss - 1 freq 'ork' - 1 freq owresee - 2 freq ower-rax - 1 freq origo - 1 freq ower-uise - 1 freq org - 26 freq owers - 2 freq orig - 1 freq €˜oors - 9 freq ooirs - 2 freq owersaw - 1 freq oorichie - 1 freq oreos - 1 freq orca - 7 freq ooihrox - 3 freq ork - 2 freq |
MetaPhone code - ORJ orgy - 1 freq |
ORGY |
| Time to execute Levenshtein function - 0.315056 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.667886 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.033629 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.045697 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.001201 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. |