| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bathgate (0) - 4 freq withgate (2) - 2 freq dhgate (3) - 1 freq waygate (3) - 1 freq navigate (3) - 7 freq agate (3) - 2 freq tailgate (3) - 1 freq ootgate (3) - 1 freq birthrate (3) - 1 freq castigate (3) - 1 freq baggage (3) - 10 freq bathe (3) - 7 freq bathert (3) - 11 freq bathans (3) - 1 freq bathie (3) - 2 freq thate (3) - 1 freq latinate (3) - 21 freq bathites (3) - 1 freq southgate (3) - 1 freq mitigate (3) - 1 freq lithgae (3) - 14 freq bathtime (3) - 1 freq athlete (3) - 5 freq backdate (3) - 1 freq bye-gane (4) - 3 freq |
bathgate (0) - 4 freq withgate (3) - 2 freq southgate (4) - 1 freq bathert (4) - 11 freq mitigate (5) - 1 freq bathites (5) - 1 freq thate (5) - 1 freq bathtime (5) - 1 freq bithert (5) - 2 freq baithert (5) - 1 freq bothert (5) - 37 freq bathie (5) - 2 freq lithgae (5) - 14 freq athlete (5) - 5 freq dhgate (5) - 1 freq ootgate (5) - 1 freq tailgate (5) - 1 freq bathans (5) - 1 freq birthrate (5) - 1 freq bathe (5) - 7 freq botham (6) - 1 freq -that (6) - 1 freq bathered (6) - 8 freq athott (6) - 1 freq ba'ht (6) - 1 freq |
SoundEx code - B323 bedside - 20 freq bedecked - 3 freq baddest - 1 freq bitchit - 1 freq buddhist - 19 freq bedsheets - 2 freq budjct - 1 freq budget - 31 freq betwixt - 7 freq bethsaida - 5 freq budged - 1 freq bawdiest - 1 freq betocht - 1 freq budget's - 1 freq bedsit - 4 freq bedsyde - 1 freq bedsteid - 1 freq budgeted - 1 freq budgets - 6 freq bad-used - 1 freq butched - 2 freq bodhisattva - 1 freq bedsheet - 2 freq budgetit - 1 freq buddhists - 2 freq bed-syde - 1 freq beidside - 1 freq bedeckt - 1 freq bathgate - 4 freq bdxtb - 1 freq butwheyisgettingthedrinksin - 1 freq bidscotland - 1 freq budgetin - 1 freq bdzt - 1 freq bootstrapcook - 7 freq btwktk - 1 freq |
MetaPhone code - B0KT bathgate - 4 freq |
BATHGATE |
| Time to execute Levenshtein function - 0.189072 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.350325 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.028320 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.037126 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.000870 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. |