| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yankies (0) - 1 freq yankie (1) - 3 freq hankies (1) - 3 freq yakies (1) - 1 freq dandies (2) - 15 freq gansies (2) - 3 freq mackies (2) - 4 freq yankin (2) - 4 freq bankie (2) - 2 freq jandies (2) - 1 freq rankles (2) - 2 freq talkies (2) - 1 freq yankit (2) - 1 freq nancies (2) - 1 freq jakies (2) - 2 freq hannies (2) - 3 freq ganzies (2) - 4 freq pinkies (2) - 3 freq mannies (2) - 32 freq tinkies (2) - 2 freq baukies (2) - 2 freq yarries (2) - 1 freq darkies (2) - 2 freq mankiest (2) - 1 freq bankins (2) - 2 freq |
yankies (0) - 1 freq yanks (2) - 13 freq yakies (2) - 1 freq yankie (2) - 3 freq hankies (2) - 3 freq dunkies (3) - 1 freq pinkies (3) - 3 freq hunkies (3) - 3 freq yorkies (3) - 1 freq cakies (3) - 1 freq yanked (3) - 6 freq yankee (3) - 7 freq baukies (3) - 2 freq tinkies (3) - 2 freq yonks (3) - 6 freq dinkies (3) - 1 freq annies (3) - 1 freq alkies (3) - 4 freq yankin (3) - 4 freq junkies (3) - 9 freq nikies (3) - 1 freq yankit (3) - 1 freq ankles (3) - 24 freq jakies (3) - 2 freq meukies (4) - 1 freq |
SoundEx code - Y522 youngest - 34 freq youngest's - 1 freq yankies - 1 freq younngest - 1 freq yungest - 3 freq yingess - 1 freq yingist - 1 freq yingest - 2 freq ynjegav - 1 freq ymsuxm - 1 freq ynyqjicewz - 1 freq |
MetaPhone code - YNKS yanks - 13 freq yankies - 1 freq yonks - 6 freq yangzi - 1 freq |
YANKIES |
| Time to execute Levenshtein function - 0.245075 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.379975 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.034322 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.041000 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.000897 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. |