| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rossmable (0) - 1 freq possieble (3) - 1 freq resemble (3) - 3 freq constable (3) - 24 freq rossmadden (3) - 1 freq possible (3) - 172 freq seeable (4) - 1 freq portable (4) - 9 freq sociable (4) - 7 freq profitable (4) - 4 freq rosal (4) - 1 freq prestable (4) - 2 freq unstable (4) - 1 freq hospitable (4) - 1 freq rossmc (4) - 1 freq disable (4) - 1 freq vocable (4) - 1 freq reassemble (4) - 1 freq workable (4) - 3 freq rouble (4) - 7 freq guessable (4) - 1 freq loveable (4) - 1 freq relatable (4) - 3 freq rooshae (4) - 2 freq presumably (4) - 8 freq |
rossmable (0) - 1 freq reassemble (4) - 1 freq resemble (4) - 3 freq possible (5) - 172 freq assemble (5) - 3 freq possieble (5) - 1 freq resembles (6) - 8 freq reasonable (6) - 20 freq ramble (6) - 2 freq presumably (6) - 8 freq ensemble (6) - 4 freq raisonable (6) - 1 freq possibly (6) - 54 freq resounable (6) - 1 freq resemmle (6) - 2 freq rumble (6) - 8 freq reassembled (6) - 1 freq raesonable (6) - 1 freq resembled (6) - 5 freq assembly (6) - 23 freq risible (6) - 1 freq assemblie (6) - 2 freq rosemill (6) - 1 freq constable (6) - 24 freq rossmc (6) - 1 freq |
SoundEx code - R251 resumption - 1 freq reassembled - 1 freq resembles - 8 freq rognvald - 6 freq rosin-fite - 1 freq reasonable - 20 freq resembled - 5 freq resemble - 3 freq resemblin - 6 freq resemblance - 6 freq resemblence - 1 freq reasonably - 5 freq raisonable - 1 freq resembling - 1 freq raesonable-sized - 1 freq recompense - 3 freq resemblances - 2 freq raisonablie - 1 freq resounable - 1 freq raesonable - 1 freq recumbent - 2 freq re-convenes - 1 freq reconvened - 1 freq reassemblet - 1 freq reassemble - 1 freq reasonablie - 1 freq recompance - 2 freq recompence - 2 freq €˜recompance - 1 freq €˜recompence - 1 freq recompensed - 1 freq rzmpm - 1 freq rossmable - 1 freq rogjnfx - 1 freq |
MetaPhone code - RSMBL rossmable - 1 freq |
ROSSMABLE |
| Time to execute Levenshtein function - 0.282004 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.402931 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.033204 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.048808 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.001049 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. |