| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| re-appear (0) - 1 freq reappear (1) - 6 freq reappeart (2) - 4 freq re-appearit (2) - 1 freq re-appen (2) - 1 freq reappeared (3) - 1 freq disappear (3) - 48 freq rapper (3) - 4 freq dizappear (3) - 1 freq reaper (3) - 20 freq appear (3) - 98 freq re-enter (4) - 1 freq re-spell (4) - 1 freq re-appearance (4) - 1 freq dissappear (4) - 1 freq appar (4) - 2 freq re-added (4) - 1 freq appeir (4) - 1 freq slapper (4) - 5 freq repeat (4) - 80 freq rapier (4) - 2 freq coapper (4) - 1 freq rapped (4) - 4 freq pepper (4) - 83 freq examplar (4) - 1 freq |
re-appear (0) - 1 freq reappear (2) - 6 freq re-appearit (3) - 1 freq re-appen (3) - 1 freq rapper (4) - 4 freq reappeart (4) - 4 freq appear (5) - 98 freq reepepr (5) - 1 freq ripper (5) - 10 freq reaper (5) - 20 freq dizappear (5) - 1 freq reappeared (5) - 1 freq disappear (5) - 48 freq papper (6) - 1 freq dapper (6) - 4 freq rasper (6) - 1 freq chapper (6) - 2 freq crapper (6) - 1 freq tapper (6) - 1 freq wapper (6) - 2 freq capper (6) - 2 freq knapper (6) - 2 freq reapir (6) - 1 freq drapper (6) - 1 freq flapper (6) - 5 freq |
SoundEx code - R160 river - 270 freq reappear - 6 freq rubber - 54 freq riper - 4 freq reverie - 2 freq referee - 15 freq 'rubber - 1 freq repair - 15 freq rapier - 2 freq rover - 12 freq reiver - 22 freq refer - 37 freq revoir - 5 freq raver - 4 freq rapper - 4 freq raverie - 1 freq ripper - 10 freq reaper - 20 freq riever - 2 freq robbery - 8 freq reviewer - 2 freq rubbery - 7 freq rïver - 5 freq robber - 3 freq ryver - 1 freq reveiry - 1 freq reapir - 1 freq reever - 2 freq re-fere - 1 freq rubbir - 1 freq rpr - 2 freq revere - 1 freq re-appear - 1 freq riviera - 1 freq robfray - 1 freq |
MetaPhone code - RPR reappear - 6 freq riper - 4 freq wrapper - 22 freq repair - 15 freq rapier - 2 freq rapper - 4 freq ripper - 10 freq reaper - 20 freq reapir - 1 freq rpr - 2 freq re-appear - 1 freq |
RE-APPEAR |
| Time to execute Levenshtein function - 0.312759 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.449108 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.033114 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.040996 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.000986 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. |