| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bathed (0) - 13 freq bothed (1) - 1 freq bather (1) - 58 freq bathes (1) - 1 freq bathe (1) - 7 freq bashed (1) - 8 freq bathey (1) - 1 freq oathed (1) - 1 freq batted (1) - 1 freq butched (2) - 2 freq loathed (2) - 2 freq hatched (2) - 9 freq gather (2) - 16 freq laithed (2) - 2 freq baited (2) - 1 freq swathed (2) - 4 freq bythe (2) - 1 freq matted (2) - 2 freq boatled (2) - 1 freq cashed (2) - 3 freq bachled (2) - 1 freq berthed (2) - 1 freq sated (2) - 3 freq lached (2) - 5 freq wather (2) - 75 freq |
bathed (0) - 13 freq bothed (1) - 1 freq batted (2) - 1 freq oathed (2) - 1 freq bothied (2) - 2 freq bathey (2) - 1 freq bather (2) - 58 freq bathe (2) - 7 freq bathes (2) - 1 freq bashed (2) - 8 freq bother (3) - 322 freq baeheid (3) - 1 freq thed (3) - 1 freq bathin (3) - 11 freq botherd (3) - 1 freq baths (3) - 35 freq bauthes (3) - 1 freq bathy (3) - 2 freq buther (3) - 11 freq bawheid (3) - 6 freq abated (3) - 1 freq bath (3) - 98 freq bathie (3) - 2 freq birthed (3) - 3 freq bathered (3) - 8 freq |
SoundEx code - B330 bidit - 30 freq beheidit - 6 freq bided - 30 freq bydit - 8 freq buttit - 4 freq bodied - 2 freq baa-heidit - 1 freq bee-heidit - 1 freq bathed - 13 freq beddit - 16 freq bedded - 8 freq beheided - 7 freq bedad - 1 freq butted - 5 freq booted - 6 freq buttet - 6 freq bdéat - 2 freq bdat - 1 freq betide - 4 freq buited - 1 freq batted - 1 freq bothied - 2 freq body'd - 1 freq bootit - 2 freq bowtit - 1 freq beaded - 1 freq beady-eyed - 2 freq baited - 1 freq bodit - 2 freq bawheidit - 1 freq behatted - 1 freq bidet - 1 freq beatit - 1 freq bothed - 1 freq |
MetaPhone code - B0T bathed - 13 freq bothied - 2 freq bothed - 1 freq |
BATHED |
| Time to execute Levenshtein function - 0.184917 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.321945 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.027385 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.038941 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.000878 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. |