| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aff-fawins (0) - 2 freq aff-blawin (3) - 1 freq afftakins (3) - 1 freq affafine (4) - 1 freq guffawing (4) - 1 freq aff-drawn (4) - 1 freq aff-limits (4) - 2 freq aff-takkin (4) - 1 freq aff-han (4) - 1 freq aff-haund (4) - 2 freq offerains (4) - 1 freq affairs (4) - 42 freq africans (5) - 1 freq affairs' (5) - 1 freq hafflins (5) - 1 freq affhan (5) - 1 freq puffins (5) - 5 freq afftaks (5) - 1 freq awfferin (5) - 1 freq fawin' (5) - 1 freq affens (5) - 8 freq air-raids (5) - 2 freq re-twins (5) - 1 freq affspreing (5) - 1 freq affraid (5) - 1 freq |
aff-fawins (0) - 2 freq afftakins (6) - 1 freq aff-blawin (6) - 1 freq aff-han (7) - 1 freq aff-haund (7) - 2 freq aff-limits (7) - 2 freq offerains (7) - 1 freq guffawing (7) - 1 freq affafine (7) - 1 freq aff-drawn (7) - 1 freq sauffins (8) - 1 freq oafferins (8) - 1 freq aff-white (8) - 1 freq eff-in (8) - 1 freq affections (8) - 2 freq affirmations (8) - 1 freq re-twins (8) - 1 freq affiliations (8) - 1 freq offerins (8) - 5 freq hauf-wits (8) - 1 freq daffins (8) - 1 freq guffaws (8) - 2 freq coffins (8) - 6 freq puffins (8) - 5 freq hafflins (8) - 1 freq |
SoundEx code - A152 apens - 7 freq abeyance - 1 freq avenge - 11 freq avenues - 5 freq affeomes - 1 freq appens - 5 freq apenness - 2 freq affens - 8 freq avengit - 2 freq avenged - 3 freq avengin - 1 freq avenger - 1 freq abins - 1 freq aff-fawins - 2 freq avengers - 2 freq appunct - 1 freq appense - 1 freq afens - 2 freq appen-access - 1 freq |
MetaPhone code - AFFWNS aff-fawins - 2 freq |
AFF-FAWINS |
| Time to execute Levenshtein function - 0.289175 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.527750 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.062352 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.038991 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.000892 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. |