| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alfieboe (0) - 1 freq alfiehfc (3) - 1 freq alfie (3) - 28 freq baffiebox (3) - 1 freq aliene (3) - 2 freq alfie's (3) - 8 freq fibo (4) - 1 freq allege (4) - 1 freq alibis (4) - 2 freq lifeboy (4) - 1 freq alien (4) - 41 freq calfies (4) - 4 freq slieve (4) - 1 freq a-piece (4) - 5 freq akimbo (4) - 1 freq lebor (4) - 1 freq alikie (4) - 1 freq aloe (4) - 1 freq albino (4) - 2 freq aleive (4) - 1 freq aadience (4) - 5 freq afiore (4) - 1 freq alpine (4) - 2 freq alienar (4) - 3 freq alike (4) - 26 freq |
alfieboe (0) - 1 freq lifeboy (4) - 1 freq alfie (4) - 28 freq liefe (5) - 1 freq allyboy (5) - 1 freq libbie (5) - 1 freq limbie (5) - 1 freq alibi (5) - 2 freq lifebuoy (5) - 1 freq lisboa (5) - 1 freq fibo (5) - 1 freq alfie's (5) - 8 freq aliene (5) - 2 freq liefer (6) - 5 freq liege (6) - 4 freq life (6) - 1978 freq calfie (6) - 8 freq lifier (6) - 1 freq lefe (6) - 1 freq alice (6) - 1584 freq firbye (6) - 29 freq allie (6) - 9 freq alkie (6) - 3 freq alison (6) - 410 freq allied (6) - 4 freq |
SoundEx code - A411 alphabet - 15 freq alphabetic - 2 freq alphabetti - 1 freq alphabee - 9 freq alphabets - 1 freq alphabetical - 2 freq albaparty - 9 freq alphabetties - 1 freq alfieboe - 1 freq albapartytime - 2 freq alfiehfc - 1 freq |
MetaPhone code - ALFB alphabee - 9 freq alfieboe - 1 freq |
ALFIEBOE |
| Time to execute Levenshtein function - 0.239117 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.427146 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.037314 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.039748 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.000884 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. |