diff --git a/docs/_posts/2022-10-31-luau-semantic-subtyping.md b/docs/_posts/2022-10-31-luau-semantic-subtyping.md
index 8db035b9..65db643d 100644
--- a/docs/_posts/2022-10-31-luau-semantic-subtyping.md
+++ b/docs/_posts/2022-10-31-luau-semantic-subtyping.md
@@ -161,7 +161,7 @@ type Triangle = Line
   & ((Blue) -> (Color) -> (Blue) -> false)
 ```
 
-Now, `Triangle` is a subtype of `Uncolorable`, but `Line is not`, since the line can be 2-colored.
+Now, `Triangle` is a subtype of `Uncolorable`, but `Line` is not, since the line can be 2-colored.
 This can be generalized to any finite graph with any finite number of colors, and so subtype checking is NP-hard.
 
 We deal with this in two ways: