diff --git a/CHANGELOG b/CHANGELOG
--- a/CHANGELOG
+++ b/CHANGELOG
@@ -1,3 +1,6 @@
+0.2.7.3 (2024-04-05):
+  * Technical Debt:
+    - Updated for GHC 9.8
 0.2.7.2 (2023-03-19):
   * Technical Debt:
     - Updated for GHC 9.6
diff --git a/bytestring-trie.cabal b/bytestring-trie.cabal
--- a/bytestring-trie.cabal
+++ b/bytestring-trie.cabal
@@ -6,11 +6,11 @@
 --    <https://github.com/haskell/cabal/issues/4899>
 
 ----------------------------------------------------------------
--- wren gayle romano <wren@cpan.org>                ~ 2023-03-19
+-- wren gayle romano <wren@cpan.org>                ~ 2024-04-05
 ----------------------------------------------------------------
 
 Name:           bytestring-trie
-Version:        0.2.7.2
+Version:        0.2.7.3
 Build-Type:     Simple
 Stability:      provisional
 Homepage:       https://wrengr.org/software/hackage.html
@@ -58,8 +58,9 @@
     GHC ==8.10.3,
     GHC ==9.0.1,
     GHC ==9.2.4,
-    GHC ==9.4.4,
-    GHC ==9.6.1
+    GHC ==9.4.8,
+    GHC ==9.6.4,
+    GHC ==9.8.1
 
 -- These are the versions of our dependencies which ship with the
 -- above.  Alas, we can't merge this with the above because cabal
@@ -98,10 +99,10 @@
     -- we verified (for GHC 7.4.1).  We no longer maintain CI tests
     -- that far back, but they still seem to work according to Hackage:
     -- <https://matrix.hackage.haskell.org/#/package/bytestring-lexing>
-    Build-Depends: base       >= 4.5   && < 4.19
-                 , bytestring >= 0.9.2 && < 0.12
+    Build-Depends: base       >= 4.5   && < 4.20
+                 , bytestring >= 0.9.2 && < 0.13
                  , binary     >= 0.5.1 && < 0.11
-                 , deepseq    >= 1.2   && < 1.5
+                 , deepseq    >= 1.2   && < 1.6
 
 -- TODO: in lieu of using CPP to expose internals to the tests/benchmarks,
 -- we should consider using:
diff --git a/src/Data/Trie.hs b/src/Data/Trie.hs
--- a/src/Data/Trie.hs
+++ b/src/Data/Trie.hs
@@ -31,7 +31,7 @@
 -- detailed enough for most users. For an extended interface with
 -- many additional functions, see "Data.Trie.Convenience". For
 -- functions that give more detailed (potentially abstraction-breaking)
--- access to the data strucuture, or for experimental functions
+-- access to the data structure, or for experimental functions
 -- which aren't quite ready for the public API, see "Data.Trie.Internal".
 ----------------------------------------------------------------
 
@@ -111,7 +111,7 @@
     (p,q') -> (p, x, q')
 
 -- | Given a query, find the longest prefix with an associated value
--- in the trie, and return that prefix, it's value, and the remainder
+-- in the trie, and return that prefix, its value, and the remainder
 -- of the query.
 --
 -- @since 0.2.4
@@ -120,7 +120,7 @@
 match t q = getMatch q <$> match_ t q
 
 -- | Given a query, find the shortest prefix with an associated value
--- in the trie, and return that prefix, it's value, and the remainder
+-- in the trie, and return that prefix, its value, and the remainder
 -- of the query.
 --
 -- @since 0.2.6