Hillclimbing to solve monosubstitution ciphers

[cipher-training.git] / cipherbreak.py

diff --git a/cipherbreak.py b/cipherbreak.py
index 56143891e3290c3e0c481238cc2c41bee4bfa82f..1adebe671c17fdc029d28746c67328b208d462f3 100644 (file)
--- a/cipherbreak.py
+++ b/cipherbreak.py
@@ -29,9 +29,6 @@ from language_models import *
 # timeit.timeit('keyword_break(c5a)', setup='gc.enable() ; from __main__ import c5a ; from cipher import keyword_break', number=1)
 # timeit.repeat('keyword_break_mp(c5a, chunksize=500)', setup='gc.enable() ; from __main__ import c5a ; from cipher import keyword_break_mp', repeat=5, number=1)
 
-transpositions = collections.defaultdict(list)
-for word in keywords:
-    transpositions[transpositions_of(word)] += [word]
 
 def frequencies(text):
     """Count the number of occurrences of each character in text