| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| resemblin (0) - 6 freq resembling (1) - 1 freq resembled (2) - 5 freq resellin (2) - 1 freq resembles (2) - 8 freq assemblin (2) - 1 freq resemble (2) - 3 freq dissemblin (3) - 1 freq resemmle (3) - 2 freq retellin (3) - 4 freq revellin (3) - 3 freq dreeblin (3) - 3 freq repeoplin (3) - 2 freq assemblie (3) - 2 freq respellin (3) - 1 freq rememberin (3) - 4 freq resumin (3) - 1 freq assemblan (3) - 1 freq sembling (3) - 1 freq revealin (3) - 14 freq resemblence (3) - 1 freq resemblance (3) - 6 freq resettin (3) - 1 freq remembir (3) - 1 freq reelin (3) - 16 freq |
resemblin (0) - 6 freq resembling (2) - 1 freq assemblin (3) - 1 freq resemble (3) - 3 freq resembles (3) - 8 freq resembled (3) - 5 freq resemblence (4) - 1 freq resemblance (4) - 6 freq ramblin (4) - 4 freq assemblan (4) - 1 freq rumblin (4) - 12 freq resellin (4) - 1 freq reeshlin (5) - 6 freq resemmle (5) - 2 freq tremblin (5) - 15 freq gemblin (5) - 1 freq rumblan (5) - 1 freq sembling (5) - 1 freq dissemblin (5) - 1 freq respellin (5) - 1 freq assemblie (5) - 2 freq resumin (5) - 1 freq rememberin (5) - 4 freq amblin (6) - 2 freq assembly (6) - 23 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 - RSMLN resemblin - 6 freq wry-smilin' - 1 freq |
RESEMBLIN |
| Time to execute Levenshtein function - 0.232925 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.435880 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.037729 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.049039 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.000818 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. |