| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| orta (0) - 1 freq orti (1) - 1 freq ora (1) - 1 freq outa (1) - 6 freq onta (1) - 2 freq orts (1) - 3 freq oota (1) - 54 freq orra (1) - 172 freq orty (1) - 1 freq orca (1) - 7 freq sorta (1) - 6 freq ort (1) - 2 freq rts (2) - 1 freq rte (2) - 2 freq north (2) - 402 freq bita (2) - 1 freq rtg (2) - 16 freq oort (2) - 8 freq worth (2) - 251 freq ontak (2) - 33 freq otz (2) - 1 freq oct (2) - 4 freq zeta (2) - 1 freq ita (2) - 10 freq eita (2) - 1 freq |
orta (0) - 1 freq orty (1) - 1 freq ort (1) - 2 freq orti (1) - 1 freq oort (2) - 8 freq rota (2) - 1 freq irt (2) - 3 freq rita (2) - 1 freq ert (2) - 18 freq art (2) - 92 freq rt (2) - 44 freq oreat (2) - 1 freq rte (2) - 2 freq arty (2) - 1 freq oota (2) - 54 freq onta (2) - 2 freq outa (2) - 6 freq ora (2) - 1 freq orra (2) - 172 freq orts (2) - 3 freq orca (2) - 7 freq sorta (2) - 6 freq owrte (3) - 1 freq route (3) - 41 freq era (3) - 30 freq |
SoundEx code - O630 owerdue - 3 freq oerdue - 1 freq owerheid - 15 freq oer-het - 1 freq owreheid - 2 freq owrehet - 1 freq owrte - 1 freq ower't - 2 freq owerdae - 1 freq oort - 8 freq ower-heid - 2 freq owerheed - 1 freq owerhead - 3 freq owredue - 2 freq oerheid - 1 freq oreat - 1 freq ort - 2 freq orty - 1 freq owerth' - 1 freq orta - 1 freq orti - 1 freq |
MetaPhone code - ORT oerdue - 1 freq owrte - 1 freq oort - 8 freq owredue - 2 freq oreat - 1 freq ort - 2 freq orty - 1 freq orta - 1 freq orti - 1 freq |
ORTA |
| Time to execute Levenshtein function - 0.224863 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.577026 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.029818 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.073532 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.001242 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. |