| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jaswinder (0) - 1 freq asinder (2) - 1 freq passinjer (3) - 2 freq asunder (3) - 5 freq winder (3) - 112 freq sinder (3) - 13 freq balvinder (3) - 20 freq laidder (4) - 10 freq blinder (4) - 3 freq winders (4) - 3 freq gardiner (4) - 1 freq shunder (4) - 1 freq daander (4) - 1 freq a-dunder (4) - 1 freq pander (4) - 1 freq waander (4) - 5 freq scunder (4) - 1 freq shidder (4) - 3 freq sassenger (4) - 1 freq minder (4) - 4 freq spinner (4) - 1 freq awner (4) - 4 freq asunner (4) - 1 freq fainter (4) - 2 freq jawline (4) - 2 freq |
jaswinder (0) - 1 freq asinder (4) - 1 freq sinder (5) - 13 freq swaander (5) - 1 freq winder (5) - 112 freq asunder (5) - 5 freq sounder (6) - 2 freq windier (6) - 1 freq swanders (6) - 2 freq bystander (6) - 1 freq sunder (6) - 1 freq jskinnider (6) - 2 freq slender (6) - 9 freq wander (6) - 41 freq islander (6) - 1 freq sander (6) - 1 freq soonder (6) - 1 freq slander (6) - 3 freq wonder (6) - 140 freq wunder (6) - 26 freq sender (6) - 2 freq iskander (6) - 70 freq spunder (6) - 1 freq 'wonder (6) - 1 freq scunder (6) - 1 freq |
SoundEx code - J253 jack-in-the-boax - 1 freq jake-in-the - 1 freq jaggie-nettles - 2 freq jack-in-th-box - 1 freq jaswinder - 1 freq jismethen - 1 freq jacindaardern - 1 freq jacinda - 1 freq jackkennedy - 2 freq jasondalgliesh - 1 freq |
MetaPhone code - JSWNTR jaswinder - 1 freq |
JASWINDER |
| Time to execute Levenshtein function - 0.201664 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.359059 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.028733 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.037006 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.000894 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. |