| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| affspring (0) - 5 freq affspreing (1) - 1 freq offspring (1) - 5 freq 'spring (3) - 1 freq affecting (3) - 8 freq bedspring (3) - 1 freq offering (3) - 8 freq affeirin (3) - 1 freq spring (3) - 262 freq asprin (3) - 1 freq dayspring (3) - 1 freq aspiring (3) - 1 freq differing (4) - 2 freq fusperin (4) - 1 freq affectin (4) - 1 freq whispering (4) - 5 freq effeirin (4) - 31 freq admiring (4) - 2 freq gasping (4) - 2 freq airing (4) - 1 freq waffing (4) - 1 freq sprint (4) - 8 freq offerin' (4) - 2 freq affirmin (4) - 2 freq ensuring (4) - 2 freq |
affspring (0) - 5 freq offspring (1) - 5 freq affspreing (1) - 1 freq spring (5) - 262 freq aspiring (5) - 1 freq dayspring (5) - 1 freq offering (5) - 8 freq 'spring (5) - 1 freq bedspring (5) - 1 freq inspiring (6) - 1 freq whispering (6) - 5 freq spreng (6) - 1 freq sparing (6) - 2 freq springy (6) - 6 freq sprung (6) - 21 freq affeirin (6) - 1 freq asprin (6) - 1 freq sprang (6) - 17 freq fusperin (6) - 1 freq affecting (6) - 8 freq speiring (7) - 1 freq string (7) - 70 freq flipping (7) - 1 freq festing (7) - 1 freq affgaeng (7) - 1 freq |
SoundEx code - A121 abusive - 8 freq apkeep - 5 freq affspreing - 1 freq affspring - 5 freq abcqjwfzlg - 1 freq afckev - 1 freq ahpsv - 1 freq abzpodcast - 63 freq afcformerplayer - 2 freq absby - 1 freq aopgayb - 1 freq absofuckinlutely - 1 freq avosfrommexico - 1 freq afcfyldeacademy - 1 freq avfcofficial - 2 freq |
MetaPhone code - AFSPRNK affspreing - 1 freq affspring - 5 freq |
AFFSPRING |
| Time to execute Levenshtein function - 0.181871 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.344403 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.028776 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.038272 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.000856 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. |