| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| outglamour (0) - 1 freq beglamour (3) - 3 freq glamour (3) - 29 freq lamour (4) - 1 freq musslabour (4) - 1 freq outlander (4) - 3 freq outgaun (4) - 2 freq beglamourt (4) - 1 freq uklabour (4) - 2 freq clamour (4) - 8 freq outlaun (4) - 1 freq glamur (4) - 1 freq tratour (5) - 1 freq nzlabour (5) - 1 freq umour (5) - 1 freq fifelabour (5) - 1 freq gilmour (5) - 4 freq cullour (5) - 6 freq balmour (5) - 1 freq chamour (5) - 1 freq outplayed (5) - 1 freq ohumour (5) - 1 freq paramour (5) - 1 freq lungatou (5) - 1 freq autonomous (5) - 2 freq |
outglamour (0) - 1 freq glamour (4) - 29 freq beglamour (4) - 3 freq glamur (5) - 1 freq glamourie (6) - 20 freq beglamourt (6) - 1 freq gilmour (6) - 4 freq clamour (6) - 8 freq lamour (6) - 1 freq glaur (7) - 101 freq glaumourie (7) - 1 freq beglamoured (7) - 1 freq beglamourin (7) - 5 freq glour (7) - 1 freq tumour (7) - 6 freq glimer (7) - 1 freq gulmore (7) - 1 freq glamourit (7) - 1 freq glamorie (7) - 1 freq glaumer (7) - 1 freq outlaun (7) - 1 freq uklabour (7) - 2 freq balmour (7) - 1 freq outlander (7) - 3 freq outgaun (7) - 2 freq |
SoundEx code - O324 outglamour - 1 freq ootgleetit - 1 freq oot-sellin - 1 freq ootskailin - 1 freq ootclassed - 1 freq oot-classed - 2 freq otjlnbchat - 1 freq |
MetaPhone code - OTKLMR outglamour - 1 freq |
OUTGLAMOUR |
| Time to execute Levenshtein function - 0.203937 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.457752 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.064219 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.038772 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.000919 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. |