| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
Texts in Japanese use many characters, Japanese alphabet kana and Chinese letter kanji, unlike texts in European languages. For that reason, Japanese characters are represented by 2-byte code in most ...computer systems. In many cases, the usual 1-byte characters are used together with 2-byte characters. In this paper, we discuss pattern matching algorithms for Japanese texts, in which 1-byte characters and 2-byte characters are mixed. We have already succeeded to realize run-time efficient pattern matching machines for texts of 1-byte characters by dividing character codes. We show that the method of dividing character codes is also applicable to pattern matching machines for Japanese texts.続きを見る
|
Mendeley出力
