| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| orientation (0) - 1 freq lamentation (3) - 4 freq presentation (3) - 13 freq indentation (3) - 1 freq ornamentation (3) - 1 freq orientated (3) - 1 freq praisentation (3) - 6 freq compensation (4) - 10 freq ostentatious (4) - 2 freq gestation (4) - 1 freq concentration (4) - 17 freq orientit (4) - 1 freq rendition (4) - 6 freq dentition (4) - 1 freq reputation (4) - 30 freq plantation (4) - 12 freq oration (4) - 1 freq recitation (4) - 2 freq correlation (4) - 1 freq praisentations (4) - 2 freq documentation (4) - 7 freq oriental (4) - 1 freq predation (4) - 1 freq affectation (4) - 4 freq oxidation (4) - 1 freq |
orientation (0) - 1 freq orientated (4) - 1 freq reputation (5) - 30 freq urinatin (5) - 1 freq rendition (5) - 6 freq recitation (5) - 2 freq fantation (5) - 2 freq rotation (5) - 1 freq irritation (5) - 4 freq orientit (5) - 1 freq dentition (5) - 1 freq refutation (5) - 1 freq presentation (5) - 13 freq lamentation (5) - 4 freq ornamentation (5) - 1 freq indentation (5) - 1 freq praisentation (5) - 6 freq orienteerin (5) - 3 freq dictation (6) - 1 freq renton (6) - 4 freq lamantation (6) - 1 freq repitition (6) - 1 freq visitation (6) - 1 freq incantation (6) - 1 freq preesentation (6) - 1 freq |
SoundEx code - O653 oriental's - 1 freq orient - 1 freq orientit - 1 freq owerwinterin - 1 freq oriental - 1 freq owerend - 1 freq ower-wintered - 1 freq ornate-wi-curlicues - 1 freq ornate - 2 freq orientated - 1 freq orienteerin - 3 freq orientation - 1 freq owermaheed - 1 freq orienteering - 1 freq |
MetaPhone code - ORNTXN orientation - 1 freq |
ORIENTATION |
| Time to execute Levenshtein function - 0.255374 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.436535 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.027914 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.037090 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.000867 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. |