| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| back-comin (0) - 1 freq back-rollin (3) - 1 freq hame-comin (3) - 3 freq back-lyin (3) - 1 freq hamecomin (4) - 11 freq hame-cumin (4) - 1 freq backgroon (4) - 1 freq bak-cum (4) - 1 freq back-brakin (4) - 1 freq back-stair (4) - 1 freq com-comin (4) - 1 freq bak-cam (4) - 1 freq backrooms (4) - 1 freq walcomin (4) - 4 freq becomin (4) - 45 freq backpackin (4) - 1 freq baak-gaein (4) - 2 freq balcomie (4) - 1 freq back-room (4) - 1 freq hame-combin (4) - 2 freq back-door (4) - 2 freq backlins-comin (4) - 2 freq backson (4) - 12 freq back-en (4) - 15 freq backroom (4) - 4 freq |
back-comin (0) - 1 freq back-lyin (5) - 1 freq com-comin (6) - 1 freq back-en (6) - 15 freq bak-cam (6) - 1 freq back-chat (6) - 1 freq back-room (6) - 1 freq backmen (6) - 1 freq bak-cum (6) - 1 freq back-rollin (6) - 1 freq hame-comin (6) - 3 freq back-eyn (6) - 5 freq backpackin (6) - 1 freq backson (7) - 12 freq backroom (7) - 4 freq back-bowed (7) - 1 freq beckonin (7) - 3 freq back-pouch (7) - 1 freq backlins-comin (7) - 2 freq backin (7) - 41 freq in-comin (7) - 1 freq back-brakin (7) - 1 freq backgroon (7) - 1 freq hame-cumin (7) - 1 freq back-door (7) - 2 freq |
SoundEx code - B255 beginnin - 70 freq becomin - 45 freq basement - 9 freq bazement - 1 freq back-comin - 1 freq beginning - 18 freq bogeyman - 2 freq becoming - 9 freq beckonin - 3 freq buchanan - 33 freq beginnin' - 1 freq beginnins - 6 freq beckoning - 1 freq baeginnin - 3 freq buchanan's - 5 freq begïnnin - 1 freq begennin - 6 freq boss-man - 2 freq becoman - 2 freq beginin - 15 freq bycommon - 2 freq beginnan - 11 freq begineen - 3 freq backmen - 1 freq becumin - 1 freq bukeman - 1 freq bosnian - 1 freq busman's - 1 freq buchanienews - 1 freq bigmonsterlove - 3 freq beginneen - 1 freq |
MetaPhone code - BKKMN back-comin - 1 freq |
BACK-COMIN |
| Time to execute Levenshtein function - 0.478207 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.790984 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.027982 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.037992 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.032278 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. |