| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whigmaleerie (0) - 15 freq whigmaleeries (1) - 12 freq whimperin (5) - 1 freq balmageerie (5) - 1 freq 'galerie (5) - 1 freq bumbaleerie (5) - 1 freq rigmarie (5) - 2 freq tapaleerie (5) - 1 freq imagerie (5) - 1 freq fykemaleeries (5) - 1 freq gallerie (5) - 1 freq eimagerie (5) - 1 freq shimmerin (6) - 12 freq cockieleerie (6) - 5 freq histeeria (6) - 1 freq 'galleri (6) - 2 freq cheerie (6) - 11 freq whurmungerin (6) - 1 freq whateer (6) - 2 freq whitaker (6) - 1 freq whimpering (6) - 1 freq gadderie (6) - 9 freq whimper (6) - 13 freq walterin (6) - 3 freq galleries (6) - 8 freq |
whigmaleerie (0) - 15 freq whigmaleeries (2) - 12 freq whimper (8) - 13 freq gallerie (8) - 1 freq rigmarie (8) - 2 freq himmler (8) - 1 freq whaler (8) - 1 freq 'galerie (8) - 1 freq whimperin (8) - 1 freq wheaselie (9) - 1 freq whilie (9) - 87 freq wheelie (9) - 13 freq whummlle (9) - 1 freq whillie (9) - 2 freq whareer (9) - 1 freq chimlie (9) - 1 freq wheeler (9) - 4 freq whirlie (9) - 2 freq chevalrie (9) - 1 freq whimplin (9) - 3 freq whammlet (9) - 1 freq whummlet (9) - 1 freq whammled (9) - 1 freq whammlin (9) - 1 freq whummlin (9) - 2 freq |
SoundEx code - W254 waesomely - 4 freq whigmaleeries - 12 freq whigmaleerie - 15 freq waesomelly - 1 freq waukmill's - 1 freq wegmüller - 2 freq wishmeluck - 1 freq |
MetaPhone code - WKMLR whigmaleerie - 15 freq wegmüller - 2 freq |
WHIGMALEERIE |
| Time to execute Levenshtein function - 0.483482 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.920069 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.088292 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.092539 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.001040 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. |