diff --git a/engine/quanpin/quanpin_utils.cpp b/engine/quanpin/quanpin_utils.cpp
index a80f1e1b..60a74640 100644
--- a/engine/quanpin/quanpin_utils.cpp
+++ b/engine/quanpin/quanpin_utils.cpp
@@ -980,7 +980,6 @@ std::vector<AutocorrectCut> autocorrect_cut_kbest(const std::string &pinyin, con
         AutocorrectCut cut;
         cut.edge_count = hypothesis.edge_count;
         cut.weight = hypothesis.weight;
-        cut.has_generated = hypothesis.has_generated;
         size_t position = length;
         const SearchHypothesis *current = &hypothesis;
         while (current->prev_index != kNoPredecessor)
diff --git a/engine/quanpin/quanpin_utils.h b/engine/quanpin/quanpin_utils.h
index 49eae31d..89499648 100644
--- a/engine/quanpin/quanpin_utils.h
+++ b/engine/quanpin/quanpin_utils.h
@@ -112,11 +112,6 @@ struct AutocorrectCut
     // (neighbor gau -> gai, weight 13) regardless of dictionary frequency.
     size_t edge_count = 0;
     int weight = 0;
-    // True when any edge of this cut is an out-of-table generated pair. The
-    // search itself drops generated-containing cuts whenever a pure-static cut
-    // tops the ranking, so in-table inputs consume exactly the baseline cut
-    // set.
-    bool has_generated = false;
 
     bool empty() const
     {
@@ -152,8 +147,7 @@ Segments autocorrect_cut(const std::string &pinyin, unsigned autocorrect_types);
 // when the top cut is pure static all generated cuts are dropped before
 // returning -- in-table inputs get exactly the pre-generated-space cut set,
 // and out-of-table shapes surface only when no static cut explains the input.
-// Every
-// returned cut contains at least one corrected edge, so a fully legal input
+// Every returned cut contains at least one corrected edge, so a fully legal input
 // with no correction reading yields an empty vector (the caller owns the plain
 // segmentation). This is the query-time disambiguation surface of CN 101133411
 // B: ambiguity survives the cut layer and is settled by dictionary frequency.