Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
owerend (0) - 1 freq jowered (2) - 1 freq towered (2) - 1 freq owerhead (2) - 3 freq owerheed (2) - 1 freq rewerend (2) - 1 freq werena (2) - 45 freq wereny (2) - 2 freq wereni (2) - 1 freq owerheid (2) - 15 freq skerend (2) - 1 freq owerins (2) - 1 freq powered (2) - 2 freq weren (2) - 2 freq lowered (2) - 25 freq owerdid (2) - 1 freq werent (2) - 1 freq owergied (3) - 1 freq owerdae (3) - 1 freq there'd (3) - 21 freq owerseys (3) - 8 freq weynd (3) - 1 freq owsen (3) - 3 freq owerseen (3) - 4 freq reread (3) - 2 freq |
owerend (0) - 1 freq owerheid (3) - 15 freq wereni (3) - 1 freq weren (3) - 2 freq owerdid (3) - 1 freq werent (3) - 1 freq wereny (3) - 2 freq owerins (3) - 1 freq werena (3) - 45 freq owerheed (3) - 1 freq owerhead (3) - 3 freq rewerend (3) - 1 freq werna (4) - 13 freq wern (4) - 1 freq weered (4) - 3 freq trend (4) - 13 freq wend (4) - 1 freq awereddy (4) - 1 freq owned (4) - 23 freq owerdue (4) - 3 freq werenae (4) - 95 freq frend (4) - 1 freq weeren (4) - 1 freq rend (4) - 2 freq warned (4) - 36 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 - OWRNT owerend - 1 freq |
OWEREND |
Time to execute Levenshtein function - 0.193960 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.351542 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.027350 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.037793 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.000907 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. |