| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| saleroom (0) - 1 freq ballroom (2) - 5 freq showroom (3) - 2 freq halyrood (3) - 2 freq sloom (3) - 5 freq balerno (3) - 2 freq backroom (3) - 4 freq faersom (3) - 1 freq staffroom (3) - 3 freq storeroom (3) - 3 freq saloon (3) - 1 freq wardroom (3) - 1 freq bale-oot (3) - 1 freq baallroom (3) - 1 freq laneroon (3) - 1 freq schuleroom (3) - 4 freq page-room (3) - 1 freq bathroom (3) - 44 freq lerook (3) - 4 freq bawroom (3) - 1 freq bar-room (3) - 2 freq slateroos (3) - 2 freq paterson (4) - 14 freq baler (4) - 4 freq facebook (4) - 60 freq |
saleroom (0) - 1 freq sloom (4) - 5 freq ballroom (4) - 5 freq salaried (5) - 2 freq alarum (5) - 1 freq serum (5) - 4 freq slateroos (5) - 2 freq bawroom (5) - 1 freq salaries (5) - 3 freq sacrum (5) - 1 freq sperm (5) - 5 freq seldom (5) - 27 freq siloam (5) - 2 freq salary (5) - 4 freq alarm (5) - 42 freq sullom (5) - 2 freq salome (5) - 1 freq lerook (5) - 4 freq saulers (5) - 1 freq storeroom (5) - 3 freq balerno (5) - 2 freq halyrood (5) - 2 freq showroom (5) - 2 freq slalom (5) - 1 freq saloon (5) - 1 freq |
SoundEx code - S465 schuilroom - 7 freq slurrin - 1 freq slurring - 1 freq siller-makkin - 1 freq schuil-room - 1 freq schölroom - 1 freq sillerin - 4 freq schuilruim - 1 freq siller-mounted - 1 freq saleroom - 1 freq schuleroom - 4 freq sailor-men - 1 freq |
MetaPhone code - SLRM saleroom - 1 freq |
SALEROOM |
| Time to execute Levenshtein function - 0.790165 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 - 1.398409 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.093264 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.101591 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.000856 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. |