| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| backmen (0) - 1 freq packmen (1) - 2 freq back-en (1) - 15 freq packman (2) - 3 freq backtaen (2) - 1 freq bak-en (2) - 1 freq tacksmen (2) - 3 freq backin (2) - 41 freq backend (2) - 4 freq bakeen (2) - 2 freq lacken (2) - 1 freq baken (2) - 2 freq backie (2) - 19 freq blackeen (2) - 1 freq jackman (2) - 2 freq bocken (2) - 1 freq batmen (2) - 1 freq back-eyn (2) - 5 freq backet (2) - 8 freq back-end (2) - 9 freq tacken (2) - 2 freq barmen (2) - 1 freq backbeen (2) - 1 freq baaken (2) - 1 freq backed (2) - 27 freq |
backmen (0) - 1 freq back-en (2) - 15 freq packmen (2) - 2 freq backson (3) - 12 freq back-eyn (3) - 5 freq bocken (3) - 1 freq backbeen (3) - 1 freq jackman (3) - 2 freq backin (3) - 41 freq backtaen (3) - 1 freq packman (3) - 3 freq backies (4) - 5 freq becomin (4) - 45 freq blacken (4) - 3 freq bucklin (4) - 7 freq bracken (4) - 14 freq backhaan (4) - 1 freq backhaun (4) - 1 freq buckin (4) - 3 freq beckon (4) - 1 freq becumin (4) - 1 freq bockan (4) - 7 freq bankeen (4) - 1 freq backbone (4) - 1 freq becoman (4) - 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 - BKMN becomin - 45 freq becoman - 2 freq bycommon - 2 freq backmen - 1 freq becumin - 1 freq bukeman - 1 freq |
BACKMEN |
| Time to execute Levenshtein function - 0.255020 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.454612 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.031273 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.041986 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.001271 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. |