| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oarwark (0) - 1 freq oanward (2) - 1 freq wabwark (2) - 3 freq orrawark (2) - 1 freq sarwar (2) - 3 freq carpark (2) - 5 freq owerwark (2) - 1 freq onwart (3) - 2 freq durward (3) - 2 freq garnard (3) - 1 freq wayward (3) - 1 freq harvard (3) - 2 freq taeward (3) - 20 freq catwalk (3) - 1 freq trark (3) - 1 freq openwark (3) - 3 freq overwork (3) - 1 freq warfare (3) - 1 freq ootwart (3) - 2 freq moorpark (3) - 10 freq atward (3) - 1 freq awauk (3) - 11 freq oarder (3) - 5 freq lanark (3) - 29 freq netwark (3) - 2 freq |
oarwark (0) - 1 freq orrawark (3) - 1 freq owerwark (3) - 1 freq waark (4) - 110 freq artwirk (4) - 1 freq artwork (4) - 5 freq airtwark (4) - 5 freq wark (4) - 892 freq awork (4) - 1 freq firewark (4) - 2 freq rewirk (4) - 1 freq earworm (4) - 1 freq dawrk (4) - 1 freq overwork (4) - 1 freq byrewark (4) - 1 freq newark (4) - 1 freq wabwark (4) - 3 freq carpark (4) - 5 freq sarwar (4) - 3 freq oanward (4) - 1 freq onwart (5) - 2 freq oardir (5) - 1 freq work (5) - 654 freq houswark (5) - 1 freq oarders (5) - 2 freq |
SoundEx code - O662 owrewrocht - 1 freq oarwark - 1 freq o'rourke - 3 freq owerairch - 1 freq owre-reachin - 1 freq owre-airched - 1 freq orrawark - 1 freq owerairchin - 3 freq ower-airchin - 3 freq owerwark - 1 freq orwrgbhifp - 1 freq |
MetaPhone code - ORWRK oarwark - 1 freq orrawark - 1 freq |
OARWARK |
| Time to execute Levenshtein function - 0.333516 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.514030 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.029526 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.042346 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.000863 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. |