| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gollerin (0) - 6 freq hollerin (1) - 2 freq gowerin (2) - 1 freq goller (2) - 7 freq gallerie (2) - 1 freq gollert (2) - 7 freq sillerin (2) - 4 freq folleyin (2) - 2 freq gleerin (2) - 1 freq gollopin (2) - 2 freq callerin (2) - 1 freq bullerin (2) - 1 freq gollered (2) - 11 freq gulderin (2) - 9 freq offerin (3) - 64 freq golfer (3) - 1 freq bulderin (3) - 2 freq getherin (3) - 34 freq yollert (3) - 2 freq howderin (3) - 3 freq alterin (3) - 2 freq splyerin (3) - 1 freq giowerin (3) - 1 freq goblin (3) - 9 freq galleries (3) - 8 freq |
gollerin (0) - 6 freq hollerin (2) - 2 freq gollopin (3) - 2 freq bullerin (3) - 1 freq gulderin (3) - 9 freq gleerin (3) - 1 freq gollered (3) - 11 freq callerin (3) - 1 freq goller (3) - 7 freq gollert (3) - 7 freq gallerie (3) - 1 freq sillerin (3) - 4 freq geller (4) - 1 freq glarin (4) - 7 freq ballerina (4) - 2 freq galleries (4) - 8 freq glowerin (4) - 61 freq gullert (4) - 18 freq glowrin (4) - 6 freq glaurin (4) - 1 freq gollared (4) - 1 freq glourin (4) - 1 freq galleried (4) - 1 freq folleyin (4) - 2 freq gowerin (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 - 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 |
GOLLERIN |
| Time to execute Levenshtein function - 0.208352 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.368286 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.031137 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.042736 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.000803 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. |