| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bydand (0) - 1 freq rydand (1) - 2 freq bydan (1) - 1 freq bland (2) - 7 freq bydin (2) - 21 freq band (2) - 181 freq byrnand (2) - 1 freq bedad (2) - 1 freq byward (2) - 2 freq blaand (2) - 1 freq bygang (2) - 1 freq brand (2) - 51 freq byvind (2) - 1 freq baand (2) - 13 freq eyland (2) - 2 freq bygane (2) - 45 freq bidan (2) - 9 freq lyand (2) - 1 freq beand (2) - 1 freq rysand (2) - 1 freq byrant (2) - 1 freq pand (3) - 3 freq ban (3) - 48 freq brydon (3) - 3 freq riband (3) - 1 freq |
bydand (0) - 1 freq bydan (2) - 1 freq rydand (2) - 2 freq blaand (3) - 1 freq byvind (3) - 1 freq beand (3) - 1 freq bidan (3) - 9 freq baand (3) - 13 freq brand (3) - 51 freq bedad (3) - 1 freq bydin (3) - 21 freq bland (3) - 7 freq band (3) - 181 freq ayebydand (3) - 2 freq budged (4) - 1 freq braandy (4) - 1 freq bandy (4) - 13 freq dnd (4) - 1 freq wudend (4) - 1 freq bided (4) - 30 freq boayband (4) - 1 freq beyden (4) - 1 freq brynd (4) - 2 freq gdnd (4) - 1 freq body'd (4) - 1 freq |
SoundEx code - B353 buttoned - 11 freq bathin-huts - 1 freq bad-mouths - 1 freq battened - 2 freq bedmate - 2 freq but-and - 1 freq badmoothin - 1 freq bed-ends - 1 freq baadmooth - 1 freq bed-mate - 1 freq but-end - 2 freq btinternet - 12 freq bydand - 1 freq bdantarctica - 1 freq |
MetaPhone code - BTNT buttoned - 11 freq battened - 2 freq but-and - 1 freq but-end - 2 freq bydand - 1 freq |
BYDAND |
| Time to execute Levenshtein function - 0.356848 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.932343 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.079005 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.079102 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.000864 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. |