| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blouump (0) - 1 freq bloum (2) - 1 freq bloums (2) - 1 freq bump (3) - 23 freq broup (3) - 1 freq bonum (3) - 1 freq ploums (3) - 2 freq blume (3) - 3 freq buuuurp (3) - 1 freq gloum (3) - 1 freq bleums (3) - 1 freq blooms (3) - 9 freq blouse (3) - 18 freq gloup (3) - 3 freq blouses (3) - 2 freq lump (3) - 62 freq blow-up (3) - 1 freq clump (3) - 18 freq slump (3) - 6 freq floomp (3) - 1 freq blosom (3) - 1 freq bluim (3) - 6 freq blouwn (3) - 1 freq ploum (3) - 2 freq blossums (3) - 1 freq |
blouump (0) - 1 freq bloums (3) - 1 freq bloum (3) - 1 freq slump (4) - 6 freq lump (4) - 62 freq clump (4) - 18 freq plump (4) - 16 freq bluims (4) - 5 freq bloom (4) - 27 freq blooms (4) - 9 freq bluim (4) - 6 freq floomp (4) - 1 freq blume (4) - 3 freq bump (4) - 23 freq bleums (4) - 1 freq lamp (5) - 79 freq blaim (5) - 1 freq limp (5) - 20 freq slamp (5) - 1 freq blemt (5) - 2 freq glimp (5) - 6 freq blumed (5) - 4 freq bloomed (5) - 3 freq glumpy (5) - 1 freq lumpy (5) - 4 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 - BLMP blouump - 1 freq |
BLOUUMP |
| Time to execute Levenshtein function - 0.200648 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.553821 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.030762 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.078846 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.000844 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. |