| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| resemble (0) - 3 freq resemmle (1) - 2 freq resembled (1) - 6 freq resembles (1) - 8 freq resemblin (2) - 6 freq ensemble (2) - 4 freq assemble (2) - 3 freq reassemble (2) - 1 freq rossmable (3) - 1 freq reperable (3) - 1 freq resume (3) - 6 freq tremble (3) - 6 freq reliable (3) - 5 freq rewable (3) - 1 freq assembled (3) - 15 freq refettle (3) - 1 freq reassemblet (3) - 1 freq prestable (3) - 2 freq assembly (3) - 26 freq ramble (3) - 3 freq seeable (3) - 1 freq semple (3) - 24 freq rebelle (3) - 1 freq remembir (3) - 1 freq repeople (3) - 3 freq |
resemble (0) - 3 freq resembles (2) - 8 freq resembled (2) - 6 freq resemmle (2) - 2 freq reassemble (3) - 1 freq assemble (3) - 3 freq resemblin (3) - 6 freq ensemble (3) - 4 freq rumble (4) - 9 freq ramble (4) - 3 freq rosemill (4) - 1 freq risible (4) - 1 freq assembly (4) - 26 freq assemblie (4) - 2 freq rossmable (4) - 1 freq reperable (5) - 1 freq assembled (5) - 15 freq resembling (5) - 1 freq assemblet (5) - 1 freq renewable (5) - 3 freq resile (5) - 1 freq reeshle (5) - 11 freq reestle (5) - 1 freq atremble (5) - 1 freq resounable (5) - 1 freq |
SoundEx code - R251 resumption - 1 freq reassembled - 1 freq resembles - 8 freq rognvald - 6 freq rosin-fite - 1 freq reasonable - 21 freq resembled - 6 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 - RSML resemmle - 2 freq resemble - 3 freq rosemill - 1 freq reassemble - 1 freq |
RESEMBLE |
| Time to execute Levenshtein function - 0.213663 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.382475 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.029236 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.037497 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.000941 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. |