| 首字词最大匹配法与最大匹配法的复杂性比较 |
| |
| 引用本文： | 李红斌 方连众. 首字词最大匹配法与最大匹配法的复杂性比较[J]. 哈尔滨工业大学学报, 1993, 25(5): 27-31 |
| |
| 作者姓名： | 李红斌 方连众 |
| |
| 作者单位： | 哈尔滨工业大学应用软件教研室，哈尔滨工业大学计算机科学与工程系 讲师 |
| |
| 摘 要： | 分析了最大匹配法中匹配字段选取长度及匹配结束问题，提出了首字词最大匹配法，在此基础上计算时间复杂性。
|
| 关 键 词： | 信息处理 最大匹配法 首字词 |
The Complexities of the Maximum Matching Method of Words with the Same Head Chineses Character and the Maximum Matching Method |
| |
| Li Honghin Fong Lianzhong. The Complexities of the Maximum Matching Method of Words with the Same Head Chineses Character and the Maximum Matching Method[J]. Journal of Harbin Institute of Technology, 1993, 25(5): 27-31 |
| |
| Authors: | Li Honghin Fong Lianzhong |
| |
| Affiliation: | Dept.of Computer Science and Engineering |
| |
| Abstract: | After the problom of how to select the matching character string in the maximum matching method is analysed,the maximum matching method of words with the same head Chineses character is presented.Based on it,the time camplexity of thismethod is also given. |
| |
| Keywords: | Chincses information processing maximum matching method time complexity |
| 本文献已被 CNKI 维普 等数据库收录！ |
