| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| azbffk (0) - 1 freq bff (3) - 1 freq affo (3) - 5 freq abaak (3) - 1 freq aff- (3) - 1 freq anuff (3) - 28 freq afk (3) - 1 freq aback (3) - 41 freq afft (3) - 1 freq awffy (3) - 1 freq abfas (3) - 1 freq affs (3) - 4 freq a-back (3) - 1 freq affy (3) - 93 freq anoff (3) - 6 freq afffa (3) - 1 freq aff (3) - 4400 freq azbfszi (3) - 1 freq abak (3) - 1 freq amoffa (3) - 1 freq affa (3) - 933 freq bfk (3) - 1 freq aff' (3) - 1 freq fek (4) - 13 freq pufft (4) - 3 freq |
azbffk (0) - 1 freq azbfszi (5) - 1 freq bff (5) - 1 freq bfk (5) - 1 freq baffe (6) - 2 freq treffik (6) - 1 freq baff (6) - 3 freq boufft (6) - 1 freq baffy (6) - 3 freq bouff (6) - 1 freq rebuff (6) - 2 freq biffy (6) - 1 freq mffke (6) - 1 freq traffek (6) - 3 freq daffik (6) - 2 freq buff (6) - 15 freq zpffyt (6) - 1 freq oznfka (6) - 1 freq effek (6) - 4 freq bufft (6) - 1 freq buffs (6) - 4 freq biffo (6) - 2 freq traffik (6) - 1 freq awffy (6) - 1 freq afft (6) - 1 freq |
SoundEx code - A212 aspeck - 13 freq aspects - 24 freq aspect - 21 freq aesop's - 4 freq aspecks - 26 freq agivey's - 1 freq aesophagus - 1 freq auspices - 1 freq asbestos - 9 freq aissy-faced - 1 freq aesopic - 1 freq achieves - 1 freq acceps - 1 freq accepps - 1 freq aspekts - 1 freq aeyxfjl - 1 freq azbfszi - 1 freq aaxvihswu - 1 freq aeisfpcnst - 1 freq akvx - 1 freq azbffk - 1 freq ajvcnhvhjb - 1 freq aogkibkef - 1 freq akbvsdogc - 1 freq |
MetaPhone code - ASBFK azbffk - 1 freq |
AZBFFK |
| Time to execute Levenshtein function - 0.170220 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.339270 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.027445 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.037799 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.000931 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. |