For a similar reason as to FSR, the logarithm of AV is used as goodness measure, and only substrings with AV > 1 are considered word candidates.
we have g AV (w) = logAV (w) for a word candidate w. Boundary Entropy (Branching Entropy, BE) It is proposed as a criterion for unsupervised segmentation in some existing works (Tung and Lee, 1994;Chang and Su, 1997;Huang and Powers, 2003;Jin and Tanaka-Ishii, 2006).