| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| umwhile (0) - 16 freq 'while (2) - 1 freq awhile (2) - 15 freq €˜while (2) - 1 freq a-while (2) - 2 freq umquhile (2) - 18 freq while (2) - 1436 freq wwhile (2) - 1 freq mile (3) - 275 freq wummile (3) - 1 freq €œwhite (3) - 1 freq sumwie (3) - 1 freq smile (3) - 450 freq whie (3) - 1 freq rummile (3) - 1 freq whiles (3) - 478 freq umquhyle (3) - 5 freq whine (3) - 5 freq 'white (3) - 2 freq whale (3) - 31 freq tumshie (3) - 18 freq awhie (3) - 2 freq quhile (3) - 5 freq urwise (3) - 1 freq chile (3) - 15 freq |
umwhile (0) - 16 freq umquhile (3) - 18 freq wwhile (3) - 1 freq a-while (3) - 2 freq while (3) - 1436 freq awhile (3) - 15 freq 'while (3) - 1 freq whilie (4) - 85 freq whole (4) - 179 freq whyle (4) - 49 freq whale (4) - 31 freq whele (4) - 1 freq whiley (4) - 12 freq umquhyle (4) - 5 freq €˜while (4) - 1 freq swahili (5) - 3 freq michele (5) - 2 freq white (5) - 943 freq whill (5) - 13 freq meenwhile (5) - 1 freq mahal (5) - 3 freq qwhilk (5) - 1 freq whylie (5) - 14 freq while' (5) - 1 freq meanwhile (5) - 42 freq |
SoundEx code - U540 unweel - 2 freq unul - 1 freq unholy - 4 freq unhool - 3 freq unhalie - 1 freq umwhile - 16 freq unhailly - 1 freq |
MetaPhone code - UMHL umwhile - 16 freq |
UMWHILE |
| Time to execute Levenshtein function - 0.688193 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.495936 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.027263 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.104868 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.000822 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. |