| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| affcome (0) - 44 freq affcomes (1) - 3 freq affeome (1) - 1 freq affcums (2) - 2 freq affcum (2) - 3 freq affeomes (2) - 1 freq welcome (3) - 168 freq affo (3) - 5 freq weicome (3) - 1 freq afroe (3) - 1 freq alcove (3) - 4 freq affere (3) - 1 freq wylcome (3) - 2 freq 'come (3) - 73 freq offce (3) - 2 freq oercome (3) - 1 freq €œcome (3) - 32 freq €˜come (3) - 8 freq affroad (3) - 1 freq affoord (3) - 1 freq aftime (3) - 4 freq ofcom (3) - 5 freq affside (3) - 4 freq upcome (3) - 2 freq baecome (3) - 6 freq |
affcome (0) - 44 freq affeome (2) - 1 freq affcomes (2) - 3 freq affcum (2) - 3 freq affcums (3) - 2 freq fifacom (4) - 3 freq ofcom (4) - 5 freq offce (4) - 2 freq affeomes (4) - 1 freq walcome (5) - 74 freq aflame (5) - 4 freq affie (5) - 6 freq affline (5) - 2 freq come (5) - 3162 freq fusome (5) - 1 freq outcome (5) - 4 freq income (5) - 16 freq become (5) - 197 freq affable (5) - 1 freq affect (5) - 10 freq oaffice (5) - 8 freq affeck (5) - 7 freq offiece (5) - 3 freq offece (5) - 1 freq on-come (5) - 1 freq |
SoundEx code - A125 absence - 20 freq affcome - 44 freq absent-mindit - 1 freq aff-chance - 1 freq abusin - 4 freq absenters - 1 freq absent - 12 freq absentin - 1 freq ayafuckinbasturt - 1 freq a-pechin - 1 freq afghanistan - 4 freq absconded - 1 freq aficionado - 1 freq a-fuckin-head - 1 freq affcums - 2 freq affcum - 3 freq aveisement - 4 freq avysins - 1 freq affgang - 1 freq avizandum - 1 freq aipsan - 1 freq affgaun - 1 freq affcomes - 3 freq aff-centre - 1 freq afghan - 1 freq absentee - 1 freq affgaeng - 1 freq a-beggin - 2 freq abusing - 1 freq absently-mindedly - 1 freq abscondit - 1 freq €œabsence - 1 freq aficionados - 1 freq afchymnsheet - 1 freq ahfqim - 1 freq afcmaybury - 2 freq afcminers - 3 freq afcsandys - 2 freq absense - 1 freq absenses - 1 freq |
MetaPhone code - AFKM affcome - 44 freq affcum - 3 freq ahfqim - 1 freq |
AFFCOME |
| Time to execute Levenshtein function - 0.178171 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.340263 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.028698 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.039920 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.000891 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. |