| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| orrals (0) - 12 freq orral (1) - 6 freq horrals (1) - 1 freq orras (1) - 1 freq orra's (1) - 1 freq orra (2) - 172 freq obrans (2) - 1 freq grals (2) - 1 freq craals (2) - 1 freq norrads (2) - 1 freq orrae (2) - 1 freq arraes (2) - 1 freq arras (2) - 24 freq morals (2) - 10 freq orr's (2) - 4 freq borras (2) - 1 freq murals (2) - 8 freq sorraes (2) - 3 freq roals (2) - 1 freq orams (2) - 1 freq trials (2) - 18 freq forrays (2) - 1 freq norraes (2) - 1 freq ormal (2) - 1 freq organs (2) - 10 freq |
orrals (0) - 12 freq orra's (2) - 1 freq orras (2) - 1 freq orral (2) - 6 freq horrals (2) - 1 freq orr's (3) - 4 freq arraws (3) - 1 freq trials (3) - 18 freq arras (3) - 24 freq roals (3) - 1 freq murals (3) - 8 freq morals (3) - 10 freq arraes (3) - 1 freq craals (3) - 1 freq grals (3) - 1 freq royals (4) - 9 freq barls (4) - 1 freq borealis (4) - 2 freq err's (4) - 1 freq eerrans (4) - 1 freq gurls (4) - 1 freq reuls (4) - 2 freq errows (4) - 1 freq barrels (4) - 18 freq curls (4) - 36 freq |
SoundEx code - O642 orrals - 12 freq owerleukin - 4 freq oorlich - 2 freq owerlookin - 4 freq owerluikin - 6 freq owerlookit - 2 freq owrelook - 1 freq owerlook - 1 freq owerluikit - 2 freq oorie-lookin - 1 freq owerleggit - 1 freq owerluiked - 2 freq owre-like - 1 freq owreleuks - 1 freq owerluik - 2 freq orra-like - 1 freq owerluikt - 1 freq orwell's - 1 freq ower-luikin - 1 freq owerhails - 1 freq orra-leukin - 1 freq orlj - 1 freq |
MetaPhone code - ORLS orrals - 12 freq |
ORRALS |
| Time to execute Levenshtein function - 0.193028 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.502077 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.027389 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.080732 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.000766 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. |