修正转移矩阵的频次统计方法：hankcs#434

hankcs · hankcs · commit 40c60f38590f · 2017-03-20T02:34:47.000-05:00
diff --git a/src/main/java/com/hankcs/hanlp/dictionary/TransformMatrixDictionary.java b/src/main/java/com/hankcs/hanlp/dictionary/TransformMatrixDictionary.java
@@ -114,13 +114,18 @@ public boolean load(String path)
                 total[j] = 0;
                 for (int i = 0; i < ordinaryMax; ++i)
                 {
-                    total[j] += matrix[i][j];
-                    total[j] += matrix[j][i];
+                    total[j] += matrix[j][i]; // 按行累加
                 }
             }
             for (int j = 0; j < ordinaryMax; ++j)
             {
-                total[j] -= matrix[j][j];
+                if (total[j] == 0)
+                {
+                    for (int i = 0; i < ordinaryMax; ++i)
+                    {
+                        total[j] += matrix[i][j]; // 按列累加
+                    }
+                }
             }
             for (int j = 0; j < ordinaryMax; ++j)
             {

Original file line number	Diff line number	Diff line change
`@@ -114,13 +114,18 @@ public boolean load(String path)`
`114`	`114`	`total[j] = 0;`
`115`	`115`	`for (int i = 0; i < ordinaryMax; ++i)`
`116`	`116`	`{`
`117`		`- total[j] += matrix[i][j];`
`118`		`- total[j] += matrix[j][i];`
	`117`	`+ total[j] += matrix[j][i]; // 按行累加`
`119`	`118`	`}`
`120`	`119`	`}`
`121`	`120`	`for (int j = 0; j < ordinaryMax; ++j)`
`122`	`121`	`{`
`123`		`- total[j] -= matrix[j][j];`
	`122`	`+ if (total[j] == 0)`
	`123`	`+ {`
	`124`	`+ for (int i = 0; i < ordinaryMax; ++i)`
	`125`	`+ {`
	`126`	`+ total[j] += matrix[i][j]; // 按列累加`
	`127`	`+ }`
	`128`	`+ }`
`124`	`129`	`}`
`125`	`130`	`for (int j = 0; j < ordinaryMax; ++j)`
`126`	`131`	`{`