| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lurchers (0) - 1 freq lurcher (1) - 1 freq lurches (1) - 2 freq lurcher's (1) - 1 freq clutchers (2) - 1 freq munchers (2) - 3 freq murthers (2) - 3 freq lunches (2) - 7 freq burghers (2) - 2 freq archers (2) - 1 freq dunchers (2) - 1 freq lurched (2) - 2 freq iurches (2) - 1 freq butchers (2) - 12 freq airchers (2) - 7 freq punches (3) - 5 freq butcher's (3) - 19 freq taichers (3) - 2 freq wunthers (3) - 1 freq hurchins (3) - 2 freq latches (3) - 2 freq gushers (3) - 1 freq marches (3) - 16 freq melchers (3) - 1 freq lockers (3) - 4 freq |
lurchers (0) - 1 freq lurches (2) - 2 freq lurcher's (2) - 1 freq lurcher (2) - 1 freq archers (3) - 1 freq airchers (3) - 7 freq butchers (4) - 12 freq leuchars (4) - 1 freq iurches (4) - 1 freq mairchers (4) - 4 freq lurched (4) - 2 freq munchers (4) - 3 freq clutchers (4) - 1 freq lunches (4) - 7 freq murthers (4) - 3 freq burghers (4) - 2 freq dunchers (4) - 1 freq lancers (5) - 4 freq torches (5) - 14 freq leeches (5) - 4 freq lethers (5) - 1 freq techers (5) - 1 freq perches (5) - 2 freq launches (5) - 5 freq larners (5) - 10 freq |
SoundEx code - L626 lurcher - 1 freq lairger - 10 freq lurchers - 1 freq lurcher's - 1 freq largoward - 1 freq larger - 3 freq lorcrazycatlady - 150 freq |
MetaPhone code - LRXRS lurchers - 1 freq lurcher's - 1 freq |
LURCHERS |
| Time to execute Levenshtein function - 0.203991 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.382251 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.027897 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.038274 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.000930 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. |