| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| allure (0) - 2 freq allude (1) - 1 freq vadlure (2) - 6 freq allyie (2) - 1 freq allie (2) - 9 freq 'clure (2) - 1 freq atoure (2) - 1 freq allye (2) - 1 freq clure (2) - 1 freq asure (2) - 1 freq failure (2) - 32 freq allege (2) - 1 freq azure (2) - 3 freq pleure (2) - 1 freq lure (2) - 6 freq aller (2) - 1 freq allus (2) - 4 freq flure (2) - 13 freq assure (2) - 20 freq culure (2) - 1 freq allers (2) - 1 freq claure (2) - 4 freq afure (2) - 2 freq lle (3) - 1 freq alleged (3) - 1 freq |
allure (0) - 2 freq aller (2) - 1 freq allude (2) - 1 freq pleure (3) - 1 freq lure (3) - 6 freq flure (3) - 13 freq allers (3) - 1 freq auller (3) - 1 freq claure (3) - 4 freq allege (3) - 1 freq culure (3) - 1 freq allus (3) - 4 freq allyie (3) - 1 freq allye (3) - 1 freq allie (3) - 9 freq clure (3) - 1 freq ellar (3) - 1 freq failure (3) - 32 freq alloa (4) - 4 freq pallor (4) - 4 freq illie (4) - 2 freq lallie (4) - 1 freq allous (4) - 27 freq allan (4) - 91 freq allo (4) - 2 freq |
SoundEx code - A460 aaler - 17 freq aul'er - 1 freq auler - 17 freq auller - 1 freq aller - 1 freq allure - 2 freq a-leary - 1 freq a-leerie - 1 freq ayallar - 4 freq €œayallar - 1 freq aulÂ’er - 1 freq aleerie' - 1 freq |
MetaPhone code - ALR aaler - 17 freq aul'er - 1 freq auler - 17 freq auller - 1 freq aller - 1 freq allure - 2 freq a-leary - 1 freq a-leerie - 1 freq aulÂ’er - 1 freq aleerie' - 1 freq |
ALLURE |
| Time to execute Levenshtein function - 0.247196 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.437256 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.028792 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.041580 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.000817 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. |