X-Git-Url: https://git.njae.me.uk/?a=blobdiff_plain;f=slides%2Fcaesar-break.html;fp=slides%2Fcaesar-break.html;h=81a8396f6d7d8d67b841d5925e17c2a545e4405f;hb=3d76ab459f6ecbd96e5dae3939830b3a67431cb7;hp=090c43f9147340b37e2f6e11ef213c93a1320a39;hpb=7203ac94911556e2b4bf4caab6f5285445faed3b;p=cipher-training.git

diff --git a/slides/caesar-break.html b/slides/caesar-break.html
index 090c43f..81a8396 100644
--- a/slides/caesar-break.html
+++ b/slides/caesar-break.html
@@ -112,6 +112,8 @@ How do we define "closeness"?
 
 ## Abstraction: frequency of letter counts
 
+.float-right[![right-aligned Letter frequencies](letter-frequency-treemap.png)]
+
 Letter | Count
 -------|------
 a | 489107
@@ -146,7 +148,7 @@ Letter      | i       | f       | m       | m       | p       | ifmmp
 ------------|---------|---------|---------|---------|---------|-------
 Probability | 0.06723 | 0.02159 | 0.02748 | 0.02748 | 0.01607 | 1.76244520 × 10<sup>-8</sup>
 
-(Implmentation issue: this can often underflow, so get in the habit of rephrasing it as `\( \sum_i \log p_i \)`)
+(Implmentation issue: this can often underflow, so we rephrase it as `\( \sum_i \log p_i \)`)
 
 Letter      | h       | e       | l       | l       | o       | hello
 ------------|---------|---------|---------|---------|---------|-------