| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| revolushion (0) - 2 freq revolusshon (2) - 3 freq revolushun (2) - 14 freq revolution (2) - 30 freq reivolution (3) - 1 freq evolution (3) - 10 freq devolution (3) - 31 freq revolutions (3) - 4 freq revolution' (3) - 1 freq revulsion (3) - 3 freq resolution (3) - 19 freq devolutioun (4) - 1 freq revolutionar (4) - 1 freq exclusion (4) - 3 freq revelation (4) - 27 freq demolishin (4) - 1 freq relishin (4) - 2 freq l'evolution (4) - 1 freq poushion (4) - 1 freq revision (4) - 9 freq evolutions (4) - 1 freq revolvin (4) - 1 freq seclusion (4) - 1 freq revelaetion (4) - 1 freq roushian (4) - 1 freq |
revolushion (0) - 2 freq revolushun (2) - 14 freq revolusshon (3) - 3 freq revolution (4) - 30 freq revulsion (4) - 3 freq revolyooshun (5) - 1 freq revalooshun (5) - 1 freq relishin (5) - 2 freq reivolution (5) - 1 freq devolution (6) - 31 freq revoltin (6) - 1 freq revision (6) - 9 freq revolvin (6) - 1 freq revolution' (6) - 1 freq demolishin (6) - 1 freq revelation (6) - 27 freq resolution (6) - 19 freq revolutions (6) - 4 freq evolution (6) - 10 freq roushian (6) - 1 freq revelaetion (6) - 1 freq realisin (7) - 14 freq reveisioun (7) - 1 freq refreshin (7) - 6 freq flushin (7) - 5 freq |
SoundEx code - R142 reflectin - 22 freq reflect - 30 freq ripples - 8 freq roubles - 1 freq replace - 21 freq replies - 78 freq reflection - 35 freq reflectit - 16 freq replacement - 12 freq ruffles - 1 freq rebels - 21 freq replaced - 52 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 - 12 freq replica - 4 freq reflected - 12 freq rebellious - 5 freq reveals - 10 freq reflecting - 1 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 - RFLXN revelation - 27 freq revolution - 30 freq revulsion - 3 freq revolution' - 1 freq revelaetion - 1 freq reivolution - 1 freq €œraivulushun - 1 freq reffelation - 1 freq revalooshun - 1 freq revolushun - 14 freq revolushion - 2 freq |
REVOLUSHION |
| Time to execute Levenshtein function - 0.210482 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.391874 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.033274 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.039375 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.001164 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. |