| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| diregaird (0) - 1 freq disregaird (1) - 1 freq misregaird (2) - 1 freq disregard (2) - 1 freq regaird (2) - 39 freq reagaird (3) - 1 freq disregards (3) - 1 freq rewaird (3) - 8 freq firebird (3) - 1 freq vineyaird (3) - 9 freq discaird (3) - 1 freq regard (3) - 16 freq disrepair (3) - 3 freq kirkyaird (3) - 81 freq regairds (3) - 15 freq recaird (3) - 1 freq directien (4) - 1 freq diseydid (4) - 3 freq director (4) - 30 freq directors (4) - 3 freq wire-haired (4) - 1 freq regairdit (4) - 33 freq discard (4) - 1 freq retard (4) - 2 freq dingied (4) - 3 freq |
diregaird (0) - 1 freq disregaird (2) - 1 freq disregard (3) - 1 freq regaird (3) - 39 freq misregaird (4) - 1 freq regard (4) - 16 freq reagaird (4) - 1 freq kirkyaird (5) - 81 freq durward (5) - 2 freq regairds (5) - 15 freq recaird (5) - 1 freq discaird (5) - 1 freq disregards (5) - 1 freq firebird (5) - 1 freq rewaird (5) - 8 freq braird (6) - 3 freq dregies (6) - 1 freq fermyaird (6) - 5 freq safeguaird (6) - 1 freq airgied (6) - 2 freq dargers (6) - 1 freq raird (6) - 1 freq directed (6) - 12 freq bodygaird (6) - 1 freq regards (6) - 11 freq |
SoundEx code - D626 dresser - 23 freq darker - 9 freq derker - 7 freq darger - 2 freq daurker - 11 freq daurk-haired - 2 freq diregaird - 1 freq dairker - 1 freq daark-haired - 1 freq dressers - 1 freq drug-ring - 1 freq darkrife - 1 freq darg-year - 1 freq dargers - 1 freq derk-haired - 1 freq dark-hair - 1 freq dreicher - 1 freq doriccroissant - 1 freq drewjarviescomb - 7 freq derrygirls - 1 freq derekcorner - 1 freq drgarypamplin - 1 freq dragraceukbbc - 1 freq dirkrobertsonart - 1 freq drcharlesl - 1 freq |
MetaPhone code - TRKRT diregaird - 1 freq triggered - 2 freq |
DIREGAIRD |
| Time to execute Levenshtein function - 0.186155 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.397162 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.027648 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.037070 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.000858 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. |