Abstract | A character-based CWS decoder is to find the highest scoring tag sequence t over the input character sequence c, i.e. |
Abstract | A word-based CWS decoder finds the highest scoring segmentation sequence w that is composed by the input character sequence c, i.e. |
Abstract | From this view, the highest scoring tagging sequence is computed subject to structural constraints, giving us an inference alternative to Viterbi decoding. |