| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| youngers (0) - 1 freq younger (1) - 125 freq loungers (1) - 2 freq younkers (1) - 9 freq pounders (2) - 2 freq dungers (2) - 3 freq tounge's (2) - 1 freq youngins (2) - 1 freq youngest (2) - 34 freq younker (2) - 3 freq counger (2) - 1 freq bouncers (2) - 5 freq coungert (2) - 1 freq foongers (2) - 1 freq youngeens (2) - 1 freq youngir (2) - 6 freq lounges (2) - 1 freq youngsters (2) - 20 freq young'r (2) - 2 freq founders (2) - 1 freq grungers (2) - 1 freq daungers (2) - 2 freq yunger (2) - 11 freq mongers (2) - 1 freq sounders (2) - 2 freq |
youngers (0) - 1 freq loungers (2) - 2 freq younkers (2) - 9 freq younger (2) - 125 freq foongers (3) - 1 freq youngeens (3) - 1 freq youngir (3) - 6 freq daungers (3) - 2 freq youngins (3) - 1 freq yunger (3) - 11 freq mongers (3) - 1 freq dungers (3) - 3 freq ungert (4) - 1 freq rogers (4) - 6 freq fingers (4) - 255 freq yingess (4) - 1 freq mangers (4) - 1 freq aunters (4) - 1 freq yinger (4) - 2 freq yungir (4) - 5 freq lingers (4) - 5 freq voyagers (4) - 1 freq reengers (4) - 2 freq mingers (4) - 1 freq feengers (4) - 1 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 - YNJRS youngers - 1 freq |
YOUNGERS |
| Time to execute Levenshtein function - 0.203210 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.365455 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.034188 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.037644 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.000890 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. |