| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rdsbzk (0) - 1 freq resk (3) - 1 freq rds (3) - 1 freq rgstbz (3) - 1 freq respek (3) - 2 freq risk (3) - 62 freq dpbz (3) - 1 freq rubik (3) - 1 freq oddsbk (3) - 1 freq dbz (3) - 1 freq desk (4) - 149 freq dbis (4) - 1 freq stak (4) - 9 freq fisk (4) - 1 freq rashes (4) - 30 freq rebuke (4) - 3 freq busk (4) - 17 freq bck (4) - 1 freq russ (4) - 2 freq ruddick (4) - 1 freq rdgfoj (4) - 1 freq bfk (4) - 1 freq risky (4) - 8 freq rabhy (4) - 1 freq rbi (4) - 1 freq |
rdsbzk (0) - 1 freq oddsbk (5) - 1 freq rubik (6) - 1 freq redshank (6) - 3 freq bodsbeck (6) - 2 freq dpbz (6) - 1 freq dbz (6) - 1 freq rds (6) - 1 freq resk (6) - 1 freq rgstbz (6) - 1 freq risk (6) - 62 freq respek (6) - 2 freq ransack (7) - 1 freq redneck (7) - 1 freq redz (7) - 4 freq rsky (7) - 1 freq rids (7) - 1 freq shizk (7) - 1 freq rosebed (7) - 1 freq dask (7) - 2 freq rodrick (7) - 21 freq ardbeg (7) - 1 freq rdku (7) - 1 freq ards (7) - 14 freq vpszuk (7) - 1 freq |
SoundEx code - R321 rid-specklt - 1 freq rediscovered - 3 freq rediscover - 2 freq rediscoveran - 1 freq ritesopassageken - 1 freq rdsbzk - 1 freq rdgfoj - 1 freq rdeycbfgrp - 1 freq rothesfc - 1 freq |
MetaPhone code - RTSBSK rdsbzk - 1 freq |
RDSBZK |
| Time to execute Levenshtein function - 0.205854 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.390308 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.029273 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.039856 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.001024 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. |