From fefef63df44af4b021bfbf6a336c2134a6a93029 Mon Sep 17 00:00:00 2001
From: Pietro Monticone <38562595+pitmonticone@users.noreply.github.com>
Date: Thu, 30 Nov 2023 16:46:38 +0100
Subject: [PATCH] Update CM20315_Transformers.ipynb

---
 CM20315/CM20315_Transformers.ipynb | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/CM20315/CM20315_Transformers.ipynb b/CM20315/CM20315_Transformers.ipynb
index 9679cf7..7f1ecc2 100644
--- a/CM20315/CM20315_Transformers.ipynb
+++ b/CM20315/CM20315_Transformers.ipynb
@@ -175,7 +175,7 @@
     {
       "cell_type": "code",
       "source": [
-        "# TODO Modify the code below by changeing the number of tokens generated and the initial sentence\n",
+        "# TODO Modify the code below by changing the number of tokens generated and the initial sentence\n",
         "# to get a feel for how well this works.  Since I didn't reset the seed, it will give a different\n",
         "# answer every time that you run it.\n",
         "\n",
@@ -253,7 +253,7 @@
     {
       "cell_type": "code",
       "source": [
-        "# TODO Modify the code below by changeing the number of tokens generated and the initial sentence\n",
+        "# TODO Modify the code below by changing the number of tokens generated and the initial sentence\n",
         "# to get a feel for how well this works.  \n",
         "\n",
         "# TODO Experiment with changing this line:\n",
@@ -471,7 +471,7 @@
     {
       "cell_type": "code",
       "source": [
-        "# This routine reutnrs the k'th most likely next token.\n",
+        "# This routine returns the k'th most likely next token.\n",
         "# If k =0 then it returns the most likely token, if k=1 it returns the next most likely and so on\n",
         "# We will need this for beam search\n",
         "def get_kth_most_likely_token(input_tokens, model, tokenizer, k):\n",