| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| allover (0) - 3 freq alcove (2) - 4 freq alloued (2) - 54 freq pullover (2) - 1 freq plover (2) - 9 freq alloed (2) - 3 freq clover (2) - 17 freq walloper (2) - 6 freq alcoves (2) - 1 freq allooed (2) - 58 freq allowed (2) - 130 freq allooes (2) - 2 freq lover (2) - 27 freq aller (2) - 2 freq closer (3) - 138 freq aver (3) - 4 freq madlove (3) - 3 freq allowa (3) - 1 freq i'lower (3) - 1 freq falconer (3) - 11 freq 'flooer (3) - 1 freq remover (3) - 3 freq alone (3) - 72 freq ballater (3) - 10 freq allude (3) - 1 freq |
allover (0) - 3 freq clover (3) - 17 freq lover (3) - 27 freq plover (3) - 9 freq aller (3) - 2 freq pullover (3) - 1 freq cleaver (4) - 4 freq luver (4) - 8 freq cliver (4) - 12 freq lever (4) - 2 freq claver (4) - 14 freq liver (4) - 34 freq deliver (4) - 47 freq silver (4) - 121 freq slaver (4) - 6 freq slaiver (4) - 1 freq claiver (4) - 4 freq allure (4) - 2 freq oliver (4) - 10 freq sliver (4) - 8 freq wulver (4) - 1 freq palaver (4) - 10 freq solver (4) - 1 freq clever (4) - 69 freq alcove (4) - 4 freq |
SoundEx code - A416 aal-farrant - 3 freq 'albert - 1 freq aulfarrent - 1 freq alfresco - 3 freq albrecht - 1 freq aul-farrant - 4 freq alfred - 12 freq albert - 25 freq albert's - 2 freq allover - 3 freq alberto - 2 freq alberta - 1 freq €™aal-farrant - 1 freq alford - 4 freq albertz - 4 freq albertina - 1 freq alfordbrad - 32 freq allfreezehahahahahaha - 1 freq allforaurora - 2 freq alfrescodent - 1 freq albertkirkjr - 1 freq |
MetaPhone code - ALFR allover - 3 freq |
ALLOVER |
| Time to execute Levenshtein function - 0.243425 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.405235 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.030286 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.039291 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.000851 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. |