| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| orphans (0) - 35 freq orphan (1) - 14 freq orphans' (1) - 2 freq orpheus (2) - 4 freq organs (2) - 10 freq orphaned (2) - 4 freq orleans (2) - 5 freq brogans (3) - 1 freq orchard (3) - 8 freq oppens (3) - 4 freq rehns (3) - 1 freq oregano (3) - 2 freq peans (3) - 1 freq organ (3) - 16 freq mornans (3) - 1 freq orras (3) - 1 freq plans (3) - 102 freq praans (3) - 2 freq koreans (3) - 1 freq opnan (3) - 1 freq orpah (3) - 2 freq romans (3) - 43 freq bathans (3) - 1 freq ootgans (3) - 1 freq orrals (3) - 12 freq |
orphans (0) - 35 freq orphans' (2) - 2 freq orphan (2) - 14 freq orphaned (3) - 4 freq orpheus (3) - 4 freq orphanage (4) - 6 freq earphones (4) - 2 freq urchins (4) - 2 freq rehns (4) - 1 freq orichins (4) - 1 freq gryphons (4) - 1 freq orleans (4) - 5 freq organs (4) - 10 freq lochans (5) - 8 freq dolphins (5) - 6 freq bashans (5) - 1 freq i'hans (5) - 1 freq ordanis (5) - 1 freq rowans (5) - 12 freq origins (5) - 20 freq uplans (5) - 2 freq pans (5) - 23 freq morpheus (5) - 1 freq spans (5) - 1 freq morphine (5) - 2 freq |
SoundEx code - O615 orphanage - 6 freq orphaned - 4 freq orphan - 14 freq owre-abuin - 1 freq orphans - 35 freq orphans' - 2 freq ower-fain - 1 freq owerfundin - 1 freq ower-abuin - 1 freq €˜orphan - 1 freq orvnsdc - 1 freq |
MetaPhone code - ORFNS orphans - 35 freq orphans' - 2 freq |
ORPHANS |
| Time to execute Levenshtein function - 0.182694 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.358193 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.038059 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.000831 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. |