| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| beglamoured (0) - 1 freq beglamourin (2) - 5 freq beglamourt (2) - 1 freq beglamour (2) - 3 freq enamoured (3) - 1 freq laboured (4) - 5 freq glamourit (4) - 1 freq glamourised (4) - 1 freq glamourie (4) - 20 freq belabour (4) - 1 freq flavoured (4) - 1 freq glamour (4) - 29 freq glamour's (4) - 1 freq belnamore (4) - 3 freq labored (5) - 1 freq bemused (5) - 8 freq beamed (5) - 6 freq recaptured (5) - 3 freq be-jumpered (5) - 1 freq cloured (5) - 3 freq glimmered (5) - 5 freq glamourous (5) - 1 freq blazoned (5) - 1 freq pub-flavoured (5) - 1 freq beglaummer't (5) - 1 freq |
beglamoured (0) - 1 freq beglamourt (3) - 1 freq beglamour (3) - 3 freq beglamourin (3) - 5 freq glamourie (6) - 20 freq glamour (6) - 29 freq glamourised (6) - 1 freq glamourit (6) - 1 freq enamoured (6) - 1 freq glammed (7) - 1 freq balamory (7) - 1 freq glared (7) - 2 freq glaumed (7) - 2 freq glamourous (7) - 1 freq glaumourie (7) - 1 freq outglamour (7) - 1 freq glimmered (7) - 5 freq balmour (7) - 1 freq blazered (7) - 1 freq blared (7) - 3 freq glamur (7) - 1 freq belabour (7) - 1 freq flavoured (7) - 1 freq belnamore (7) - 3 freq glamour's (7) - 1 freq |
SoundEx code - B245 beglaummer't - 1 freq backlan's - 1 freq beglamourt - 1 freq backlins-comin - 2 freq bucklin - 7 freq becalmed - 2 freq beglamour - 3 freq beglamoured - 1 freq becalm - 2 freq beguilin - 1 freq beglamourin - 5 freq basslin - 1 freq backlins - 18 freq backlands - 1 freq baklins - 7 freq backleens - 1 freq bogilan - 1 freq backlauns - 1 freq back-lyin - 1 freq boglands - 1 freq €˜baseline - 1 freq bauchlin - 1 freq baseline - 2 freq bbclamacqshow - 1 freq bbcaileenclarke - 1 freq |
MetaPhone code - BKLMRT beglaummer't - 1 freq beglamourt - 1 freq beglamoured - 1 freq |
BEGLAMOURED |
| Time to execute Levenshtein function - 0.227980 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.405900 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.028099 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.037433 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.000885 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. |