| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| belatedly (0) - 1 freq blately (2) - 2 freq belated (2) - 6 freq belted (3) - 14 freq 'belated' (3) - 1 freq beltel (3) - 4 freq repeatedly (3) - 4 freq related (3) - 28 freq berated (3) - 1 freq lately (3) - 57 freq beleted (3) - 1 freq devotedly (3) - 1 freq sedately (3) - 1 freq elated (3) - 3 freq deludedly (3) - 1 freq delaney (4) - 10 freq beloved (4) - 25 freq laekly (4) - 29 freq belly (4) - 159 freq blawed (4) - 9 freq blate-wye (4) - 2 freq bewaved (4) - 1 freq beaters (4) - 2 freq blythly (4) - 1 freq belten (4) - 1 freq |
belatedly (0) - 1 freq belated (3) - 6 freq blately (3) - 2 freq beltel (4) - 4 freq belted (4) - 14 freq beleted (4) - 1 freq bloated (5) - 1 freq blythely (5) - 5 freq blythly (5) - 1 freq bauldly (5) - 4 freq blindly (5) - 1 freq bolted (5) - 19 freq bleated (5) - 1 freq boldly (5) - 8 freq belittle (5) - 1 freq blithely (5) - 9 freq berated (5) - 1 freq lately (5) - 57 freq related (5) - 28 freq repeatedly (5) - 4 freq 'belated' (5) - 1 freq elated (5) - 3 freq devotedly (5) - 1 freq deludedly (5) - 1 freq melted (6) - 10 freq |
SoundEx code - B433 buildit - 1 freq bieldit - 5 freq bielded - 3 freq belted - 14 freq beltit - 14 freq bleatit - 2 freq blaudit - 2 freq bultit - 1 freq billeted - 1 freq bluidied - 2 freq bolted - 19 freq blid-wat - 1 freq blytheheid - 1 freq bull-heidit - 2 freq baldy-heided - 1 freq bloatit - 3 freq blotted - 5 freq boltit - 4 freq bolt-haedit - 1 freq bloated - 1 freq bluidwytin-fain - 1 freq belated - 6 freq bauld-heidit - 1 freq blottit - 1 freq bald-heided - 1 freq beildit - 4 freq bladdit - 4 freq bauldy-heid - 1 freq belatedly - 1 freq bloodit - 1 freq boltet - 1 freq bltidlink - 1 freq boalted - 1 freq bleated - 1 freq bloodied - 1 freq bluetooth - 2 freq beleted - 1 freq 'belated' - 1 freq |
MetaPhone code - BLTTL belatedly - 1 freq |
BELATEDLY |
| Time to execute Levenshtein function - 0.395478 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.807339 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.093942 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.111748 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.000805 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. |