| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glarin (0) - 7 freq glawin (1) - 2 freq glaurin (1) - 1 freq flarin (1) - 3 freq gaarin (1) - 1 freq gearin (1) - 2 freq blarin (1) - 13 freq glaran (1) - 2 freq glazin (1) - 2 freq searin (2) - 4 freq glomin (2) - 3 freq blasin (2) - 1 freq bearin (2) - 28 freq wearin (2) - 190 freq glarinly (2) - 1 freq glais (2) - 1 freq plaein (2) - 1 freq clartin (2) - 4 freq starin (2) - 150 freq flakin (2) - 1 freq lavin (2) - 2 freq carin (2) - 44 freq gaain (2) - 2 freq lacin (2) - 1 freq fearin (2) - 4 freq |
glarin (0) - 7 freq glaran (1) - 2 freq glaurin (1) - 1 freq gleerin (2) - 1 freq blarin (2) - 13 freq glourin (2) - 1 freq glazin (2) - 2 freq gearin (2) - 2 freq flarin (2) - 3 freq glawin (2) - 2 freq gaarin (2) - 1 freq flaran (3) - 1 freq gurrin (3) - 1 freq glowin (3) - 28 freq gloamin (3) - 76 freq garrin (3) - 35 freq flairin (3) - 2 freq clearin (3) - 27 freq gleamin (3) - 21 freq gagarin (3) - 2 freq glare (3) - 15 freq florin (3) - 4 freq clairin (3) - 1 freq clarion (3) - 1 freq learin (3) - 8 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 - KLRN glarin - 7 freq clourin - 1 freq gollerin - 6 freq glowrin - 6 freq clearin - 27 freq cowlraine - 2 freq gleerin - 1 freq glaurin - 1 freq glourin - 1 freq coulrain' - 2 freq coulrain - 1 freq clearan - 2 freq cullourin - 1 freq glaran - 2 freq kilrenny - 1 freq callerin - 1 freq kloorin - 1 freq clairin - 1 freq cloorin - 1 freq clarion - 1 freq colourin - 3 freq coleraine - 4 freq clewran - 1 freq |
GLARIN |
| Time to execute Levenshtein function - 0.386246 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.815960 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.089514 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.101845 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.001008 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. |