| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oulwife (0) - 1 freq coulrife (2) - 4 freq auldwife (2) - 1 freq oulii (3) - 1 freq life (3) - 1976 freq sulie (3) - 1 freq €œlife (3) - 1 freq outwi (3) - 1 freq bulfie (3) - 1 freq poultice (3) - 1 freq fulie (3) - 1 freq outside (3) - 87 freq unwise (3) - 1 freq forlife (3) - 1 freq lowlife (3) - 2 freq auldrife (3) - 1 freq urwise (3) - 1 freq outwale (3) - 3 freq olif (3) - 1 freq oblige (3) - 2 freq sumwie (3) - 1 freq onywie (3) - 3 freq gullie (3) - 9 freq oÂ’wine (3) - 1 freq doulie (3) - 2 freq |
oulwife (0) - 1 freq yolewife (3) - 1 freq alewife (3) - 1 freq auldwife (3) - 1 freq i'wife (4) - 2 freq olif (4) - 1 freq lwf (4) - 1 freq coulrife (4) - 4 freq 'wife (4) - 1 freq kailwife (4) - 2 freq lowlife (4) - 2 freq life (4) - 1976 freq wife (4) - 818 freq lefe (5) - 1 freq laif (5) - 5 freq onawie (5) - 1 freq lufe (5) - 1 freq oaulwv (5) - 1 freq ex-wife (5) - 1 freq ulf (5) - 4 freq sadwife (5) - 1 freq gudewife (5) - 1 freq ouldir (5) - 1 freq olive (5) - 16 freq alfie (5) - 28 freq |
SoundEx code - O410 olive - 16 freq olaf - 292 freq 'olaf - 2 freq olivy - 1 freq olivia - 5 freq olaf' - 1 freq olav - 1 freq 'olivia - 2 freq oulwife - 1 freq oaulwv - 1 freq olif - 1 freq |
MetaPhone code - OLWF oulwife - 1 freq |
OULWIFE |
| Time to execute Levenshtein function - 0.238559 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.400398 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.030151 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.039299 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.000923 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. |