| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deckchair (0) - 2 freq deck-chairs (2) - 1 freq denchir (3) - 1 freq dark-hair (3) - 1 freq ermchair (3) - 10 freq ex-chair (3) - 1 freq deckhand (3) - 1 freq delychtit (4) - 1 freq seik-sair (4) - 1 freq machair (4) - 3 freq beckham (4) - 2 freq dualchais (4) - 2 freq declaim (4) - 1 freq drochaid (4) - 2 freq teichar (4) - 2 freq decairt (4) - 1 freq wheelchair (4) - 14 freq chair (4) - 219 freq secretair (4) - 1 freq mickcraig (4) - 1 freq decipher (4) - 4 freq delichtin (4) - 2 freq declir (4) - 1 freq declaire (4) - 1 freq decembir (4) - 2 freq |
deckchair (0) - 2 freq deck-chairs (4) - 1 freq deckchyres (5) - 1 freq dark-hair (5) - 1 freq denchir (5) - 1 freq decipher (6) - 4 freq doeckir (6) - 1 freq decker (6) - 12 freq deckhand (6) - 1 freq ex-chair (6) - 1 freq ermchair (6) - 10 freq backchat (6) - 4 freq derk-haired (7) - 1 freq teachar (7) - 1 freq airmchair (7) - 8 freq detachin (7) - 1 freq duncher (7) - 4 freq dockhead (7) - 1 freq docker (7) - 4 freq mckechnie (7) - 2 freq dickhead (7) - 2 freq dockra (7) - 1 freq dreicher (7) - 1 freq erm-chair (7) - 1 freq luckche (7) - 1 freq |
SoundEx code - D260 desire - 52 freq decker - 12 freq degree - 71 freq decree - 12 freq desir - 1 freq daycoar - 1 freq dcer - 1 freq dyker - 4 freq disarray - 2 freq digger - 12 freq desiree - 1 freq decor - 3 freq docker - 4 freq deckchair - 2 freq dagger - 4 freq decry - 2 freq daiker - 2 freq dickory - 3 freq doeckir - 1 freq desire' - 1 freq doo-grey - 1 freq dosser - 1 freq dogger - 1 freq deserr - 1 freq dowser - 1 freq décor - 1 freq dacre - 1 freq dossier - 1 freq decore - 1 freq €˜disseuer - 1 freq desair - 1 freq daiquiri - 1 freq dockra - 1 freq decora - 1 freq dizer - 1 freq dougray - 1 freq dxr - 1 freq dxxry - 1 freq |
MetaPhone code - TKXR deckchair - 2 freq |
DECKCHAIR |
| Time to execute Levenshtein function - 0.231011 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.396809 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.029765 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.040186 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.000930 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. |