| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harvey (0) - 5 freq garvey (1) - 1 freq harley (1) - 7 freq hargey (1) - 7 freq halve (2) - 1 freq haaver (2) - 4 freq harden (2) - 21 freq carey (2) - 2 freq haived (2) - 10 freq harem (2) - 1 freq lavey (2) - 2 freq harlem (2) - 1 freq partey (2) - 3 freq hardy (2) - 24 freq tarves (2) - 8 freq marvel (2) - 6 freq carve (2) - 5 freq hurley (2) - 2 freq harte (2) - 1 freq haiver (2) - 6 freq haivy (2) - 1 freq haiven (2) - 34 freq barley (2) - 33 freq harled (2) - 6 freq hayley (2) - 2 freq |
harvey (0) - 5 freq harvie (2) - 3 freq hargey (2) - 7 freq harley (2) - 7 freq garvey (2) - 1 freq harly (3) - 13 freq harray (3) - 3 freq havy (3) - 2 freq have (3) - 1251 freq sarve (3) - 10 freq harry (3) - 202 freq survey (3) - 33 freq heavey (3) - 1 freq hares (3) - 14 freq haeve (3) - 5 freq haevy (3) - 2 freq hared (3) - 1 freq hare (3) - 199 freq hrv (3) - 1 freq harse (3) - 1 freq harne (3) - 2 freq purvey (3) - 20 freq harte (3) - 1 freq hurley (3) - 2 freq carve (3) - 5 freq |
SoundEx code - H610 harp - 9 freq hairp - 5 freq hereby - 3 freq herb - 2 freq hairb - 1 freq harvey - 5 freq hrv - 1 freq her've - 1 freq harpa - 4 freq hairfaa - 1 freq hairpy - 1 freq herbie - 11 freq harvie - 3 freq hrf - 1 freq hraip - 1 freq hrp - 1 freq |
MetaPhone code - HRF harvey - 5 freq her've - 1 freq hairfaa - 1 freq harvie - 3 freq |
HARVEY |
| Time to execute Levenshtein function - 0.176294 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.389927 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.027104 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.039025 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.000888 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. |