| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wire-haired (0) - 1 freq white-haired (2) - 1 freq fair-haired (3) - 1 freq derk-haired (3) - 1 freq rid-haired (3) - 1 freq re-haimed (3) - 1 freq wird-huird (3) - 3 freq whyte-haired (3) - 1 freq wire-baned (3) - 1 freq re-naimed (4) - 1 freq rehaimed (4) - 1 freq short-haired (4) - 1 freq daark-haired (4) - 1 freq airn-hard (4) - 1 freq kirk-yaird (4) - 4 freq daurk-haired (4) - 2 freq flame-haired (4) - 1 freq blak-haired (4) - 1 freq diregaird (4) - 1 freq dee-haird (4) - 1 freq wine-stained (4) - 1 freq dirk-kaimed (4) - 2 freq white-harled (4) - 2 freq curly-haired (4) - 1 freq repaired (4) - 8 freq |
wire-haired (0) - 1 freq fair-haired (4) - 1 freq wird-huird (4) - 3 freq white-haired (4) - 1 freq wire-baned (5) - 1 freq derk-haired (5) - 1 freq whyte-haired (5) - 1 freq rid-haired (5) - 1 freq re-haimed (5) - 1 freq dee-haird (6) - 1 freq curly-haired (6) - 1 freq daurk-haired (6) - 2 freq ward-hoard (6) - 1 freq airn-hard (6) - 1 freq daark-haired (6) - 1 freq weel-lared (7) - 4 freq wreathed (7) - 5 freq wirried (7) - 6 freq weel-wared (7) - 2 freq withered (7) - 7 freq wire-trap (7) - 1 freq weel-faured (7) - 3 freq weil-lared (7) - 1 freq win-dried (7) - 1 freq weel-cared (7) - 1 freq |
SoundEx code - W663 wire-haired - 1 freq wearyourdamnmask - 1 freq |
MetaPhone code - WRHRT wire-haired - 1 freq |
WIRE-HAIRED |
| Time to execute Levenshtein function - 0.404106 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.700173 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.038483 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.078396 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.001106 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. |