| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blue-melt (0) - 1 freq bluebell (3) - 67 freq bummelt (3) - 1 freq blue-litt (3) - 1 freq bellement (4) - 3 freq bauchelt (4) - 3 freq blueness (4) - 2 freq blue-green (4) - 2 freq bluecoat (4) - 1 freq beelt (4) - 1 freq blue-eened (4) - 1 freq blemt (4) - 2 freq bru-jet (4) - 1 freq blue-white (4) - 1 freq lue-seek (4) - 1 freq bleert (4) - 1 freq pummelt (4) - 1 freq bluebells (4) - 11 freq blenket (4) - 1 freq mummelt (4) - 13 freq blue-blae (4) - 1 freq bakemeat (4) - 1 freq blue-ray (4) - 1 freq bundelt (4) - 1 freq bluegreen (4) - 1 freq |
blue-melt (0) - 1 freq blue-litt (5) - 1 freq bummelt (5) - 1 freq blue-white (6) - 1 freq blue-blae (6) - 1 freq blae-whyt (6) - 1 freq blempt (6) - 2 freq blemt (6) - 2 freq bummilt (6) - 1 freq blamet (6) - 1 freq bluebell (6) - 67 freq bellement (6) - 3 freq element (7) - 45 freq plummet (7) - 2 freq hummelt (7) - 2 freq trummelt (7) - 1 freq buckelt (7) - 2 freq gemmelt (7) - 1 freq murmelt (7) - 2 freq bleestert (7) - 1 freq blue-in (7) - 1 freq blume (7) - 3 freq bleet (7) - 2 freq bluest (7) - 1 freq whummelt (7) - 5 freq |
SoundEx code - B454 blameless - 2 freq belnaloob - 4 freq belnaloob's - 1 freq blinly - 2 freq blue-melt - 1 freq balloon'll - 1 freq |
MetaPhone code - BLMLT blue-melt - 1 freq |
BLUE-MELT |
| Time to execute Levenshtein function - 0.245054 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.456143 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.028040 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.038433 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.000946 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. |