Library and Information Science

Library and Information Science ISSN: 2435-8495
三田図書館・情報学会 Mita Society for Library and Information Science
〒108‒8345 東京都港区三田2‒15‒45 慶應義塾大学文学部図書館・情報学専攻内 c/o Keio University, 2-15-45 Mita, Minato-ku, Tokyo 108-8345, Japan
Library and Information Science 20: 105-116 (1982)

原著論文Original Article

キーワード群を対象とした自動語彙変換システムAn automatic vocabulary switching system converting from keyword phrases assigned by searchers to descriptors

1慶應義塾大学文学部図書館・情報学科教授Professor, School of Library and Information Science, Keio University ◇ 〒108-8345 東京都港区三田二丁目15番45号 ◇ Mita 2-15-45, Minato-ku, Tokyo 108-8345, Japan

2慶應義塾大学大学院文学研究科図書館・情報学専攻博士課程Doctor course, Graduate School of Library and Information Science, Keio University ◇ 〒108-8345 東京都港区三田二丁目15番45号 ◇ Mita 2-15-45, Minato-ku, Tokyo 108-8345, Japan

3日本アイ・ビー・エム株式会社サイエンス・インスティチュート主任研究員Researcher, Science Institute,IBM Japan, Ltd. ◇ 〒212-0032 神奈川県川崎市幸区新川崎7番7号 ◇ Shinkawasaki 7-7, Saiwai-ku, Kawasaki-shi, Kanagawa 212-0032, Japan

発行日:1983年3月25日Published: March 25, 1983

Many searchers of online information retrieval systems are unfamiliar with the structure and content of thesauri and they usually have the problem of selecting adequate descriptors for their search. Therefore, the system which converts a set of searcher-assigned keywords to the corresponding descriptors will be quite useful and helpful for them.

This paper describes the result of an experiment on developing an automatic vocabulary switching system. It is designed to switch those keywords included in the field of “System & Control Theory”, “Control Technology”, “Computer Hardware”, “Computer Software”, and “Computer Application”. Switching is carried out by using a special conversion table.

1506 descriptors as well as 659 nondescriptors were extracted from the INSPEC thesaurus tape for this experiment. Since each descriptor has broader, narrower, related, and/or used-for terms, information about these relations was used to compile the conversion table. In addition, 1531 single words were extracted from the descriptors and nondescriptors to produce ingredients of the searcher-assigned keywords. This mapping relation between single words and descriptors was also kept in the same table. Thus, the table includes four kinds of relations among descriptors as well as whole-part relation between words and descriptors. Altogether it shows the extent of relatedness of individual single words to the descriptors included in the INSPEC thesaurus.

Input keywords are decomposed into single words, and they are collated with the words in the table. Then the relation vector of the matched words are taken from the table and summed up. Finally, each element of the resultant vector, namely descriptor, is sorted by descending order of the corresponding values and those descriptors of which order is within the range specified by the searcher are outputted.

Actual switching was done successively and the performance of the system seems to be promising although there are still several problems to be solved.

This page was created on 2021-01-28T11:47:53.198+09:00
This page was last modified on