Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
eeeeeeeee (0) - 1 freq peeeeeeee (1) - 2 freq weeeeeeee (1) - 1 freq eeeeeeeeee (1) - 1 freq eeeeeeee (1) - 1 freq eeeeeee (2) - 1 freq peeeeeee (2) - 1 freq heeeeeee (2) - 1 freq meeeeeeeeee (2) - 1 freq weeeeeeee” (3) - 1 freq cheeeeese (3) - 1 freq €˜peeeeeeee (3) - 1 freq breeeeeek (3) - 1 freq beeeeeeeepp (3) - 1 freq owieeeeee (3) - 1 freq peeeeee (3) - 2 freq yipeeeeeee (3) - 1 freq reeseeved (4) - 1 freq teeeeeam (4) - 1 freq peeeee (4) - 2 freq exerceese (4) - 4 freq eeleeven (4) - 1 freq weeeee (4) - 1 freq keeeeebzy (4) - 2 freq pleeeeeease (4) - 1 freq |
eeeeeeeee (0) - 1 freq eeeeeeee (1) - 1 freq eeeeeeeeee (1) - 1 freq peeeeeeee (2) - 2 freq eeeeeee (2) - 1 freq weeeeeeee (2) - 1 freq heeeeeee (3) - 1 freq meeeeeeeeee (3) - 1 freq peeeeeee (3) - 1 freq owieeeeee (4) - 1 freq peeeeee (4) - 2 freq yipeeeeeee (4) - 1 freq oweeeee (5) - 1 freq meeeee (5) - 1 freq eeeeek (5) - 1 freq weeeee (5) - 1 freq peeeee (5) - 2 freq yippeeeeeeeee (6) - 1 freq byeeee (6) - 1 freq eee (6) - 3 freq yeee (6) - 1 freq oweeee (6) - 1 freq eesee (6) - 3 freq eeeze (6) - 1 freq heeee (6) - 1 freq |
SoundEx code - E000 eh - 1202 freq ee - 1592 freq e - 4634 freq 'ee - 6 freq ee' - 4 freq eo - 6 freq eye - 237 freq eh- - 1 freq ehh - 1 freq ey - 141 freq 'eh - 21 freq 'e - 63 freq eaa - 1 freq 'eehh - 1 freq ew - 5 freq eih - 51 freq eee - 3 freq e'e - 20 freq e' - 89 freq ehhh - 2 freq ewe - 3 freq eu - 126 freq ei - 102 freq ee-aw - 1 freq '-e - 1 freq ée - 1 freq e- - 1 freq ƒe - 1 freq 'ee' - 1 freq þe - 4 freq 'ea' - 1 freq ''e - 1 freq 'ee-o' - 1 freq €™e - 16 freq €˜eh - 15 freq ea - 4 freq ðe - 4 freq 'ey - 1 freq €˜e - 12 freq €˜ee - 1 freq ei- - 1 freq €œeh - 10 freq eeeeeee - 1 freq eeeeeeeee - 1 freq eeeeeeeeee - 1 freq eeeeeeee - 1 freq €œee - 1 freq ¡e - 1 freq €™eh - 1 freq ‘e - 4 freq eh' - 1 freq eÂ’ - 8 freq euy - 1 freq “eh - 1 freq eau - 2 freq e'' - 1 freq eeh - 1 freq ewwwww - 1 freq eea - 1 freq ewoh - 1 freq eew - 1 freq eah - 1 freq ‘eÂ’ - 1 freq |
MetaPhone code - E eh - 1202 freq ae - 5555 freq ee - 1592 freq e - 4634 freq 'ee - 6 freq ee' - 4 freq eo - 6 freq aea - 1 freq eh- - 1 freq ehh - 1 freq ey - 141 freq 'ae - 83 freq 'eh - 21 freq 'e - 63 freq eaa - 1 freq 'eehh - 1 freq ew - 5 freq eih - 51 freq eee - 3 freq ae' - 1 freq e'e - 20 freq e' - 89 freq ehhh - 2 freq eu - 126 freq ei - 102 freq ee-aw - 1 freq '-e - 1 freq ée - 1 freq e- - 1 freq ƒe - 1 freq 'ee' - 1 freq þe - 4 freq 'ea' - 1 freq 'ae' - 1 freq ''e - 1 freq 'ee-o' - 1 freq €™e - 16 freq €˜eh - 15 freq ea - 4 freq ðe - 4 freq 'ey - 1 freq €˜e - 12 freq €˜ee - 1 freq ei- - 1 freq €œeh - 10 freq €™ae - 12 freq eeeeeee - 1 freq eeeeeeeee - 1 freq eeeeeeeeee - 1 freq eeeeeeee - 1 freq €œae - 4 freq €˜-ae - 1 freq €˜ae - 2 freq €œee - 1 freq ¡e - 1 freq €™eh - 1 freq aeaw - 1 freq ‘e - 4 freq eh' - 1 freq eÂ’ - 8 freq euy - 1 freq aey - 4 freq “eh - 1 freq eau - 2 freq e'' - 1 freq eeh - 1 freq ewwwww - 1 freq eea - 1 freq ýae - 1 freq eew - 1 freq eah - 1 freq ‘eÂ’ - 1 freq |
EEEEEEEEE |
Time to execute Levenshtein function - 0.193788 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.360430 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.027566 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.039608 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.000932 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. |