| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oobits (0) - 5 freq orbits (1) - 1 freq oozit (2) - 2 freq habits (2) - 23 freq oubit (2) - 2 freq orbit (2) - 10 freq ootfits (2) - 4 freq oolit (2) - 2 freq coits (2) - 1 freq robots (2) - 4 freq bits (2) - 312 freq oobin (2) - 2 freq robit (2) - 1 freq robins (2) - 1 freq ooirs (2) - 2 freq voits (2) - 2 freq obitu (2) - 1 freq doobts (2) - 1 freq boits (2) - 10 freq poopits (2) - 1 freq poyits (2) - 1 freq ooies (2) - 1 freq cubits (2) - 2 freq oots (2) - 22 freq oolies (2) - 1 freq |
oobits (0) - 5 freq bits (2) - 312 freq boits (2) - 10 freq orbits (2) - 1 freq oolets (3) - 1 freq cubits (3) - 2 freq buits (3) - 106 freq booties (3) - 1 freq oots (3) - 22 freq bouts (3) - 2 freq bats (3) - 34 freq bots (3) - 4 freq baits (3) - 3 freq buts (3) - 2 freq bites (3) - 23 freq bets (3) - 8 freq doobts (3) - 1 freq poyits (3) - 1 freq bouets (3) - 1 freq coits (3) - 1 freq boots (3) - 89 freq oubit (3) - 2 freq habits (3) - 23 freq obitu (3) - 1 freq robots (3) - 4 freq |
SoundEx code - O132 oobits - 5 freq optics - 2 freq optician - 4 freq opteecians - 1 freq ofdg - 1 freq obwtoz - 1 freq |
MetaPhone code - OBTS oobits - 5 freq obwtoz - 1 freq |
OOBITS |
| Time to execute Levenshtein function - 0.336938 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.650337 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.031694 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.073261 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.000911 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. |