| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| younkers (0) - 9 freq youngers (1) - 1 freq younker (1) - 3 freq founders (2) - 1 freq doukers (2) - 1 freq sounders (2) - 2 freq yolkers (2) - 1 freq hunkers (2) - 11 freq pounders (2) - 2 freq loungers (2) - 2 freq bonkers (2) - 5 freq bunkers (2) - 12 freq bouncers (2) - 5 freq conkers (2) - 3 freq younger (2) - 125 freq plunkers (2) - 1 freq spankers (3) - 2 freq yonner (3) - 67 freq porkers (3) - 2 freq whuskers (3) - 12 freq bunker' (3) - 1 freq yerkers (3) - 2 freq coonters (3) - 1 freq punders (3) - 2 freq gauners (3) - 1 freq |
younkers (0) - 9 freq youngers (2) - 1 freq younker (2) - 3 freq bonkers (3) - 5 freq conkers (3) - 3 freq hunkers (3) - 11 freq nokers (3) - 1 freq bunkers (3) - 12 freq doukers (3) - 1 freq yolkers (3) - 1 freq hookers (4) - 2 freq tinkers (4) - 4 freq sookers (4) - 2 freq aunters (4) - 1 freq unkens (4) - 1 freq tankers (4) - 2 freq bankers (4) - 4 freq wankers (4) - 5 freq winkers (4) - 1 freq waukers (4) - 1 freq unker (4) - 4 freq yonks (4) - 6 freq jinkers (4) - 1 freq dookers (4) - 10 freq pounders (4) - 2 freq |
SoundEx code - Y526 younger - 125 freq yunger - 11 freq yinger - 2 freq younker - 3 freq youngir - 6 freq youngerself - 1 freq younkers - 9 freq young'r - 2 freq yungir - 5 freq youngers - 1 freq yin-soorce - 4 freq yin-servant - 1 freq youngr - 1 freq younakahara - 1 freq |
MetaPhone code - YNKRS younkers - 9 freq |
YOUNKERS |
| Time to execute Levenshtein function - 0.193700 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.365028 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.028915 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.038498 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.000994 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. |