| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haillsale (0) - 1 freq haillie (3) - 8 freq hillside (3) - 15 freq hail-size (3) - 1 freq hale-sale (3) - 1 freq hailsome (3) - 3 freq ballsae (3) - 1 freq hailstane (3) - 1 freq haillsum (3) - 1 freq hassle (4) - 24 freq failliand (4) - 2 freq wholesale (4) - 2 freq pailace (4) - 8 freq hillman (4) - 3 freq willball (4) - 1 freq hailumlie (4) - 1 freq williame (4) - 1 freq shallae (4) - 9 freq pillae (4) - 12 freq hallaeen (4) - 12 freq hallabie (4) - 1 freq vailleant (4) - 2 freq hailly (4) - 8 freq hillswiek (4) - 1 freq thairlane (4) - 4 freq |
haillsale (0) - 1 freq hale-sale (4) - 1 freq haillsum (4) - 1 freq hillside (4) - 15 freq millisle (5) - 5 freq halls (5) - 13 freq hirlsel (5) - 1 freq haillie (5) - 8 freq hills (5) - 245 freq hail-size (5) - 1 freq huills (5) - 1 freq ballsae (5) - 1 freq haalls (5) - 1 freq hailsome (5) - 3 freq hellhole (5) - 2 freq hilltap (6) - 1 freq halse (6) - 1 freq hailsin (6) - 2 freq hallans (6) - 1 freq wallsie (6) - 1 freq haill (6) - 411 freq hailes (6) - 3 freq taills (6) - 2 freq hillary (6) - 1 freq willile (6) - 1 freq |
SoundEx code - H424 haliglen - 1 freq heeliegoleerie - 3 freq heiligoleirie - 1 freq hulk-like - 1 freq heeligoleerie - 3 freq heiligoleiries - 1 freq heiliegoleirie - 4 freq heeligoleery - 3 freq hale-sale - 1 freq haillsale - 1 freq |
MetaPhone code - HLSL hale-sale - 1 freq haillsale - 1 freq |
HAILLSALE |
| Time to execute Levenshtein function - 0.738866 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 - 1.077202 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.091046 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.097253 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.000848 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. |