Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bdilecsx (0) - 1 freq baileys (3) - 3 freq bilers (3) - 1 freq dileas (3) - 1 freq biles (3) - 14 freq chile's (4) - 1 freq digest (4) - 5 freq directs (4) - 6 freq briteesh (4) - 1 freq ballest (4) - 3 freq diets (4) - 5 freq b'iler (4) - 1 freq bail's (4) - 1 freq bileeve (4) - 4 freq iles (4) - 3 freq while's (4) - 4 freq bileev (4) - 5 freq bleck' (4) - 1 freq belles (4) - 1 freq toilets (4) - 32 freq biest (4) - 1 freq brides (4) - 3 freq miles (4) - 173 freq boils (4) - 4 freq diners (4) - 1 freq |
bdilecsx (0) - 1 freq bodices (6) - 1 freq blocs (6) - 2 freq biles (6) - 14 freq baileys (6) - 3 freq bilers (6) - 1 freq dileas (6) - 1 freq bleusk (7) - 1 freq blibes (7) - 1 freq bodies (7) - 184 freq bodie's (7) - 7 freq dales (7) - 6 freq dills (7) - 1 freq doles (7) - 1 freq ciesx (7) - 1 freq idles (7) - 1 freq discs (7) - 3 freq bogles (7) - 23 freq bodies' (7) - 2 freq bedlaes (7) - 1 freq byles (7) - 5 freq alecs (7) - 1 freq bedlicht (7) - 1 freq builds (7) - 3 freq diels (7) - 2 freq |
SoundEx code - B342 buitless - 1 freq bottles - 115 freq boattles - 7 freq battles - 26 freq battle's - 3 freq battlestone - 3 freq battleships - 2 freq bad-lookin - 3 freq bottle-green - 2 freq bdilecsx - 1 freq bet-lick - 1 freq bottle's - 5 freq bad-lookin' - 1 freq boat-holes - 1 freq boot-legged - 1 freq beetles - 2 freq boatels - 1 freq beadle's - 1 freq bottils - 1 freq battailyies - 1 freq battlesang - 1 freq bothwell's - 25 freq bottoals - 1 freq bowdy-leggit - 1 freq bedlicht - 1 freq battleship - 3 freq bowdie-leggit - 1 freq body-like - 1 freq battels - 1 freq battle-axe - 1 freq bootleg - 1 freq boatles - 6 freq bad-luikin - 1 freq beatles - 1 freq €œbootless - 1 freq betelgeuse - 1 freq battilgrunds - 1 freq battleaxe - 1 freq bedlaes - 1 freq bottlesogreeb - 1 freq btls - 1 freq bottleÂ’s - 1 freq boattils - 1 freq |
MetaPhone code - BTLKSKS bdilecsx - 1 freq |
BDILECSX |
Time to execute Levenshtein function - 0.338933 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.611990 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.028118 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.071838 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.000921 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. |