| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| weinstein (0) - 1 freq einstein (1) - 7 freq western (3) - 30 freq whistlin (3) - 22 freq whingein (3) - 5 freq winterin (3) - 1 freq weenstip (3) - 1 freq winston (3) - 3 freq tweistin (3) - 1 freq waistin (3) - 1 freq westlin (3) - 3 freq eightein (3) - 1 freq reistin (3) - 1 freq wintin (3) - 52 freq heidsteen (3) - 5 freq insteid (3) - 318 freq leisten (3) - 3 freq deistin (3) - 3 freq peintin (3) - 5 freq weillbein (3) - 1 freq leistenin (3) - 1 freq heistin (3) - 1 freq neisten (3) - 1 freq faisten (4) - 1 freq winkin (4) - 16 freq |
weinstein (0) - 1 freq einstein (2) - 7 freq winston (3) - 3 freq wintin (4) - 52 freq neisten (4) - 1 freq weenstip (4) - 1 freq waistin (4) - 1 freq sneistin (5) - 1 freq wanten (5) - 1 freq nestin (5) - 3 freq wuntin (5) - 9 freq waantin (5) - 38 freq wastin (5) - 32 freq 'winston (5) - 1 freq wystin (5) - 2 freq beanston (5) - 1 freq wantin (5) - 326 freq wintoun (5) - 5 freq wauntin (5) - 2 freq heistin (5) - 1 freq weston (5) - 7 freq westlin (5) - 3 freq winterin (5) - 1 freq gainstaun (5) - 1 freq western (5) - 30 freq |
SoundEx code - W523 wanst - 32 freq whanged - 1 freq wheenged - 1 freq winked - 12 freq winkt - 2 freq wneist - 1 freq wingit - 4 freq wine-stained - 1 freq wanced - 3 freq winged - 5 freq weinstein - 1 freq winkit - 11 freq winston - 3 freq wame-stappin - 1 freq 'winston - 1 freq winceyette - 1 freq wan-sided - 2 freq weenstip - 1 freq whingit - 1 freq winched - 4 freq weenged - 1 freq wansdays - 1 freq wainscots - 1 freq winced - 2 freq wanc't - 1 freq wance't - 3 freq wingsscotland - 4 freq wnkdqi - 1 freq whingytoddlers - 1 freq |
MetaPhone code - WNSTN weinstein - 1 freq winston - 3 freq 'winston - 1 freq |
WEINSTEIN |
| Time to execute Levenshtein function - 0.196390 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.368515 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.027688 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.039791 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.001234 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. |