doc: fix typos

PR #1605

crates/regex/src/literal.rs

@@ -116,7 +116,7 @@ impl LiteralSets {
         } else if lit.is_empty() {
             // If we're here, then we have no LCP. No LCS. And no detected
             // inner required literals. In theory this shouldn't happen, but
-            // the inner literal detector isn't as nice as we hope and doens't
+            // the inner literal detector isn't as nice as we hope and doesn't
             // actually support returning a set of alternating required
             // literals. (Instead, it only returns a set where EVERY literal
             // in it is required. It cannot currently express "either P or Q

crates/regex/src/matcher.rs

@@ -253,7 +253,7 @@ impl RegexMatcherBuilder {
     /// they should impose a limit on the length, in bytes, of the concrete
     /// pattern string. In particular, this is viable since this parser
     /// implementation will limit itself to heap space proportional to the
-    /// lenth of the pattern string.
+    /// length of the pattern string.
     ///
     /// Note that a nest limit of `0` will return a nest limit error for most
     /// patterns but not all. For example, a nest limit of `0` permits `a` but