In our opinion, whether a character string should be blocked from becoming an eligible word candidate depends not only on the word-formation power of each component itself but also on the internal juncture probabilities between these components.
we employ the word-based word-formation power and the internal word juncture probability to capture these features and define three conditions for filtering these ineligible candidates in our algorithm.. Let w= el e2 • el denote a potential word candidate, then these conditions can be formally defmed as followings: (1) Word-length condition: If w is an eligible word candidate, then its length 1w f< TL .