| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oven (0) - 51 freq ove (1) - 1 freq hven (1) - 1 freq oxen (1) - 2 freq coven (1) - 4 freq oen (1) - 5 freq even (1) - 2669 freq oven' (1) - 1 freq ovens (1) - 4 freq ovey (1) - 1 freq omen (1) - 5 freq owen (1) - 6 freq sven (1) - 2 freq woven (1) - 12 freq ofen (1) - 2 freq open (1) - 735 freq over (1) - 340 freq proven (2) - 12 freq woken (2) - 7 freq co'en (2) - 2 freq dove (2) - 7 freq otel (2) - 1 freq owsen (2) - 3 freq govin (2) - 9 freq 'en (2) - 27 freq |
oven (0) - 51 freq even (1) - 2669 freq ivan (2) - 6 freq evn (2) - 1 freq evin (2) - 64 freq vein (2) - 5 freq eyven (2) - 10 freq evan (2) - 12 freq vn (2) - 2 freq von (2) - 1 freq van (2) - 161 freq evein (2) - 3 freq avon (2) - 3 freq veni (2) - 1 freq avin (2) - 2 freq yovein (2) - 1 freq vin (2) - 6 freq aiven (2) - 66 freq ovine (2) - 1 freq omen (2) - 5 freq ovens (2) - 4 freq owen (2) - 6 freq sven (2) - 2 freq woven (2) - 12 freq oven' (2) - 1 freq |
SoundEx code - O150 open - 735 freq oven - 51 freq 'open - 5 freq 'opium - 1 freq oapen - 1 freq offen - 17 freq offin - 20 freq ovine - 1 freq oppin - 4 freq opin - 9 freq opium - 4 freq oppen - 31 freq oobin - 2 freq oven' - 1 freq 'open' - 1 freq obama - 3 freq oban - 3 freq opon - 1 freq ofen - 2 freq opine - 1 freq €˜open - 5 freq open-mou - 3 freq €˜opium - 1 freq open- - 1 freq ofÂ’n - 1 freq opinio - 1 freq obeyin - 1 freq oyvaym - 1 freq ovme - 1 freq |
MetaPhone code - OFN oven - 51 freq offen - 17 freq offin - 20 freq ovine - 1 freq oven' - 1 freq ofen - 2 freq ofÂ’n - 1 freq |
OVEN |
| Time to execute Levenshtein function - 0.192015 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.349578 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.027950 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.037815 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.001000 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. |