| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| orte-verlag (0) - 2 freq reversal (5) - 1 freq vice-versa (5) - 1 freq reversan (5) - 1 freq pre-vers (5) - 1 freq overlap (5) - 1 freq trevelt (6) - 7 freq irreverent (6) - 1 freq revered (6) - 3 freq forever (6) - 75 freq overload (6) - 2 freq grevel (6) - 4 freq reverie (6) - 2 freq fore-erm (6) - 4 freq prevele (6) - 1 freq cleverley (6) - 1 freq grevelt (6) - 1 freq free-for-aa (6) - 1 freq steerage (6) - 6 freq steivelie (6) - 2 freq overly (6) - 6 freq re-tellin (6) - 1 freq reversed (6) - 4 freq post-mercat (6) - 1 freq northerly (6) - 3 freq |
orte-verlag (0) - 2 freq recovering (9) - 2 freq out-harled (9) - 1 freq jet-lag (9) - 1 freq re-org (9) - 1 freq overlap (9) - 1 freq reversal (9) - 1 freq vice-versa (9) - 1 freq reversan (9) - 1 freq pre-vers (9) - 1 freq ordering (10) - 3 freq reveille (10) - 1 freq reverted (10) - 1 freq revealit (10) - 2 freq revellin (10) - 3 freq revertit (10) - 4 freq trevellt (10) - 2 freq reveries (10) - 2 freq beverly (10) - 3 freq rievers (10) - 1 freq revelry (10) - 2 freq revealed (10) - 13 freq owre-early (10) - 1 freq revere (10) - 1 freq trevelled (10) - 6 freq |
SoundEx code - O631 orte-verlag - 2 freq ower-dependent - 1 freq owertappin - 1 freq ourdufc - 1 freq |
MetaPhone code - ORTFRLK orte-verlag - 2 freq |
ORTE-VERLAG |
| Time to execute Levenshtein function - 0.514096 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.926728 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.076622 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.090563 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.000932 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. |