| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| afxq (0) - 1 freq cfoq (2) - 1 freq faq (2) - 1 freq afa (2) - 12 freq axt (2) - 112 freq xq (2) - 2 freq ayxz (2) - 1 freq afu (2) - 3 freq xuxq (2) - 1 freq afo (2) - 4 freq af't (2) - 1 freq aff' (2) - 1 freq afil (2) - 1 freq abxr (2) - 1 freq fx (2) - 4 freq anq (2) - 2 freq afgg (2) - 1 freq afer (2) - 1 freq afar (2) - 10 freq anxi (2) - 4 freq aq (2) - 2 freq affy (2) - 93 freq aff (2) - 4400 freq affa (2) - 933 freq aff- (2) - 1 freq |
afxq (0) - 1 freq xuxq (3) - 1 freq fxc (3) - 1 freq fiq (3) - 1 freq lxq (3) - 1 freq fx (3) - 4 freq fq (3) - 3 freq xq (3) - 2 freq fmq (3) - 1 freq faq (3) - 1 freq axd (4) - 1 freq afta (4) - 1 freq nfxt (4) - 1 freq affs (4) - 4 freq afpe (4) - 1 freq aox (4) - 1 freq afc (4) - 27 freq nfxo (4) - 1 freq aix (4) - 42 freq hrxq (4) - 1 freq afft (4) - 1 freq axe (4) - 22 freq assq (4) - 1 freq fxkqu (4) - 1 freq fnqy (4) - 1 freq |
SoundEx code - A120 apiece - 9 freq a-piece - 5 freq aback - 41 freq abeich - 6 freq abyss - 11 freq abuse - 46 freq apps - 5 freq aboose - 1 freq aps - 1 freq apache - 2 freq apes - 4 freq appease - 8 freq abc - 2 freq abbeys - 3 freq affs - 4 freq a-big - 1 freq abijah - 5 freq avs - 1 freq abak' - 1 freq affeck - 7 freq abc's - 1 freq abase - 1 freq avyse - 4 freq abies - 3 freq afyoag - 1 freq apaece - 3 freq a-paece - 1 freq absie - 1 freq abbacee - 1 freq abaak - 1 freq abiech - 3 freq affecks - 6 freq abiz - 1 freq abuise - 3 freq afk - 1 freq affix - 1 freq avise - 1 freq a-back - 1 freq avec - 1 freq abby's - 1 freq abak - 1 freq ah-bay-say - 1 freq ab's - 1 freq apace - 1 freq apees - 1 freq apex - 1 freq abg - 1 freq apvqo - 1 freq afc - 27 freq abz - 17 freq afgg - 1 freq avk - 10 freq aabaq - 2 freq afxq - 1 freq avows - 1 freq abs - 1 freq apg - 1 freq abfas - 1 freq aibagawa - 3 freq apyc - 1 freq aupk - 1 freq |
MetaPhone code - AFKSK afxq - 1 freq |
AFXQ |
| Time to execute Levenshtein function - 0.229543 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.394782 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.027919 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.046383 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.001016 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. |