| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uk-wide (0) - 1 freq upwide (2) - 1 freq ukraine (3) - 10 freq dug-wise (3) - 1 freq ukie (3) - 1 freq toun-wide (3) - 1 freq re-wire (3) - 1 freq ex-wife (3) - 1 freq unwise (3) - 1 freq kwite (3) - 1 freq upside (3) - 37 freq wide (3) - 245 freq urwise (3) - 1 freq skreid (4) - 18 freq onywie (4) - 3 freq unalike (4) - 12 freq unwind (4) - 5 freq pide (4) - 1 freq ae-time (4) - 5 freq uise (4) - 281 freq wider (4) - 54 freq mid-wife (4) - 5 freq sooside (4) - 2 freq wid- (4) - 2 freq uqwve (4) - 1 freq |
uk-wide (0) - 1 freq upwide (4) - 1 freq ex-wife (5) - 1 freq re-wire (5) - 1 freq kwite (5) - 1 freq wide (5) - 245 freq toun-wide (5) - 1 freq liqwid (6) - 2 freq kiwi (6) - 2 freq knawed (6) - 1 freq uk-eu (6) - 1 freq owid (6) - 7 freq up-wund (6) - 1 freq wade (6) - 9 freq ee-lid (6) - 2 freq €¦wid (6) - 1 freq firwid (6) - 1 freq kkwdf (6) - 1 freq ktid (6) - 1 freq da-wind (6) - 1 freq un-won (6) - 1 freq ker-side (6) - 1 freq widy (6) - 6 freq twid (6) - 1 freq kid (6) - 103 freq |
SoundEx code - U230 used - 663 freq uised - 277 freq uist - 9 freq use't - 13 freq ucht - 1 freq uissed - 4 freq usit - 4 freq usta - 1 freq ustae - 2 freq uized - 21 freq uisst - 1 freq usty - 1 freq uggit - 1 freq ushed - 1 freq uisit - 7 freq usetae - 1 freq uk-wide - 1 freq ‘used - 1 freq usd - 1 freq uzid - 1 freq uujde - 1 freq |
MetaPhone code - UKWT uk-wide - 1 freq |
UK-WIDE |
| Time to execute Levenshtein function - 0.171042 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.351536 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.027388 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.036581 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.000843 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. |