| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| weeglet (0) - 1 freq weegle (1) - 1 freq geeglet (1) - 1 freq weegies (2) - 10 freq geegled (2) - 2 freq wee-et (2) - 1 freq wengle (2) - 1 freq weeet (2) - 1 freq weigle (2) - 1 freq weggles (2) - 1 freq eaglet (2) - 14 freq weegie (2) - 10 freq weesles (2) - 1 freq weeglin (2) - 2 freq weesht (3) - 11 freq jeelit (3) - 2 freq reechet (3) - 2 freq deedled (3) - 1 freq reeshlet (3) - 1 freq hagglet (3) - 2 freq jeegit (3) - 1 freq beagle (3) - 2 freq needet (3) - 2 freq waallet (3) - 1 freq weedlin (3) - 1 freq |
weeglet (0) - 1 freq geeglet (2) - 1 freq weegle (2) - 1 freq weigle (3) - 1 freq weeglin (3) - 2 freq eaglet (3) - 14 freq welt (4) - 2 freq wiegt (4) - 1 freq geelit (4) - 1 freq pglet (4) - 5 freq jooglet (4) - 1 freq waallet (4) - 1 freq weight (4) - 55 freq wheelt (4) - 5 freq taiglet (4) - 1 freq wallet (4) - 23 freq boglet (4) - 1 freq geelt (4) - 2 freq waelit (4) - 1 freq wielt (4) - 3 freq weeet (4) - 1 freq weggles (4) - 1 freq wengle (4) - 1 freq wee-et (4) - 1 freq weegies (4) - 10 freq |
SoundEx code - W243 wauchelt - 2 freq wiggled - 3 freq wachlet - 1 freq waxcloth - 2 freq wheechled - 1 freq wiggilt - 4 freq wiggult - 2 freq waggilt - 1 freq wiggle't - 1 freq whisselt - 1 freq whizzled - 3 freq wheezled - 1 freq whussilt - 1 freq waggled - 2 freq waggelt - 1 freq weeglet - 1 freq whusslet - 1 freq wsgltwbao - 1 freq whusslit - 1 freq |
MetaPhone code - WKLT wiggled - 3 freq wiggilt - 4 freq wiggult - 2 freq waggilt - 1 freq wiggle't - 1 freq waggled - 2 freq waggelt - 1 freq weeglet - 1 freq |
WEEGLET |
| Time to execute Levenshtein function - 0.248325 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.380341 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.027529 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.038941 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.001217 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. |