Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
glowerin (0) - 61 freq gloweran (1) - 3 freq glowerit (1) - 3 freq lowerin (1) - 12 freq glowering (1) - 1 freq gowerin (1) - 1 freq gloweren (1) - 1 freq giowerin (1) - 1 freq glowrin (1) - 6 freq lowering (2) - 2 freq glowers (2) - 9 freq flooerin (2) - 4 freq lowerit (2) - 1 freq growein (2) - 42 freq glourin (2) - 1 freq lowein (2) - 1 freq lowderin (2) - 1 freq plowterin (2) - 10 freq glowered (2) - 98 freq showerin (2) - 1 freq gleerin (2) - 1 freq glowin (2) - 33 freq flowein (2) - 1 freq glowert (2) - 21 freq powerin (2) - 3 freq |
glowerin (0) - 61 freq glowrin (1) - 6 freq gloweran (1) - 3 freq gloweren (1) - 1 freq gowerin (2) - 1 freq giowerin (2) - 1 freq glowering (2) - 1 freq glowerit (2) - 3 freq lowerin (2) - 12 freq glowert (3) - 21 freq gleerin (3) - 1 freq glowin (3) - 33 freq glower (3) - 60 freq glowered (3) - 98 freq glowerd (3) - 1 freq lowrin (3) - 2 freq glourin (3) - 1 freq glowers (3) - 9 freq glowr (4) - 1 freq glaurin (4) - 1 freq gulderin (4) - 9 freq glowan (4) - 5 freq glaiberin (4) - 1 freq glarin (4) - 7 freq glaigerin (4) - 1 freq |
SoundEx code - G465 glarin - 7 freq glowerin - 61 freq gollerin - 6 freq glowering - 1 freq glowrin - 6 freq gloweren - 1 freq gleerin - 1 freq glaurin - 1 freq glourin - 1 freq gloweran - 3 freq glaran - 2 freq glarinly - 1 freq glirnmerin - 1 freq |
MetaPhone code - KLWRN glowerin - 61 freq gloweren - 1 freq gloweran - 3 freq |
GLOWERIN |
Time to execute Levenshtein function - 0.181904 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.339463 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.027390 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.037526 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.001031 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. |