| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yarket (0) - 3 freq yarkit (1) - 2 freq carket (1) - 1 freq market (1) - 51 freq yarked (1) - 9 freq yarken (1) - 2 freq parket (1) - 3 freq warker (2) - 7 freq warkit (2) - 23 freq rakket (2) - 1 freq paket (2) - 1 freq garret (2) - 4 freq yanked (2) - 6 freq asket (2) - 1 freq gasket (2) - 2 freq parken (2) - 1 freq basket (2) - 62 freq yarder (2) - 1 freq yorker (2) - 1 freq marker (2) - 11 freq jarcket (2) - 1 freq harken (2) - 7 freq barmet (2) - 1 freq hacket (2) - 1 freq parkes (2) - 2 freq |
yarket (0) - 3 freq yarkit (1) - 2 freq parket (2) - 3 freq yerkit (2) - 3 freq yirkit (2) - 1 freq yarken (2) - 2 freq carket (2) - 1 freq yarked (2) - 9 freq market (2) - 51 freq parkit (3) - 13 freq waaket (3) - 1 freq jaiket (3) - 105 freq jerket (3) - 1 freq jayket (3) - 12 freq warkt (3) - 11 freq yerked (3) - 2 freq racket (3) - 25 freq yakkit (3) - 2 freq parkt (3) - 1 freq raikit (3) - 12 freq yarkin (3) - 4 freq harkit (3) - 10 freq markit (3) - 18 freq worket (3) - 3 freq merket (3) - 7 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 |
YARKET |
| Time to execute Levenshtein function - 0.258893 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.368991 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.038526 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.065912 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.001060 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. |