| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yorker (0) - 1 freq yerker (1) - 1 freq worker (1) - 24 freq docker (2) - 4 freq horter (2) - 1 freq yarket (2) - 3 freq worked (2) - 149 freq wirker (2) - 5 freq looker (2) - 8 freq yokey (2) - 2 freq yonkee (2) - 1 freq york (2) - 25 freq parker (2) - 19 freq workers (2) - 34 freq conker (2) - 1 freq yolkers (2) - 1 freq yerkers (2) - 2 freq younker (2) - 3 freq yonder (2) - 67 freq yocked (2) - 1 freq locker (2) - 3 freq cocker (2) - 1 freq joker (2) - 7 freq powker (2) - 5 freq orrer (2) - 1 freq |
yorker (0) - 1 freq yerker (1) - 1 freq worker (2) - 24 freq marker (3) - 11 freq warker (3) - 7 freq werker (3) - 2 freq hoker (3) - 1 freq yorkies (3) - 1 freq joaker (3) - 1 freq derker (3) - 7 freq barker (3) - 1 freq jouker (3) - 2 freq cooker (3) - 21 freq raker (3) - 2 freq birker (3) - 1 freq yarder (3) - 1 freq yarked (3) - 9 freq sooker (3) - 2 freq rocker (3) - 3 freq order (3) - 277 freq darker (3) - 9 freq yerked (3) - 2 freq burker (3) - 2 freq yorkie (3) - 5 freq merker (3) - 6 freq |
SoundEx code - Y626 yorker - 1 freq yerkers - 2 freq yorkshire - 24 freq yorkshireness - 1 freq yorkshireman - 1 freq yerker - 1 freq |
MetaPhone code - YRKR yorker - 1 freq yerker - 1 freq |
YORKER |
| Time to execute Levenshtein function - 0.215919 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.402296 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.030636 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.040711 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.001229 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. |