| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oob (0) - 1 freq oop (1) - 2 freq zob (1) - 1 freq boob (1) - 5 freq ob (1) - 8 freq lob (1) - 5 freq bob (1) - 214 freq mob (1) - 26 freq nob (1) - 1 freq oo (1) - 422 freq fob (1) - 4 freq uob (1) - 1 freq gob (1) - 15 freq oot (1) - 13919 freq hob (1) - 10 freq oow (1) - 6 freq rob (1) - 73 freq oof (1) - 6 freq oon (1) - 2 freq oor (1) - 3999 freq ooa (1) - 1 freq oo' (1) - 17 freq ool (1) - 8 freq oov (1) - 8 freq ooo (1) - 23 freq |
oob (0) - 1 freq ob (1) - 8 freq uob (1) - 1 freq ub (2) - 3 freq obe (2) - 2 freq oba (2) - 2 freq dob (2) - 1 freq ooy (2) - 1 freq oos (2) - 1 freq omb (2) - 3 freq orb (2) - 2 freq ooh (2) - 37 freq eb (2) - 6 freq job (2) - 522 freq ib (2) - 1 freq bo (2) - 18 freq boa (2) - 16 freq yb (2) - 3 freq aab (2) - 3 freq boi (2) - 3 freq b (2) - 751 freq bou (2) - 12 freq ook (2) - 2 freq aib (2) - 2 freq boy (2) - 530 freq |
SoundEx code - O100 off - 546 freq of - 4120 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 |
OOB |
| Time to execute Levenshtein function - 0.234599 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.414611 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.031110 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.040138 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.000925 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. |