| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| discoloured (0) - 3 freq €œcoloured (3) - 1 freq discovered (3) - 43 freq disalloued (3) - 1 freq coloured (3) - 35 freq disclosure (3) - 1 freq discourse (4) - 14 freq 'discovered (4) - 1 freq oldie-coloured (4) - 1 freq dissolved (4) - 2 freq discoorses (4) - 1 freq dishonour's (4) - 1 freq cloured (4) - 3 freq discourse' (4) - 1 freq dishonour (4) - 3 freq disallowed (4) - 2 freq disfigured (4) - 1 freq discoorse- (4) - 1 freq dislodged (4) - 1 freq discouraged (4) - 10 freq disclose (4) - 1 freq skin-coloured (4) - 1 freq discoveded (4) - 1 freq disconcerted (4) - 1 freq scoured (4) - 5 freq |
discoloured (0) - 3 freq discovered (4) - 43 freq disclosure (5) - 1 freq coloured (5) - 35 freq discord (5) - 5 freq disalloued (5) - 1 freq €œcoloured (5) - 1 freq discoveded (6) - 1 freq disclose (6) - 1 freq discouraged (6) - 10 freq discard (6) - 1 freq scoured (6) - 5 freq discoorse (6) - 20 freq scoored (6) - 3 freq declered (6) - 2 freq discaird (6) - 1 freq declared (6) - 26 freq disfigured (6) - 1 freq cloured (6) - 3 freq oldie-coloured (6) - 1 freq 'discovered (6) - 1 freq de-cultured (6) - 1 freq discourse (6) - 14 freq disallowed (6) - 2 freq dissolved (6) - 2 freq |
SoundEx code - D246 declar't - 1 freq declare - 25 freq declaart - 1 freq declares - 5 freq declared - 26 freq declaration - 69 freq declarin - 13 freq declird - 1 freq declir - 1 freq discoloured - 3 freq declarter - 3 freq declartin - 1 freq declarations - 3 freq declaration' - 4 freq declered - 2 freq declarative - 1 freq declarit - 3 freq declaris - 2 freq dazler - 2 freq dazzler - 2 freq declaret - 1 freq declaire - 1 freq declarationofarbroath - 1 freq declaring - 1 freq |
MetaPhone code - TSKLRT discoloured - 3 freq |
DISCOLOURED |
| Time to execute Levenshtein function - 0.281418 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.679260 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.029975 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.075929 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.001269 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. |