| dc.creator (作者) | 李炯三 | zh_TW |
| dc.creator (作者) | 陳瑞成 | zh_TW |
| dc.date (日期) | 2006 | |
| dc.date.accessioned | 19-Oct-2017 09:36:47 (UTC+8) | - |
| dc.date.available | 19-Oct-2017 09:36:47 (UTC+8) | - |
| dc.date.issued (上傳時間) | 19-Oct-2017 09:36:47 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/113844 | - |
| dc.description.abstract (摘要) | 本論文發表一個改良的Boyer-Moore(BM)搜尋演算法，主要觀念是利用中文字出現頻率不同的特性，來修改比對的順序，使其在中文字串的搜尋上發揮更大的效能。本方法是以先比對搜尋字串中「最不常使用字」的方式，讓比對的次數降低，以增進搜尋的效率。根據BM演算法作者所定義的效能指標，計算比對字串所需次數與搜尋到字串前跳過字數之比值，本方法效能指標約為BM演算法的一半。 | zh_TW |
| dc.description.abstract (摘要) | This paper proposed a searching heuristic for Chinese Texts based on Boyer-Moore (BM)algorithm, using the characteristic of Chinese texts that the characters occur with unequal frequency to modify comparative sequence. It makes better performance when searching Chinese patterns. In the proposed heuristic, the character in the pattern with the least used frequency will be checked first. Thus, we can reduce the comparisons, and improve performance. According to the performance index defined by BM`s authors, dividing the number of comparisons by the number of characters passed before the pattern was found, the proposed heuristic`s performance index is about half of the original BM algorithm. | en_US |
| dc.format.extent | 182974 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | TANET 2006 台灣網際網路研討會論文集 | zh_TW |
| dc.relation (關聯) | 網際網路技術 | zh_TW |
| dc.subject (關鍵詞) | 中文字串搜尋;Boyer-Moore 演算法;最不常使用字 | zh_TW |
| dc.subject (關鍵詞) | Chinese string searching;Boyer-Moore algorithm;least frequently used character | en_US |
| dc.title (題名) | 改良Boyer-Moore搜尋演算法於中文之應用 | zh_TW |
| dc.type (資料類型) | conference | |
