| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| albagal (0) - 1 freq albagman (2) - 2 freq baal (3) - 14 freq aoagaw (3) - 1 freq malaga (3) - 1 freq alba (3) - 75 freq abaat (3) - 1 freq aloatae (3) - 1 freq algae (3) - 3 freq albanian (3) - 1 freq aafal (3) - 22 freq alana (3) - 12 freq albania (3) - 1 freq albais (3) - 1 freq alkahoal (3) - 1 freq lagan (3) - 3 freq aibagawa (3) - 3 freq almanac (3) - 3 freq alba' (3) - 1 freq abigail (3) - 2 freq alba's (3) - 6 freq palatal (3) - 3 freq aefaal (3) - 1 freq albans (3) - 1 freq legal (3) - 85 freq |
albagal (0) - 1 freq abigail (4) - 2 freq illegal (4) - 31 freq legal (4) - 85 freq albagman (4) - 2 freq alabama (5) - 2 freq albans (5) - 1 freq alba's (5) - 6 freq baal (5) - 14 freq alban (5) - 3 freq agal (5) - 1 freq label (5) - 57 freq bogil (5) - 4 freq liberal (5) - 26 freq 'legal (5) - 1 freq alba' (5) - 1 freq bugil (5) - 1 freq lgl (5) - 1 freq albania (5) - 1 freq algae (5) - 3 freq albanian (5) - 1 freq albais (5) - 1 freq aibagawa (5) - 3 freq alkahoal (5) - 1 freq lagan (5) - 3 freq |
SoundEx code - A412 alba's - 6 freq alps - 2 freq alfie's - 8 freq alfiie's - 1 freq albus - 4 freq aul-fashioned - 5 freq aal-fashioned - 1 freq alibis - 2 freq alf's - 1 freq alphaeus - 1 freq alphaeus's - 1 freq alphaeus' - 1 freq alabast - 1 freq albeest - 1 freq alabaster - 3 freq albais - 1 freq albagal - 1 freq albagman - 2 freq |
MetaPhone code - ALBKL albagal - 1 freq |
ALBAGAL |
| Time to execute Levenshtein function - 0.290599 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.383676 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.029409 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.038112 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.000895 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. |