Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
everson (0) - 3 freq everton (1) - 3 freq iverson (1) - 1 freq reversin (2) - 4 freq everyone (2) - 96 freq peterson (2) - 2 freq aversion (2) - 4 freq version (2) - 145 freq vernon (2) - 1 freq deveron (2) - 1 freq person (2) - 249 freq everwan (2) - 4 freq reversan (2) - 1 freq emmerson (2) - 1 freq everhin (2) - 1 freq iversson (2) - 1 freq henderson (3) - 48 freq every- (3) - 1 freq venison (3) - 2 freq treason (3) - 14 freq hermon (3) - 1 freq versy (3) - 1 freq lesson (3) - 108 freq avertin (3) - 1 freq perversion (3) - 1 freq |
everson (0) - 3 freq iverson (1) - 1 freq version (2) - 145 freq aversion (2) - 4 freq everton (2) - 3 freq reversan (3) - 1 freq everhin (3) - 1 freq overseen (3) - 1 freq iversson (3) - 1 freq versioun (3) - 1 freq everwan (3) - 4 freq person (3) - 249 freq reversin (3) - 4 freq everyone (3) - 96 freq vernon (3) - 1 freq garson (4) - 2 freq versa (4) - 4 freq vergin (4) - 2 freq veision (4) - 2 freq oversee (4) - 1 freq carson (4) - 1 freq pearson (4) - 6 freq everyeen (4) - 4 freq versed (4) - 4 freq averse (4) - 6 freq |
SoundEx code - E162 everycunt - 18 freq ee-broos - 4 freq everycunt's - 4 freq eyebrows - 12 freq eebroos - 20 freq e-braes - 1 freq euphoric - 3 freq eyebroos - 6 freq evergreen - 6 freq everest - 1 freq everson - 3 freq evergreens - 1 freq eebrous - 3 freq e'ebroos - 1 freq ever-changin - 1 freq effairs - 3 freq efricans - 1 freq effeirs - 13 freq ever-supply - 1 freq euphirsspn - 1 freq e-freaking-gress - 1 freq |
MetaPhone code - EFRSN everson - 3 freq |
EVERSON |
Time to execute Levenshtein function - 0.217815 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.355818 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.029077 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.038618 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.000933 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. |