| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jet-bleck (0) - 1 freq jet-black (1) - 1 freq jet-blaik (2) - 1 freq peat-black (3) - 1 freq bet-lick (3) - 1 freq sun-bleck (3) - 1 freq intelleck (4) - 3 freq feedbeck (4) - 1 freq seleck (4) - 2 freq kethlick (4) - 1 freq penbreck (4) - 1 freq tea-brek (4) - 6 freq oot-leuk (4) - 1 freq selleck (4) - 1 freq let-be (4) - 1 freq sea-flech (4) - 1 freq heubeck (4) - 1 freq grey-black (4) - 1 freq deteck (4) - 1 freq mirk-bleck (4) - 1 freq refleck (4) - 18 freq negleck (4) - 7 freq jet-lag (4) - 1 freq methlick (4) - 1 freq hert-brack (4) - 1 freq |
jet-bleck (0) - 1 freq jet-black (1) - 1 freq jet-blaik (3) - 1 freq peat-black (4) - 1 freq sun-bleck (5) - 1 freq bet-lick (5) - 1 freq grey-black (6) - 1 freq saut-brack (7) - 1 freq sate-back (7) - 1 freq mirk-bleck (7) - 1 freq methlick (7) - 1 freq hert-brack (7) - 1 freq blue-black (7) - 2 freq bleck (7) - 179 freq coal-black (7) - 1 freq jet-lag (7) - 1 freq kethlick (7) - 1 freq intelleck (7) - 3 freq oot-leuk (7) - 1 freq tea-brek (7) - 6 freq jenblacker (8) - 1 freq weedow-bleck (8) - 1 freq pitch-black (8) - 1 freq unblock (8) - 3 freq rid-brick (8) - 4 freq |
SoundEx code - J314 jet-planes - 1 freq jet-bleck - 1 freq jet-blaik - 1 freq jet-black - 1 freq |
MetaPhone code - JTBLK jet-bleck - 1 freq jet-blaik - 1 freq jet-black - 1 freq |
JET-BLECK |
| Time to execute Levenshtein function - 0.578353 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 - 1.033668 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.084930 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.090734 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. |