| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deli (1) - 3 freq declin (2) - 1 freq delyt (2) - 3 freq dein (2) - 22 freq deeit (2) - 1 freq devi (2) - 1 freq delhi (2) - 13 freq belie (2) - 2 freq de'i (2) - 1 freq deliver (2) - 47 freq div (2) - 506 freq denis (2) - 11 freq delict (2) - 1 freq delvit (2) - 1 freq daelin (2) - 6 freq derive (2) - 2 freq dhriv (2) - 5 freq delay (2) - 17 freq felix (2) - 1 freq deif (2) - 28 freq delfs (2) - 1 freq demi (2) - 1 freq deik (2) - 1 freq eli (2) - 4 freq belive (2) - 2 freq |
delve (2) - 6 freq deli (2) - 3 freq dela (3) - 1 freq delt (3) - 3 freq dli (3) - 3 freq gliv (3) - 1 freq driv (3) - 12 freq dealin (3) - 30 freq delite (3) - 4 freq deilie (3) - 2 freq deelin (3) - 1 freq dulie (3) - 1 freq dell (3) - 8 freq liv (3) - 12 freq dev (3) - 4 freq deive (3) - 1 freq cliv (3) - 1 freq dali (3) - 5 freq dilip (3) - 1 freq relive (3) - 1 freq delta (3) - 1 freq del (3) - 15 freq delvin (3) - 3 freq dlir (3) - 1 freq eelive (3) - 1 freq |
SoundEx code - D410 dolby - 3 freq dial-up - 2 freq dollop - 3 freq delve - 6 freq dollopie - 1 freq dulefu - 3 freq delphi - 1 freq dilip - 1 freq delboy - 2 freq |
MetaPhone code - TLF diaghilev - 1 freq delve - 6 freq dulefu - 3 freq delphi - 1 freq tea-leaf - 1 freq tulv - 1 freq |
DELIV |
| Time to execute Levenshtein function - 0.244449 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.430454 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.028146 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.044730 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.000931 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. |