| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oboe (0) - 1 freq obe (1) - 2 freq sloe (2) - 1 freq oose (2) - 13 freq omo (2) - 1 freq 'woe (2) - 1 freq oon (2) - 2 freq ojo (2) - 3 freq obf (2) - 1 freq floe (2) - 1 freq ooze (2) - 3 freq ohe (2) - 1 freq oye (2) - 1 freq oe (2) - 13 freq obbv (2) - 1 freq bee (2) - 51 freq bce (2) - 3 freq ibo (2) - 1 freq ofhe (2) - 1 freq oba (2) - 2 freq shoe (2) - 46 freq bue (2) - 1 freq xbox (2) - 2 freq bow (2) - 74 freq ible (2) - 1 freq |
oboe (0) - 1 freq obe (1) - 2 freq bou (2) - 12 freq obey (2) - 8 freq boy (2) - 530 freq boo (2) - 58 freq boa (2) - 16 freq bye (2) - 115 freq bie (2) - 15 freq ob (2) - 8 freq be (2) - 15063 freq boi (2) - 3 freq aboo (2) - 2 freq boye (2) - 1 freq abo (2) - 2 freq bo (2) - 18 freq bae (2) - 855 freq abie (2) - 1 freq abee (2) - 3 freq abe (2) - 3 freq oob (2) - 1 freq abou (2) - 1 freq ibo (2) - 1 freq bee (2) - 51 freq bue (2) - 1 freq |
SoundEx code - O100 off - 546 freq of - 4117 freq oaf - 51 freq ouf - 1 freq oof - 6 freq oaff - 110 freq 'of - 17 freq oo've - 3 freq oba - 2 freq obey - 8 freq ov - 59 freq obe - 2 freq oaap - 1 freq ob - 8 freq oaffy - 3 freq oaffae - 2 freq ope - 3 freq oboe - 1 freq ouff - 1 freq oop - 2 freq ove - 1 freq ofhe - 1 freq owef - 1 freq o'view - 2 freq owf - 1 freq offae - 1 freq ovey - 1 freq 'of' - 1 freq oob - 1 freq ohff - 1 freq offy - 2 freq €œof - 6 freq op - 7 freq offie - 2 freq €˜of - 3 freq €™ope - 2 freq offay - 1 freq oov - 8 freq €™of - 3 freq owuhv - 1 freq opo - 1 freq obvo - 1 freq ooof - 1 freq opyu - 1 freq obf - 1 freq obv - 4 freq obbv - 1 freq ohp - 1 freq ofh - 1 freq opui - 1 freq obh - 2 freq oup - 1 freq oupa - 1 freq oove - 1 freq opp - 2 freq obp - 1 freq |
MetaPhone code - OB oba - 2 freq obey - 8 freq obe - 2 freq ob - 8 freq oboe - 1 freq oob - 1 freq obh - 2 freq |
OBOE |
| Time to execute Levenshtein function - 0.204384 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.334527 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.028077 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.037249 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.000905 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. |