| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| allavolie (0) - 1 freq allwullie (3) - 6 freq akuallie (4) - 1 freq alluterlie (4) - 1 freq lanelie (4) - 1 freq sloalie (4) - 1 freq akaollie (4) - 7 freq akwallie (4) - 2 freq slaalie (4) - 1 freq allylove (4) - 8 freq alcoholic (4) - 6 freq allanbri (4) - 1 freq luvelie (4) - 3 freq glamorie (4) - 1 freq lavvie (4) - 18 freq aabodie (4) - 33 freq clairlie (4) - 4 freq claerlie (4) - 3 freq slavonic (4) - 1 freq allotit (4) - 1 freq allyie (4) - 1 freq allargue (4) - 1 freq slawlie (4) - 10 freq aefaallie (4) - 1 freq eulalie (4) - 1 freq |
allavolie (0) - 1 freq lallie (5) - 1 freq alluvial (5) - 3 freq luvelie (5) - 3 freq allwullie (5) - 6 freq llvl (5) - 1 freq gallipoli (6) - 1 freq allie (6) - 9 freq allouin (6) - 14 freq gallowlie (6) - 2 freq allouit (6) - 1 freq allooin (6) - 20 freq aillie (6) - 1 freq allowin (6) - 9 freq luvulee (6) - 1 freq lillie (6) - 4 freq luvlee (6) - 2 freq alleluia (6) - 2 freq alll (6) - 1 freq eulalie (6) - 1 freq ullapool (6) - 5 freq allover (6) - 3 freq laavie (6) - 1 freq ullvi (6) - 1 freq aefaallie (6) - 1 freq |
SoundEx code - A414 'ally-bally - 1 freq ally-bally-be - 1 freq allie-ballie - 2 freq allie-ballie-bee - 2 freq alveolars - 1 freq alveolar - 10 freq a-levels - 1 freq allavolie - 1 freq alluvial - 3 freq |
MetaPhone code - ALFL allavolie - 1 freq alluvial - 3 freq |
ALLAVOLIE |
| Time to execute Levenshtein function - 0.200897 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.381828 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.031828 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.040939 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.000942 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. |