Browse > Article

An Electronic Dictionary Structure supporting Truncation Search  

김철수 (서남대학교 전산정보학과)
Publication Information
Journal of KIISE:Computing Practices and Letters / v.9, no.1, 2003 , pp. 60-69 More about this Journal
Abstract
In an Information Retrieval System(IRS) based on an inverted file as a file structure it is possible to retrieve related documents when the searcher know the complete words of searching fields. however, there are many cases in which the searcher may not know the complete words but a partial string of words with which to search. In this case, if the searcher can search indexes that include the known partial string, it is possible to retrieve related documents. Futhermore, when the retrieved documents are few, we need a method to find all documents having indexes which include known the partial string. To satisfy these requests, the searcher should be able to construct a query formulation that uses the term truncation method. Also the IRS should have an electronic dictionary that can support a truncated search term. This paper designs and implements an electronic dictionary(ED) structure to support a truncation search efficiently. The ED guarantees very fast and constant searching time for searching a term entry and the inversely alphabetized entry of it, regardless of the number of inserted words. In order to support a truncation search efficiently, we use the Trie structure and in order to accommodate fast searching time we use a method using array. In the searching process of a truncated term, we can reduce the searching time by minimizing the length of string to be expanded.
Keywords
Information Retrieval System; truncation search; Trie; Electronic Dictionary;
Citations & Related Records
연도 인용수 순위
  • Reference
1 정영미, 정보검색론, 구미무역출판부, 1993
2 고미영, P-NORM 검색의 문헌 순위화 기법에 관한 실험적 연구, 연세대학교 박사학위 논문, 1992,2
3 Salton, G. and M. J. McGill, Introduction to modern Information Retrieval, New York: McGraw-Hill, 1983
4 김판구, 조유근, '상호 정보에 기반한 한국어 텍스트의 복합어 자동색인', 한국정보과학회 논문지, 21권 7호, pp.1333-1340, 1994
5 최재혁, '형태소 분석을 통한 한 · 영 자동 색인어 추출 시스템', 한국정보과학회 논문지, 23권 12호, pp. 1279-1288, 1996
6 Salton, G., E. A. Fox and Hwu 'Extended Boolean Information Retrieval', CACM VOL. 26, No. 11, pp.1022-1036, 1983   DOI   ScienceOn
7 강현규, 박세영, 최기선, '자연어 정보 검색에서 상호정보를 이용한 2단계 문서 순위 결정 방법', 한국정보과학회 논문지, 23권 8호, pp.852-861, 1996
8 E. Fredkim B. Beranek and Newman, 'Trie memory', CACM, Vol 3, pp.490-499, 1960   DOI
9 Harman D. 'An Experimental study of factors important in document ranking,' Paper presented at ACM Conference on Research and Development in information Retrieval, Pisa, Italy, 1986, pp. 186-193
10 Belkin, N.J. and W. P. Cropt, 'Retrieval technique,' Annual Review of Information Science and Technology, 22, pp. 109-145
11 Masami shishibori, Kazuhiri M and J. I. Aoe, 'The Design of a Compact Data Structure for Binary Tries', pp.573-479, 1996
12 김철수, 배우정, 이용석, J.I. Aoe, '이중배열 트라이구조를 이용한 한국어 전자 사전 구축', 한국정보과학회 논문지 23권 1호, pp. 85-94, 1996
13 J. I. Aoe, 'An Efficient Digital Search Algorithm by Using Double-array Structure,' IEEE Transaction on S/W Eng., Vol. 15, No. 9, pp. 1066-1077, 1989   DOI   ScienceOn
14 J. I. Aoe and K. Morimoto, 'An Efficient Implementation of Trie Structure,' S/W Practice and experience, Vol. 29(9), pp. 695-721, 1992   DOI
15 동아 새 국어사전, 동아출판사, 1994
16 T. G. Lewis and C. R. Cook, 'Hashing for dynamic and static internal tables', IEEE Computer, pp. 45-56, Oct. 1988   DOI   ScienceOn
17 Margo Selter, A New Hashing Package for UNIX, USENIX-Winter' 91- Dallas, TX, 1991
18 K. Moromoto, H. Iroguchi and J. I. Aoe, 'A Retrieval Algorithm of Dictionary by using Two trie Structures', 일본 전자 공학회 논문집 D-II Vol. J76-D-II No. 11, pp. 2374-2383, 1994