Research on Longest Backward Segmentation for Context

DOI

10.2991/ccis-13.2013.95How to use a DOI?

Keywords

longest backward algorithm; Chinese word segmentation; matching algorithm

Abstract

Segmentation is the basis of Chinese information processing. This paper presents us the algorithm about longest backward context for Chinese word segmentation, this method does not require labeling or semantic information, also not mechanically segment words, but automatically find word errors by real-time backtracking. Compared with simple matching algorithm, this method enhances the accuracy, adaptability and reduces some redundancy.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Huang Weichun
AU  - Jiang Jianjian
PY  - 2013/11
DA  - 2013/11
TI  - Research on Longest Backward Segmentation for Context
BT  - Proceedings of the The 1st International Workshop on Cloud Computing and Information Security
PB  - Atlantis Press
SP  - 412
EP  - 415
SN  - 1951-6851
UR  - https://doi.org/10.2991/ccis-13.2013.95
DO  - 10.2991/ccis-13.2013.95
ID  - Weichun2013/11
ER  -