| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bobservant (0) - 1 freq oabzervant (3) - 1 freq observance (3) - 2 freq servant (3) - 60 freq observin (3) - 8 freq observing (3) - 1 freq observit (3) - 2 freq observes (4) - 3 freq tolerant (4) - 1 freq subservient (4) - 1 freq servan (4) - 4 freq servants (4) - 45 freq servint (4) - 1 freq sevant (4) - 1 freq doberman (4) - 2 freq yin-servant (4) - 1 freq servans (4) - 4 freq observers (4) - 1 freq boomerang (4) - 1 freq gesserant (4) - 1 freq observer (4) - 3 freq servand (4) - 2 freq observed (4) - 11 freq conservin (4) - 1 freq observe (4) - 14 freq |
bobservant (0) - 1 freq observing (5) - 1 freq observit (5) - 2 freq observin (5) - 8 freq subservient (5) - 1 freq oabzervant (5) - 1 freq observance (5) - 2 freq servant (5) - 60 freq yin-servant (6) - 1 freq servint (6) - 1 freq observed (7) - 11 freq observer (7) - 3 freq servand (7) - 2 freq conservin (7) - 1 freq sairvant (7) - 3 freq sarvint (7) - 22 freq obsairvit (7) - 1 freq gesserant (7) - 1 freq obsairvin (7) - 1 freq observe (7) - 14 freq sevant (7) - 1 freq servants (7) - 45 freq servan (7) - 4 freq observes (7) - 3 freq servans (7) - 4 freq |
SoundEx code - B126 bob-curtsey - 2 freq by-passer - 1 freq by-passers - 1 freq bobservant - 1 freq bawbaggery - 1 freq |
MetaPhone code - BBSRFNT bobservant - 1 freq |
BOBSERVANT |
| Time to execute Levenshtein function - 0.292115 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.416398 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.027475 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.037491 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.000879 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. |