| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| beglamourin (0) - 5 freq beglamoured (2) - 1 freq beglamourt (2) - 1 freq beglamour (2) - 3 freq glamourit (3) - 1 freq glamourie (3) - 20 freq labourin (4) - 3 freq glamour (4) - 29 freq glamorie (4) - 1 freq glaumourie (4) - 1 freq glaurin (4) - 1 freq glamour's (4) - 1 freq belabour (4) - 1 freq glourin (4) - 1 freq flavourin (4) - 1 freq clamouran (4) - 1 freq mell-moorin (4) - 1 freq featurin (5) - 8 freq blamin (5) - 6 freq glammochin (5) - 1 freq allourin (5) - 1 freq measurin (5) - 4 freq lamour (5) - 1 freq favourin (5) - 1 freq blarin (5) - 13 freq |
beglamourin (0) - 5 freq beglamour (3) - 3 freq beglamourt (3) - 1 freq beglamoured (3) - 1 freq glamourie (5) - 20 freq glamourit (5) - 1 freq glourin (6) - 1 freq clamouran (6) - 1 freq glaurin (6) - 1 freq glamorie (6) - 1 freq glamour (6) - 29 freq glaumourie (6) - 1 freq glaumin (7) - 1 freq bellamaina (7) - 2 freq balmour (7) - 1 freq glamur (7) - 1 freq glammin (7) - 3 freq balamory (7) - 1 freq glaigerin (7) - 1 freq glaiberin (7) - 1 freq balmerino (7) - 1 freq glarin (7) - 7 freq outglamour (7) - 1 freq glowrin (7) - 6 freq glimmrin (7) - 3 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 - BKLMRN beglamourin - 5 freq |
BEGLAMOURIN |
| Time to execute Levenshtein function - 0.196879 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.403120 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.027941 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.039048 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.000870 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. |