| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ereepit (0) - 1 freq dreepit (1) - 7 freq creepit (1) - 42 freq greetit (2) - 10 freq traepit (2) - 2 freq erekkit (2) - 2 freq wheepit (2) - 2 freq cheepit (2) - 3 freq sneepit (2) - 1 freq creept (2) - 2 freq creepin (2) - 49 freq dreipit (2) - 2 freq erectit (2) - 1 freq keepit (2) - 151 freq treedit (2) - 1 freq threepit (2) - 5 freq dreelit (2) - 1 freq creepie (2) - 9 freq reipit (2) - 2 freq seepit (2) - 4 freq dreepin (2) - 66 freq dreeprt (2) - 1 freq reekit (2) - 3 freq creedit (2) - 1 freq sleepit (2) - 40 freq |
ereepit (0) - 1 freq reipit (2) - 2 freq creepit (2) - 42 freq dreepit (2) - 7 freq seepit (3) - 4 freq keepit (3) - 151 freq reekit (3) - 3 freq dreipit (3) - 2 freq erupt (3) - 3 freq rypit (3) - 4 freq roupit (3) - 1 freq creipit (3) - 2 freq creept (3) - 2 freq traepit (3) - 2 freq drapit (4) - 1 freq croupit (4) - 2 freq reep (4) - 2 freq reakit (4) - 2 freq respite (4) - 4 freq resit (4) - 1 freq armpit (4) - 1 freq troupit (4) - 2 freq erest (4) - 10 freq repete (4) - 1 freq requit (4) - 1 freq |
SoundEx code - E613 eruptin - 2 freq eruptions - 2 freq eruption - 2 freq erupted - 8 freq eraboots - 1 freq errupten - 1 freq erupt - 3 freq erupts - 5 freq erabbit - 1 freq erved - 1 freq ereepit - 1 freq euripides - 1 freq earbuds - 1 freq |
MetaPhone code - ERPT erupt - 3 freq ereepit - 1 freq |
EREEPIT |
| Time to execute Levenshtein function - 0.493022 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 - 1.168283 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.027924 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.097629 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.000853 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. |