| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| orphan (0) - 14 freq orphans (1) - 35 freq orphans' (2) - 2 freq brahan (2) - 3 freq organ (2) - 16 freq €˜orphan (2) - 1 freq orphaned (2) - 4 freq opnan (2) - 1 freq orphir (2) - 3 freq forehan (2) - 4 freq orpah (2) - 2 freq quhan (3) - 51 freq ergan (3) - 1 freq bryan (3) - 17 freq shan (3) - 10 freq oocha (3) - 3 freq foran (3) - 1 freq norsman (3) - 1 freq far-han (3) - 2 freq bran (3) - 11 freq morphine (3) - 2 freq fortean (3) - 5 freq cretan (3) - 8 freq happan (3) - 2 freq lappan (3) - 1 freq |
orphan (0) - 14 freq orphans (2) - 35 freq orpah (3) - 2 freq orphir (3) - 3 freq orphaned (3) - 4 freq morphine (4) - 2 freq urchin (4) - 1 freq orpheus (4) - 4 freq arhin (4) - 1 freq truphane (4) - 2 freq rashan (4) - 2 freq hyphen (4) - 2 freq orphanage (4) - 6 freq gryphon (4) - 335 freq archin (4) - 1 freq rippan (4) - 1 freq €˜orphan (4) - 1 freq forehan (4) - 4 freq opnan (4) - 1 freq brahan (4) - 3 freq organ (4) - 16 freq rypan (4) - 1 freq phon (4) - 1 freq orphans' (4) - 2 freq hishan (5) - 1 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 - ORFN orphan - 14 freq €˜orphan - 1 freq |
ORPHAN |
| Time to execute Levenshtein function - 0.183340 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.326637 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.026880 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.036450 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.000812 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. |