| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reflections (0) - 10 freq reflections' (1) - 1 freq reflecktions (1) - 1 freq reflection (1) - 34 freq reflecting (2) - 1 freq reflectioun (2) - 1 freq reflectin' (2) - 2 freq elections (2) - 47 freq reflectin (2) - 22 freq deflection (2) - 2 freq selections (2) - 1 freq reflectors (2) - 2 freq inflections (2) - 1 freq refleckin (3) - 4 freq electrons (3) - 1 freq relaetions (3) - 2 freq predeections (3) - 1 freq deflecting (3) - 1 freq selection (3) - 28 freq reflectan (3) - 3 freq inflection (3) - 2 freq rejection (3) - 7 freq infections (3) - 5 freq deflectin (3) - 1 freq rendeitions (3) - 2 freq |
reflections (0) - 10 freq reflection (2) - 34 freq reflecktions (2) - 1 freq reflections' (2) - 1 freq reflectors (3) - 2 freq reflectin (3) - 22 freq inflections (3) - 1 freq reflectioun (3) - 1 freq reflecting (3) - 1 freq reflectin' (3) - 2 freq elections (4) - 47 freq afflictions (4) - 1 freq deflection (4) - 2 freq reflectan (4) - 3 freq selections (4) - 1 freq reflects (4) - 23 freq re-election (5) - 1 freq collections (5) - 26 freq reflectit (5) - 16 freq reactions (5) - 7 freq reflective (5) - 3 freq recollections (5) - 1 freq redictions (5) - 1 freq relations (5) - 14 freq affections (5) - 2 freq |
SoundEx code - R142 reflectin - 22 freq reflect - 29 freq ripples - 8 freq roubles - 1 freq replace - 21 freq replies - 75 freq reflection - 34 freq reflectit - 16 freq replacement - 12 freq ruffles - 1 freq rebels - 21 freq replaced - 51 freq rifles - 13 freq reflects - 23 freq reflex - 2 freq revulsion - 3 freq reflections' - 1 freq refleckin - 4 freq refleckit - 8 freq raipwalkin - 1 freq reply's - 6 freq riflecter - 1 freq reflections - 10 freq replica - 4 freq reveals - 10 freq reflecting - 1 freq reflected - 11 freq rebellious - 4 freq reflecks - 8 freq reflective - 3 freq reflectively - 2 freq refleck - 18 freq refills - 1 freq reflexology - 1 freq 'rebellious - 1 freq rivals - 3 freq rufillus - 1 freq ruifless - 2 freq replicatin - 1 freq reflexive - 15 freq replicatit - 1 freq reflectan - 3 freq replacin - 5 freq refleks - 1 freq reflekkit - 3 freq reflekkin - 1 freq replicaetion - 1 freq reevles - 1 freq re-plaster - 1 freq replacing - 1 freq reflectin' - 2 freq replicate - 2 freq revolyooshun - 1 freq replication - 2 freq reflexively - 2 freq replaessed - 1 freq rebels' - 1 freq 'reflexive' - 1 freq replacit - 1 freq reflek - 3 freq riffles - 2 freq raffles - 3 freq raploch - 2 freq rabels - 1 freq replaces - 1 freq replacements - 2 freq reflectioun - 1 freq replicant - 1 freq €œraivulushun - 1 freq roblox - 1 freq revels' - 1 freq reflectors - 2 freq ropelawsheil - 4 freq reflecktions - 1 freq replicas - 1 freq refleksivlee - 1 freq reflekts - 1 freq reflexes - 1 freq repealist - 1 freq replays - 1 freq revalooshun - 1 freq rabwilson - 3 freq revolushun - 14 freq replacement' - 1 freq “rebels” - 1 freq revolushion - 2 freq revolusshon - 3 freq |
MetaPhone code - RFLKXNS reflections' - 1 freq reflections - 10 freq reflecktions - 1 freq |
REFLECTIONS |
| Time to execute Levenshtein function - 0.202196 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.359440 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.028022 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.036907 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.000815 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. |