A Partial match technique for multi-attribute keys and its text retrieval application

多属性键的部分匹配技术及其文本检索应用

• 批准号: 07558273
• 负责人: AOE Junichi
• 金额: $ 1.98万
• 依托单位: The University of Tokushima
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (A)
• 财政年份: 1995
• 资助国家: 日本
• 起止时间: 1995 至 1997
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-07558273/
• 关键词: partial match; keyword search; multi-attribute keys; text data base; information vetrieval; 多属性検索; 文書処理

Extracting keywords efficiently is an important task in text retrieval systems. In Japanese text, there are many compound words consisting some kinds of characters (Katakana, Kanji, etc.) and the text has no delimiter among words. Therefore, extracting keywords from such a text takes a lot of time. This research presents a technique of detecting keywords from compound keywords by introducing a set of rules, which represents multi-attribute conditions for keywords conctruction. A string pattern matching machine for a finit number of patterns is applied to matching of the rules and storing keyword candidates together with information bout both long term and short term words. The approach is estimated by theoretical analysis. By the simulation results for 34 Japanese text files, it has been that the algorithm presented has performed 19.4ms/KB and that the ratio of extracting expected keywords increase from the traditional approaches.

高效地提取关键词是文本检索系统中的一项重要任务。在日语文本中，有许多由某些类型的字符(片假名、汉字等)组成的复合词。文本中的单词之间没有分隔符。因此，从这样的文本中提取关键词需要花费大量的时间。本研究提出了一种从复合关键词中检测关键词的技术，通过引入一组规则来表示关键词构造的多属性条件。用于有限数量模式的串模式匹配机被应用于规则的匹配，并将关键字候选与关于长期和短期单词的信息一起存储。通过理论分析对该方法进行了评价。对34个日文文本文件的模拟结果表明，该算法的性能为19.4ms/KB，与传统方法相比，提取期望关键词的比率有所提高。

项目成果

H.Mochizuki: "A Substring Search Algorithm in Extendeble Hashing" International Journal of Information Science. (印刷中). (1998)

H. Mochizuki：“可扩展散列中的子串搜索算法”国际信息科学杂志（1998 年出版）。

泓田 正雄: "大規模文書データに対する用例文の効率的検索アルゴリズム" 情報処理学会論文誌. 38・10. 2004-2013 (1997)

Masao Hiuda：“大规模文档数据的例句的高效搜索算法”日本信息处理学会会刊 38・10 2004-2013（1997）。

M.Shishibari: "An Order Searching Algorithm of Extensible Hashing" Intnational J.of Computer Mathematics. (1996)

M.Shishibari：“可扩展散列的顺序搜索算法”国际计算机数学杂志。

S.Shishibori: "Design of a Compact Data Structure for the Patricia Trie" IECE Trans. on Information and Systems. (印刷中). (1998)

S.Shishibori：“Patricia Trie 的紧凑数据结构的设计”IECE Trans on 信息和系统（1998 年出版）。

T.Arita, M.Shishibori and J.Aoe: "An Efficient Algorithm for Full Text Retrieval for Multiple Keywords" International Journal of Information Sciences. Vol.104. 345-362 (1988)

T.Arita、M.Shishibori 和 J.Aoe：“多关键词全文检索的高效算法”国际信息科学杂志。