| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dollarglen (0) - 1 freq dollaghan (3) - 1 freq collage (4) - 1 freq follaen (4) - 4 freq gollared (4) - 1 freq allargue (4) - 1 freq collared (4) - 1 freq killyglen (4) - 1 freq dollars- (4) - 1 freq dollars (4) - 7 freq collages (4) - 1 freq dollar (4) - 12 freq dodeallen (4) - 6 freq follyen (5) - 2 freq owergeen (5) - 2 freq rolleen (5) - 1 freq moarneen (5) - 1 freq hollered (5) - 5 freq bollards (5) - 2 freq dourles (5) - 4 freq foliage (5) - 2 freq darger (5) - 2 freq doolally (5) - 11 freq pillaged (5) - 2 freq declare (5) - 25 freq |
dollarglen (0) - 1 freq dollaghan (5) - 1 freq killyglen (6) - 1 freq dollars- (7) - 1 freq dollar (7) - 12 freq draiglin (7) - 1 freq dodeallen (7) - 6 freq dollars (7) - 7 freq allargue (7) - 1 freq darlin (8) - 55 freq killerguile (8) - 1 freq hollerin (8) - 2 freq allergies (8) - 2 freq danglin (8) - 16 freq haliglen (8) - 1 freq ollerton (8) - 1 freq gollerin (8) - 6 freq collarbane (8) - 1 freq dargin (8) - 7 freq declarin (8) - 13 freq ballyraggin (8) - 1 freq collegian (8) - 1 freq colourblin (8) - 1 freq goreglen (8) - 2 freq colloguein (8) - 1 freq |
SoundEx code - D462 deleerious - 1 freq dwallers - 3 freq dollars - 7 freq dailers - 2 freq dealers - 10 freq delirious - 3 freq dollarglen - 1 freq dollars- - 1 freq |
MetaPhone code - TLRKLN dollarglen - 1 freq |
DOLLARGLEN |
| Time to execute Levenshtein function - 0.241610 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.530643 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.065749 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.040892 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.000933 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. |