| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blempt (0) - 2 freq blemt (1) - 2 freq lept (2) - 2 freq blekt (2) - 1 freq hempt (2) - 1 freq solempt (2) - 1 freq blest (2) - 1 freq blent (2) - 6 freq climpt (2) - 1 freq sleept (2) - 1 freq bleert (2) - 1 freq leapt (2) - 11 freq bleat (2) - 5 freq bleep (2) - 2 freq plumpt (2) - 1 freq flemit (2) - 2 freq clampt (2) - 1 freq blem (2) - 2 freq slept (2) - 57 freq tempt (2) - 9 freq exempt (2) - 12 freq bleet (2) - 2 freq slumpt (2) - 1 freq bleeps (2) - 1 freq lempit (2) - 2 freq |
blempt (0) - 2 freq blemt (2) - 2 freq climpt (3) - 1 freq plumpt (3) - 1 freq blamet (3) - 1 freq clampt (3) - 1 freq solempt (3) - 1 freq slumpt (3) - 1 freq lempit (3) - 2 freq clumpit (4) - 1 freq bleeps (4) - 1 freq bleart (4) - 5 freq bampot (4) - 30 freq clampit (4) - 4 freq lumpit (4) - 1 freq bumpit (4) - 4 freq limpet (4) - 5 freq bleet (4) - 2 freq limpit (4) - 1 freq lampit (4) - 2 freq slumpit (4) - 2 freq bleert (4) - 1 freq blest (4) - 1 freq hempt (4) - 1 freq blekt (4) - 1 freq |
SoundEx code - B451 blin-fou - 1 freq blinfauld - 4 freq blouump - 1 freq blown-up - 1 freq bellynab - 1 freq blinfoul - 1 freq balloonbreestit - 1 freq blinfaul - 1 freq blownup - 1 freq blempt - 2 freq blumphs - 3 freq blumphs' - 1 freq 'blumph' - 1 freq blinfaulds - 2 freq blin-fair - 1 freq |
MetaPhone code - BLMPT blempt - 2 freq |
BLEMPT |
| Time to execute Levenshtein function - 0.202945 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.442271 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.037064 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.055663 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.001158 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. |