| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alabaster (0) - 3 freq alabast (2) - 1 freq labster (2) - 6 freq allister (3) - 1 freq plaister (3) - 20 freq alister (3) - 1 freq lobster (3) - 23 freq lancaster (3) - 3 freq blaster (3) - 3 freq slaister (3) - 8 freq wabster (3) - 17 freq glaister (3) - 2 freq labsters (3) - 9 freq plaster (3) - 14 freq labster- (3) - 1 freq faaster (3) - 6 freq arabstar (3) - 3 freq lamb-stew (4) - 1 freq later (4) - 554 freq batter (4) - 74 freq stamagaster (4) - 4 freq barter (4) - 3 freq malafooster (4) - 1 freq waister (4) - 1 freq flatter (4) - 4 freq |
alabaster (0) - 3 freq labster (2) - 6 freq lobster (3) - 23 freq alabast (3) - 1 freq labster- (4) - 1 freq labsters (4) - 9 freq arabstar (4) - 3 freq wabster (4) - 17 freq allister (4) - 1 freq lobstir (4) - 1 freq alister (4) - 1 freq lobsters (5) - 37 freq leister (5) - 2 freq ulster (5) - 420 freq lister (5) - 6 freq lobster- (5) - 1 freq isbister (5) - 2 freq buster (5) - 2 freq hubster (5) - 1 freq foubister (5) - 2 freq alastair (5) - 10 freq webster (5) - 8 freq slaister (5) - 8 freq glaister (5) - 2 freq faaster (5) - 6 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 - ALBSTR alabaster - 3 freq |
ALABASTER |
| Time to execute Levenshtein function - 0.197626 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.371446 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.029402 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.038866 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.000984 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. |