Skip to content

Corrections made in the triple qouted strings #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
rsh7 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Corrections made in the triple qouted strings #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions text.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -59,7 +59,7 @@ def add_sequence(self, words):
self.add(tuple(words[i:i + n]))

def samples(self, nwords):
"""Build up a random sample of text nwords words long, using
"""Build up a random sample of text onwords words long, using
the conditional probability given the n-1 preceding words."""
n = self.n
nminus1gram = ('',) * (n-1)
Expand Down Expand Up @@ -319,7 +319,7 @@ def all_shifts(text):

class PermutationDecoder:

"""This is a much harder problem than the shift decoder. There are 26!
"""This is a much harder problem than the shift decoder. There are 26!
permutations, so we can't try them all. Instead we have to search.
We want to search well, but there are many things to consider:
Unigram probabilities (E is the most common letter); Bigram probabilities
Expand All @@ -339,7 +339,7 @@ def __init__(self, training_text, ciphertext=None):
self.P2 = NgramTextModel(2, training_text) # By letter pair

def decode(self, ciphertext):
"Search for a decoding of the ciphertext."
"Searching for a decoding of the ciphertext."
self.ciphertext = ciphertext
problem = PermutationDecoderProblem(decoder=self)
return search.best_first_tree_search(
Expand Down