| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oars (0) - 25 freq oary (1) - 1 freq mars (1) - 59 freq jars (1) - 21 freq oar (1) - 37 freq fars (1) - 14 freq pars (1) - 9 freq bars (1) - 92 freq oors (1) - 357 freq oafs (1) - 1 freq ours (1) - 16 freq voars (1) - 3 freq doars (1) - 3 freq lars (1) - 1 freq oags (1) - 2 freq oaps (1) - 4 freq gars (1) - 89 freq ars (1) - 2 freq oams (1) - 2 freq ears (1) - 112 freq roars (1) - 23 freq wars (1) - 61 freq boars (1) - 3 freq soars (1) - 5 freq oats (1) - 37 freq |
oars (0) - 25 freq ears (1) - 112 freq oors (1) - 357 freq ars (1) - 2 freq ours (1) - 16 freq earse (2) - 4 freq yurs (2) - 2 freq ooirs (2) - 2 freq yrs (2) - 16 freq raas (2) - 10 freq rays (2) - 29 freq eares (2) - 1 freq yirs (2) - 4 freq eers (2) - 9 freq raes (2) - 2 freq ooers (2) - 11 freq ers (2) - 25 freq airs (2) - 38 freq rs (2) - 20 freq ares (2) - 3 freq aurs (2) - 1 freq years (2) - 1172 freq aers (2) - 2 freq yours (2) - 166 freq eirs (2) - 3 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 - ORS oors - 357 freq or's - 1 freq oars - 25 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 ¬‚ooers - 1 freq owresee - 2 freq €˜oors - 9 freq ooirs - 2 freq oreos - 1 freq |
OARS |
| Time to execute Levenshtein function - 0.208367 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.364636 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.028492 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.038728 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.000843 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. |