diff --git a/src/main/java/com/hankcs/hanlp/collection/trie/DoubleArrayTrie.java b/src/main/java/com/hankcs/hanlp/collection/trie/DoubleArrayTrie.java
index e0f9b7c45..3c2be0518 100644
--- a/src/main/java/com/hankcs/hanlp/collection/trie/DoubleArrayTrie.java
+++ b/src/main/java/com/hankcs/hanlp/collection/trie/DoubleArrayTrie.java
@@ -172,7 +172,7 @@ private int insert(List<Node> siblings, BitSet used)
             resize(pos + 1);
 
         outer:
-        // 此循环体的目标是找出满足base[begin + a1...an]  == 0的n个空闲空间,a1...an是siblings中的n个节点
+        // 此循环体的目标是找出满足check[begin + a1...an]  == 0的n个空闲空间,a1...an是siblings中的n个节点
         while (true)
         {
             pos++;
@@ -1472,4 +1472,4 @@ private void shrink()
 //        }
 //        System.out.println("CheckUsed: " + nonZeroIndex);
 //    }
-}
\ No newline at end of file
+}