| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| empien (0) - 1 freq empied (1) - 3 freq empie (1) - 25 freq empire (2) - 82 freq mien (2) - 3 freq kempie (2) - 1 freq hempie (2) - 2 freq empties (2) - 6 freq emptiet (2) - 1 freq emptie (2) - 1 freq hempies (2) - 2 freq empires (2) - 8 freq emptied (2) - 20 freq tempin (2) - 4 freq kempin (2) - 5 freq empire' (2) - 1 freq eien (2) - 1 freq easin (3) - 11 freq gappen (3) - 2 freq easier (3) - 114 freq een (3) - 2862 freq damien (3) - 2 freq jemmie (3) - 4 freq epple (3) - 13 freq open (3) - 735 freq |
empien (0) - 1 freq empie (2) - 25 freq empied (2) - 3 freq tempin (3) - 4 freq emptie (3) - 1 freq kempin (3) - 5 freq mien (3) - 3 freq empire (3) - 82 freq mopin (3) - 1 freq speen (4) - 17 freq peepin (4) - 6 freq lopin (4) - 1 freq dumpin (4) - 5 freq papin (4) - 2 freq alpin (4) - 7 freq empooer (4) - 2 freq spiein (4) - 1 freq heapin (4) - 2 freq amin (4) - 1 freq humpin (4) - 1 freq oppin (4) - 4 freq keepen (4) - 1 freq heypen (4) - 3 freq mein (4) - 2 freq campin (4) - 4 freq |
SoundEx code - E515 embankments - 1 freq empie-hannit - 2 freq enfants - 1 freq embawmed - 1 freq enfante - 1 freq empien - 1 freq envionment - 1 freq enfondre - 1 freq emboiain - 2 freq |
MetaPhone code - EMPN empien - 1 freq |
EMPIEN |
| Time to execute Levenshtein function - 0.615597 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.980402 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.088206 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.104163 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.001007 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. |