By Topic

A new method of finding provisional boundaries of “bunsetsu” using 2nd-order Markov model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Araki, T. ; Fac. of Eng., Fukui Univ., Japan ; Ikehara, S. ; Tuchihase, J.

As Japanese sentences are usually written using thousand kinds of characters especially “kanji” characters, it is not easy to input them into computer files. There has been much research on the method which translates the non-segmented “kana” sentences into the “kanji-kana” sentences. However, the amount of computer memory required for the translating processing explodes in many times, because the number of the combinations of candidates for “kanji-kana” words grows rapidly in proportion to the increasing of the length of the sentence. The memory explosion can be prevented if a sentence is separated into “bunsetsu” This paper proposes a new method of finding provisional boundaries of “bunsetsu” of non-segmented “kana” sentences using 2nd-order Markov chain probabilities. “Relevance factor” P and “Recall factor” R for provisional boundaries of “bunsetsu” determined by this method, were evaluated by experiment using the statistical data for 70 issues of a daily Japanese newspaper

Published in:

Robot and Human Communication, 1993. Proceedings., 2nd IEEE International Workshop on

Date of Conference:

3-5 Nov 1993