Chinese segmentation problem | NCCU Academic Hub

題名	Chinese segmentation problem
作者	何萬順
日期	1995-02
上傳時間	19-Sep-2008 14:42:47 (UTC+8)
摘要	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.
關聯	文山評論，1，79-90
資料類型	article

dc.creator (作者)	何萬順	zh_TW
dc.date (日期)	1995-02	-
dc.date.accessioned	19-Sep-2008 14:42:47 (UTC+8)	-
dc.date.available	19-Sep-2008 14:42:47 (UTC+8)	-
dc.date.issued (上傳時間)	19-Sep-2008 14:42:47 (UTC+8)	-
dc.identifier.uri (URI)	https://nccur.lib.nccu.edu.tw/handle/140.119/2091	-
dc.description.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.	en
dc.format.extent	1533406 bytes	-
dc.format.mimetype	application/pdf	-
dc.language	zh_TW	en
dc.language.iso	en_US	-
dc.relation (關聯)	文山評論，1，79-90	en
dc.title (題名)	Chinese segmentation problem	en
dc.type (資料類型)	article	en