| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| recumbent (0) - 2 freq recurrent (2) - 2 freq incumbent (2) - 2 freq recent (3) - 71 freq remembert (3) - 10 freq resurgent (3) - 1 freq remeent (3) - 2 freq recipient (3) - 5 freq recommend (3) - 25 freq document (3) - 63 freq redcurrent (3) - 1 freq regiment (3) - 21 freq resumet (3) - 2 freq reconnect (4) - 2 freq resuman (4) - 1 freq resent (4) - 3 freq remembers (4) - 10 freq redundant (4) - 5 freq regimen (4) - 3 freq rebelt (4) - 1 freq reverent (4) - 3 freq recurring (4) - 1 freq recompense (4) - 3 freq membert (4) - 3 freq recommends (4) - 29 freq |
recumbent (0) - 2 freq incumbent (3) - 2 freq recurrent (4) - 2 freq recommend (5) - 25 freq document (5) - 63 freq recipient (5) - 5 freq regiment (5) - 21 freq remeent (5) - 2 freq remembert (5) - 10 freq recent (5) - 71 freq wycement (6) - 1 freq recommedit (6) - 1 freq remant (6) - 1 freq recenty (6) - 1 freq rumblet (6) - 1 freq remnant (6) - 7 freq remaint (6) - 1 freq recompence (6) - 2 freq argument (6) - 80 freq comment (6) - 114 freq repeyment (6) - 1 freq cement (6) - 27 freq recount (6) - 3 freq rolment (6) - 1 freq recoont (6) - 3 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 - RKMNT recommend - 25 freq recumbent - 2 freq recommendÂ… - 1 freq |
RECUMBENT |
| Time to execute Levenshtein function - 0.251000 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.480216 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.062273 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.058288 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.001130 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. |