Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
albus (0) - 4 freq albums (1) - 8 freq album (1) - 24 freq allus (1) - 4 freq lous (2) - 1 freq aus (2) - 4 freq gallus (2) - 97 freq alas (2) - 43 freq bus (2) - 361 freq all's (2) - 5 freq salus (2) - 1 freq alsua (2) - 1 freq abuse (2) - 46 freq alf's (2) - 1 freq alba' (2) - 1 freq walrus (2) - 9 freq agus (2) - 3 freq abun (2) - 3 freq plus (2) - 71 freq als (2) - 27 freq alwys (2) - 1 freq i'bus (2) - 2 freq allous (2) - 27 freq ancus (2) - 2 freq aloud (2) - 22 freq |
albus (0) - 4 freq alibis (2) - 2 freq albums (2) - 8 freq elbas (2) - 9 freq albais (2) - 1 freq album (2) - 24 freq allus (2) - 4 freq alps (3) - 2 freq al's (3) - 1 freq elbies (3) - 1 freq aless (3) - 26 freq aloes (3) - 1 freq leus (3) - 1 freq alba's (3) - 6 freq cbus (3) - 1 freq albans (3) - 1 freq abs (3) - 1 freq lobs (3) - 2 freq libs (3) - 1 freq labs (3) - 3 freq elbaes (3) - 1 freq malibus (3) - 1 freq aloos (3) - 4 freq alba (3) - 75 freq alles (3) - 1 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 - ALBS alba's - 6 freq albus - 4 freq alibis - 2 freq albais - 1 freq |
ALBUS |
Time to execute Levenshtein function - 0.468993 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.735866 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.085232 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.096988 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.000874 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. |