diff --git a/Objects/dictnotes.txt b/Objects/dictnotes.txt
index cb46cb120bd..b0e59a7f10f 100644
--- a/Objects/dictnotes.txt
+++ b/Objects/dictnotes.txt
@@ -243,7 +243,7 @@ kept just for iteration.
 Caching Lookups
 ---------------
 The idea is to exploit key access patterns by anticipating future lookups
-based of previous lookups.
+based on previous lookups.
 
 The simplest incarnation is to save the most recently accessed entry.
 This gives optimal performance for use cases where every get is followed
diff --git a/Objects/dictobject.c b/Objects/dictobject.c
index 705be078f4e..f3b6b7fda6a 100644
--- a/Objects/dictobject.c
+++ b/Objects/dictobject.c
@@ -532,7 +532,7 @@ dictresize(dictobject *mp, Py_ssize_t minused)
 /* Note that, for historical reasons, PyDict_GetItem() suppresses all errors
  * that may occur (originally dicts supported only string keys, and exceptions
  * weren't possible).  So, while the original intent was that a NULL return
- * meant the key wasn't present, it reality it can mean that, or that an error
+ * meant the key wasn't present, in reality it can mean that, or that an error
  * (suppressed) occurred while computing the key's hash, or that some error
  * (suppressed) occurred when comparing keys in the dict's internal probe
  * sequence.  A nasty example of the latter is when a Python-coded comparison