| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yarked (0) - 9 freq parked (1) - 38 freq yarned (1) - 2 freq marked (1) - 28 freq yanked (1) - 6 freq warked (1) - 23 freq narked (1) - 1 freq barked (1) - 9 freq yarket (1) - 3 freq yerked (1) - 2 freq yarken (1) - 2 freq irked (2) - 1 freq laked (2) - 1 freq wirked (2) - 35 freq yankee (2) - 7 freq armed (2) - 18 freq racked (2) - 5 freq barke (2) - 1 freq jacked (2) - 2 freq walked (2) - 280 freq caked (2) - 6 freq arsed (2) - 18 freq cared (2) - 32 freq market (2) - 51 freq garbed (2) - 3 freq |
yarked (0) - 9 freq yerked (1) - 2 freq yarket (2) - 3 freq irked (2) - 1 freq barked (2) - 9 freq raiked (2) - 5 freq raked (2) - 16 freq yarken (2) - 2 freq yarned (2) - 2 freq parked (2) - 38 freq narked (2) - 1 freq marked (2) - 28 freq warked (2) - 23 freq yanked (2) - 6 freq asked (3) - 498 freq pairked (3) - 1 freq taked (3) - 1 freq markd (3) - 1 freq rooked (3) - 1 freq rared (3) - 2 freq yark (3) - 8 freq yarkin (3) - 4 freq faiked (3) - 1 freq yard (3) - 43 freq wurked (3) - 6 freq |
SoundEx code - Y623 yerkit - 3 freq yarket - 3 freq yerked - 2 freq y'aricht - 2 freq yirkit - 1 freq yarked - 9 freq yarkit - 2 freq yirshit - 1 freq yourscotborders - 1 freq yyrgqtfkdd - 1 freq yorktaeinverness - 1 freq |
MetaPhone code - YRKT yerkit - 3 freq yarket - 3 freq yerked - 2 freq yirkit - 1 freq yarked - 9 freq yarkit - 2 freq |
YARKED |
| Time to execute Levenshtein function - 0.196801 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.343733 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.027200 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.037227 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.000880 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. |