| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gladrags (0) - 1 freq garages (3) - 5 freq largs (3) - 4 freq gairage (3) - 6 freq glaur's (3) - 1 freq lauras (3) - 4 freq drags (3) - 8 freq laura's (3) - 6 freq glaran (3) - 2 freq garage (3) - 56 freq plaags (3) - 1 freq madras (3) - 1 freq ladrons (3) - 1 freq gladness (3) - 1 freq glares (3) - 7 freq gladys (3) - 4 freq lairgs (3) - 2 freq glaurs (3) - 1 freq teardraps (4) - 1 freq flair's (4) - 3 freq barrage (4) - 2 freq glasgw (4) - 1 freq laddies (4) - 196 freq gyads (4) - 2 freq sara's (4) - 1 freq |
gladrags (0) - 1 freq glares (5) - 7 freq gladness (5) - 1 freq gladys (5) - 4 freq glaurs (5) - 1 freq gliders (5) - 2 freq ladrons (5) - 1 freq lairgs (5) - 2 freq glaur's (5) - 1 freq largs (5) - 4 freq drags (5) - 8 freq garages (5) - 5 freq gleers (6) - 1 freq gleds (6) - 2 freq gadders (6) - 4 freq 'drugs (6) - 1 freq ledars (6) - 1 freq gled's (6) - 1 freq glidders (6) - 2 freq gluiders (6) - 1 freq gulders (6) - 6 freq gadgies (6) - 28 freq drugs (6) - 56 freq glides (6) - 5 freq golders (6) - 3 freq |
SoundEx code - G436 glitter - 23 freq gluiders - 1 freq glitterin - 4 freq glittery - 13 freq gleeterin - 1 freq gildro - 1 freq glittert - 1 freq gluthery - 1 freq gulderin - 9 freq glitters - 3 freq gold-rimmed - 1 freq guldert - 13 freq gulders - 6 freq gull-threap - 1 freq gulder - 24 freq guldered - 10 freq guldért - 1 freq guldèrt - 2 freq guldèr - 1 freq gaelderan - 1 freq golder - 1 freq golders - 3 freq goldereen's - 1 freq glittur - 1 freq gledder - 3 freq gulderin-wild - 1 freq 'glitterie - 1 freq glouter - 1 freq gilderoy - 2 freq glittered - 1 freq glidders - 2 freq gliders - 2 freq glitteran - 1 freq gladrags - 1 freq guilt-drenched - 1 freq gloutered - 1 freq guldering - 2 freq guelders - 1 freq gildernewm - 1 freq gilldurham - 5 freq |
MetaPhone code - KLTRKS gladrags - 1 freq |
GLADRAGS |
| Time to execute Levenshtein function - 0.348264 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.488679 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.028234 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.037148 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.000959 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. |