| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fobwatch (0) - 2 freq fob-wateh (2) - 1 freq rewatch (3) - 1 freq dcwatch (3) - 1 freq €œwatch (3) - 1 freq watch (3) - 675 freq doomwatch (3) - 1 freq batch (3) - 13 freq hoatch (3) - 1 freq 'watch (3) - 12 freq -watch (3) - 1 freq swatch (3) - 99 freq footch (3) - 1 freq fowrth (3) - 2 freq fowth (3) - 5 freq nwatch (3) - 1 freq €˜watch (3) - 1 freq forrat (4) - 4 freq watcht (4) - 8 freq monarch (4) - 9 freq rowth (4) - 54 freq potch (4) - 3 freq boath (4) - 2 freq borrach (4) - 1 freq forsyth (4) - 4 freq |
fobwatch (0) - 2 freq fob-wateh (4) - 1 freq swatch (5) - 99 freq footch (5) - 1 freq -watch (5) - 1 freq nwatch (5) - 1 freq 'watch (5) - 12 freq fowth (5) - 5 freq €˜watch (5) - 1 freq €œwatch (5) - 1 freq dcwatch (5) - 1 freq rewatch (5) - 1 freq watch (5) - 675 freq batch (5) - 13 freq doomwatch (5) - 1 freq blotch (6) - 6 freq butch (6) - 4 freq fqbwtadh (6) - 1 freq bycatch (6) - 1 freq cabbitch (6) - 3 freq swaatch (6) - 4 freq bitch (6) - 60 freq €˜witch (6) - 1 freq brotch (6) - 8 freq fittach (6) - 4 freq |
SoundEx code - F132 fifties - 21 freq fobwatch - 2 freq fifths - 1 freq fifty-seiven - 1 freq 'fifty-six - 1 freq fifities - 1 freq fifty-seeven - 2 freq fifty-sax - 1 freq fufidius - 2 freq fifty-six - 1 freq fuftiesax - 2 freq |
MetaPhone code - FBWX fobwatch - 2 freq |
FOBWATCH |
| Time to execute Levenshtein function - 0.201089 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.391921 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.028525 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.042367 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.000885 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. |