Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
desair (0) - 1 freq despair (1) - 58 freq desairs (1) - 1 freq desir (1) - 1 freq obsair (2) - 11 freq aesir (2) - 4 freq desax (2) - 1 freq desairve (2) - 1 freq despirt (2) - 1 freq declir (2) - 1 freq 'sair (2) - 2 freq debait (2) - 1 freq dessirt (2) - 1 freq dair (2) - 11 freq decairt (2) - 1 freq dennir (2) - 29 freq cesar (2) - 2 freq deain (2) - 1 freq denar (2) - 1 freq aesyir (2) - 1 freq deserr (2) - 1 freq repair (2) - 15 freq sair (2) - 786 freq mestir (2) - 2 freq dustir (2) - 1 freq |
desair (0) - 1 freq desir (1) - 1 freq desire (2) - 52 freq desairs (2) - 1 freq despair (2) - 58 freq denar (3) - 1 freq sair (3) - 786 freq deserr (3) - 1 freq dustir (3) - 1 freq aesyir (3) - 1 freq dewar (3) - 9 freq deir (3) - 7 freq devoir (3) - 1 freq cesar (3) - 2 freq desi (3) - 1 freq dear (3) - 425 freq dispair (3) - 1 freq desiree (3) - 1 freq desairve (3) - 1 freq desax (3) - 1 freq aesir (3) - 4 freq 'sair (3) - 2 freq obsair (3) - 11 freq dair (3) - 11 freq dossier (4) - 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 - TSR desire - 52 freq tizer - 3 freq desir - 1 freq dcer - 1 freq disarray - 2 freq desiree - 1 freq taser - 3 freq desire' - 1 freq dosser - 1 freq deserr - 1 freq towser - 6 freq dowser - 1 freq dossier - 1 freq €˜disseuer - 1 freq desair - 1 freq tosser - 2 freq dizer - 1 freq |
DESAIR |
Time to execute Levenshtein function - 0.218350 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.411329 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.028560 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.040940 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.001180 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. |