| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rediscovered (0) - 3 freq rediscover (2) - 2 freq rediscoveran (2) - 1 freq 'discovered (2) - 1 freq discovered (2) - 40 freq recovered (3) - 11 freq discoveded (3) - 1 freq discovers (4) - 2 freq reco'ered (4) - 1 freq discoveran (4) - 1 freq diskivered (4) - 1 freq discoveries (4) - 4 freq discovery (4) - 21 freq discoverin (4) - 3 freq tree-covered (4) - 1 freq discovert (4) - 19 freq registered (4) - 16 freq discover (4) - 31 freq discoverie (4) - 1 freq discoverin' (5) - 1 freq rescoursed (5) - 4 freq uncovered (5) - 2 freq discord (5) - 5 freq redshedred (5) - 1 freq ramscootered (5) - 1 freq |
rediscovered (0) - 3 freq discovered (3) - 40 freq 'discovered (3) - 1 freq rediscoveran (3) - 1 freq rediscover (3) - 2 freq discoveded (5) - 1 freq recovered (5) - 11 freq discoverin (6) - 3 freq discovert (6) - 19 freq discover (6) - 31 freq discovery (6) - 21 freq discoverie (6) - 1 freq discoveran (6) - 1 freq discovers (6) - 2 freq diskivered (6) - 1 freq discoveries (6) - 4 freq redshedred (7) - 1 freq discovry (7) - 1 freq discoloured (7) - 3 freq discord (7) - 5 freq discuvert (7) - 1 freq ramscootered (7) - 1 freq reco'ered (7) - 1 freq tree-covered (7) - 1 freq registered (7) - 16 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 - RTSKFRT rediscovered - 3 freq |
REDISCOVERED |
| Time to execute Levenshtein function - 0.474698 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.427692 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.029321 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.036879 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.000749 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. |