English  |  正體中文  |  简体中文  |  Items with full text/Total items : 85349/114014 (75%)
Visitors : 22730085      Online Users : 483
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/2091

    Title: Chinese segmentation problem
    Authors: 何萬順
    Date: 1995-02
    Issue Date: 2008-09-19 14:42:47 (UTC+8)
    Abstract: The correct segmentation of a sentence into words is essential in the computerized analysis of natural languages, and the generation of a sentence involves the proper composition of individually separate words. Unlike most languages written in phonetuc alphabets, the Chinese texts do not indicate word boundaries as spacing remains constant between ideographic characters. We demonstrate the problem of segmenting a written Chinese sentence into words in the context of machine translation and present some of the previous partial solutions: pre-editing, 'maximal matching', frequence priority, and other heuristic strategies. Furthermore, we propose the use of domain-specific frequency and a 'no-window' principle in the implementation of the maximal matching strategy in combination with other heuristic rules as a more through scheme for Chinese segmentation.
    Relation: 文山評論,1,79-90
    Data Type: article
    Appears in Collections:[語言學研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    B01.pdf1497KbAdobe PDF2226View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback