| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wrjygglxem (0) - 1 freq wriggled (4) - 6 freq wriggles (4) - 1 freq wriggle (4) - 3 freq wriggling (5) - 1 freq juggles (5) - 1 freq njuggle (5) - 1 freq waggles (5) - 1 freq wrigglit (5) - 2 freq priggle (5) - 1 freq wrigglin (5) - 5 freq weggles (5) - 1 freq jiggles (5) - 2 freq wiggled (5) - 3 freq joggled (5) - 1 freq dreggled (5) - 2 freq waggled (5) - 2 freq wiggles (5) - 2 freq draggled (5) - 1 freq juggle (5) - 1 freq draiggled (5) - 2 freq wrigglan (5) - 1 freq raggle (5) - 207 freq shuggles (6) - 1 freq muggles (6) - 3 freq |
wrjygglxem (0) - 1 freq wriggles (7) - 1 freq wriggle (7) - 3 freq wriggled (7) - 6 freq wrigglan (8) - 1 freq wrigglin (8) - 5 freq wriggling (8) - 1 freq wrigglit (8) - 2 freq waggled (9) - 2 freq juggle (9) - 1 freq draggled (9) - 1 freq raggle (9) - 207 freq wriggilt (9) - 2 freq dreggled (9) - 2 freq draiggled (9) - 2 freq wiggles (9) - 2 freq waggles (9) - 1 freq juggles (9) - 1 freq joggled (9) - 1 freq njuggle (9) - 1 freq priggle (9) - 1 freq weggles (9) - 1 freq wiggled (9) - 3 freq jiggles (9) - 2 freq wrigleys (10) - 1 freq |
SoundEx code - W622 wirkies - 1 freq wirricowes - 1 freq warkhoose - 2 freq worricows - 1 freq wershest - 1 freq wreckage - 4 freq warsaw's - 1 freq wirkwyse - 1 freq workies - 1 freq 'wirawjocktamsonsbairns' - 1 freq waorgujmd - 1 freq wrxag - 1 freq worsest - 1 freq worsestest - 1 freq wrujcizqw - 1 freq wrjygglxem - 1 freq wrgez - 1 freq |
MetaPhone code - RJKLKSM wrjygglxem - 1 freq |
WRJYGGLXEM |
| Time to execute Levenshtein function - 0.194636 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.392591 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.033959 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.039425 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.000919 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. |