| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| otel (0) - 1 freq tel (1) - 47 freq hotel (1) - 99 freq hovel (2) - 4 freq oral (2) - 23 freq steh (2) - 1 freq stelt (2) - 2 freq notes (2) - 117 freq htew (2) - 1 freq itvel (2) - 1 freq feel (2) - 1303 freq teu (2) - 29 freq steg (2) - 1 freq tql (2) - 1 freq ayel (2) - 2 freq kteu (2) - 2 freq hootel (2) - 3 freq iel (2) - 1 freq te (2) - 1570 freq stei (2) - 6 freq pte (2) - 4 freq ot (2) - 17 freq oe (2) - 13 freq reel (2) - 44 freq dotes (2) - 1 freq |
otel (0) - 1 freq tel (1) - 47 freq teal (2) - 2 freq touel (2) - 1 freq etl (2) - 1 freq atal (2) - 2 freq tl (2) - 9 freq atl (2) - 2 freq teil (2) - 4 freq atil (2) - 17 freq tal (2) - 6 freq tooel (2) - 2 freq til (2) - 1722 freq tul (2) - 1 freq tael (2) - 6 freq tele (2) - 32 freq hotel (2) - 99 freq sel (3) - 75 freq 'til (3) - 15 freq telc (3) - 1 freq taal (3) - 7 freq abel (3) - 7 freq kael (3) - 5 freq vtl (3) - 1 freq tyle (3) - 1 freq |
SoundEx code - O340 o'toole - 1 freq oot-lea - 1 freq oot-lay - 1 freq othello - 1 freq ootwale - 3 freq ootlay - 1 freq outwale - 3 freq outlaw - 2 freq otel - 1 freq oddly - 1 freq |
MetaPhone code - OTL o'toole - 1 freq oot-lea - 1 freq oot-lay - 1 freq ootlay - 1 freq outlaw - 2 freq otel - 1 freq oddly - 1 freq |
OTEL |
| Time to execute Levenshtein function - 0.226560 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.355513 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.055979 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.043773 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.001303 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. |