In general, a word segmentation problem can be modeled as a sequential labeling problem.
kyTea models such a problem as a binary classification problem that judges whether each two characters are segmented or not.