| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rorang (0) - 1 freq morag (2) - 36 freq rowans (2) - 12 freq roland (2) - 2 freq rang (2) - 82 freq rowan (2) - 18 freq moran (2) - 8 freq forgang (2) - 1 freq thrang (2) - 221 freq vrang (2) - 8 freq romans (2) - 43 freq loyang (2) - 3 freq raring (2) - 2 freq roan (2) - 4 freq 'wrang (2) - 1 freq foran (2) - 1 freq boran (2) - 2 freq roaring (2) - 5 freq brang (2) - 2 freq roman (2) - 76 freq dorans (2) - 1 freq rwran (2) - 1 freq boring (2) - 13 freq sprang (2) - 17 freq wrang (2) - 811 freq |
rorang (0) - 1 freq raring (2) - 2 freq roaring (2) - 5 freq arrange (3) - 14 freq wrang (3) - 811 freq boring (3) - 13 freq trang (3) - 15 freq orange (3) - 136 freq crang (3) - 2 freq roaran (3) - 4 freq brang (3) - 2 freq rang (3) - 82 freq vrang (3) - 8 freq luring (4) - 1 freq ironing (4) - 3 freq rising (4) - 14 freq ring (4) - 213 freq orangey (4) - 2 freq grange (4) - 4 freq wrong (4) - 140 freq dring (4) - 1 freq raing (4) - 1 freq brung (4) - 21 freq rearan (4) - 1 freq tring (4) - 1 freq |
SoundEx code - R652 roaring - 5 freq rearrangin - 2 freq rear-eyn's - 1 freq reruns - 1 freq rearranged - 2 freq reuerence - 1 freq rearranging - 1 freq rearrange - 1 freq rorang - 1 freq re-arranged - 1 freq rearrangement - 1 freq raring - 2 freq re-runs - 1 freq |
MetaPhone code - RRNK roaring - 5 freq rorang - 1 freq raring - 2 freq |
RORANG |
| Time to execute Levenshtein function - 0.196147 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.381957 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.027921 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.045820 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.001179 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. |