Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
affcomes (0) - 3 freq affeomes (1) - 1 freq affcome (1) - 44 freq affcums (2) - 2 freq affeome (2) - 1 freq affirmed (3) - 2 freq welcomes (3) - 4 freq alcoves (3) - 1 freq comes (3) - 962 freq becomes (3) - 44 freq ootcomes (3) - 9 freq aftimes (3) - 11 freq walcomes (3) - 5 freq outcomes (3) - 2 freq affcum (3) - 3 freq upcomes (3) - 1 freq afttimes (3) - 2 freq incomes (3) - 1 freq alchies (4) - 1 freq approves (4) - 2 freq airches (4) - 12 freq daffies (4) - 4 freq acorss (4) - 9 freq focuses (4) - 2 freq overcomes (4) - 2 freq |
affcomes (0) - 3 freq affcums (2) - 2 freq affcome (2) - 44 freq affeomes (2) - 1 freq affcum (4) - 3 freq affeome (4) - 1 freq incomes (5) - 1 freq afttimes (5) - 2 freq upcomes (5) - 1 freq affecks (5) - 6 freq affects (5) - 10 freq outcomes (5) - 2 freq oaffices (5) - 2 freq offices (5) - 17 freq welcomes (5) - 4 freq walcomes (5) - 5 freq comes (5) - 962 freq affirmed (5) - 2 freq aftimes (5) - 11 freq becomes (5) - 44 freq ootcomes (5) - 9 freq facees (6) - 1 freq facies (6) - 1 freq offyshes (6) - 1 freq oot-comes (6) - 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 - AFKMS affcums - 2 freq affcomes - 3 freq |
AFFCOMES |
Time to execute Levenshtein function - 0.213804 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.697095 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.031432 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.080087 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.000887 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. |