JPH07146872A - Document retrieval device - Google Patents

Abstract

PURPOSE:To shorten retrieval processing time by displaying a distribution state which matches or is similar to the retrieval character string within a retrieved document and the matching degree after an equioocation retrieval is performed for all documents and making it possible to easily confirm at which location of each document to be a retrieval object how much extent of identify of the character string with the retrieval character string exists. CONSTITUTION:A character string is inputted as a retrieval key from a client machine 4 and the matching degree of a display part is set to 70% or more by using a pointing device. The retrieval result performed in the retrieval part of a server is delivered to the client machine 4 and the document title having the matching degree more then a set threshold is displayed on the display together with the number of document titles concerned. Next, when the retrieval character string is a feed forward and a document having the matching degree of 100% is selected, a distribution table 31 is displayed as a popup window 30. The distribution table 31 is expressed by dividing the document into segments 1 to n, shows the matching degree for every segment and displays the contents of the selected segment on a right side (32).

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a document search device, and more particularly to a document search device for performing fuzzy search including incomplete matching of target character strings.

[0002]

2. Description of the Related Art Conventionally, when checking whether or not a certain character string is included in each document in a storage device in which a large number of documents are stored, it is usual that all the character strings are included. Although an exact match search was performed to check only whether or not there was a case where the search could not be performed due to a subtle difference in the description, especially when searching for a long foreign word written in katakana. Further, there is a problem that the search becomes significantly slow when the total amount of documents to be searched is large, such as the number of documents to be searched.

Therefore, in Japanese Patent Laid-Open No. 4-326164 filed by the same applicant as the applicant of the present application, autocorrelation information of each character (code) is stored for each document at the same time when the document is stored, and retrieved at the time of retrieval. By obtaining the autocorrelation information of each character in the character string and detecting the presence or absence of it, not only the presence or absence of the search character string in each search target document but also the degree of matching can be easily and quickly A search system that can be searched is disclosed. Such a system speeds up character string retrieval for each document.

However, when one document is very large, for example, if it is possible to know at which position the desired character string exists, the subsequent processing may be facilitated.
Also, if it is possible to determine at what position in the searched document there is a character string that matches the search character string, for example if the expressions do not match in the same document and you want to correct this It is effective for

[0005]

SUMMARY OF THE INVENTION The present invention has been made in view of the problems of the prior art as described above, and its main purpose is simply to determine whether or not a character string is present in a document. Not only the position of each document to be searched,
An object of the present invention is to provide a document search device capable of shortening the search processing time by making it possible to easily confirm how much the search character string matches a character string.

[0006]

SUMMARY OF THE INVENTION According to the present invention, the above-mentioned object is to search a plurality of documents stored in a storage device for a fuzzy search including an incomplete match of a character string. A device, a search unit for searching each document for a document including a character string that matches or is similar to the character string, and for determining the degree of matching of the character strings that match or is similar to the character string, A totaling processing unit for checking the distribution state of the character strings that match or similar to the character string in the retrieved document, and the distribution state of the character strings that match or similar to the character string and the degree of matching It is achieved by providing a document retrieval device characterized by having a display unit for.

[0007]

As described above, after performing a fuzzy search on all documents, by displaying the distribution state of the similar or similar to the search character string in the retrieved document and the degree of coincidence, it is possible to identify a long document. You can easily check which position the target character string is in, and even if there is a character string that does not completely match the search character string, by displaying the distribution state according to the degree of matching, It is possible to easily confirm the words whose expressions do not match in the same document. At this time, the search result of the fuzzy search is also used to display the distribution state, so that the search result of each document can be obtained together with the search result of each document by one search.

[0008]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT A preferred embodiment of the present invention will now be described in detail with reference to the accompanying drawings.

FIG. 1 is a block diagram showing the system configuration of a server / client type workstation to which the present invention is applied. This system is a mass storage device 2
And a plurality of client machines 4 connected to the server 1 via a known network 3.

A large number of documents are stored in the storage device 2. In these documents, at the time of storage, the autocorrelation information of each character (code) is simultaneously created as a map, stored as a kind of index together with the document, and managed by the server 1.

As shown in FIG. 2, the server 1 retrieves a certain character string from the above-mentioned autocorrelation information and judges the degree of coincidence. Search unit 11 for matching and determining the degree of matching
And a totalization processing unit 12 for obtaining a distribution state of a character string that matches or is similar to the above-mentioned search character string in the searched document from the search result from the search unit 11, depending on the character string. After the document search, it becomes possible to display on the display unit 13 as a distribution table or a distribution chart, which will be described later, the distribution state of the character strings matching or similar to the search character string in the searched document and the degree of matching. There is.

An outline of the operating procedure of this embodiment will be described below with reference to the flowchart of FIG.

When a search for the character string "feedforward" is performed from a client machine 4 for all the documents stored in the storage device 2, the character string is input from the client machine 4 as a "search key". The threshold value of the matching degree of the threshold value setting slider 21 displayed on the display unit 13 with a pointing device such as a mouse is set to, for example, 70
% Or more is set (search condition input: step 1). Then, the client machine 4 accesses the server 1, and the search unit 11 of the server 1 searches all documents (step 2). At this time, since the autocorrelation information of each document is created and stored in advance as a map as described above, only the autocorrelation information of the character string "feedforward" is also created and collated with the above map for high speed. You can search. The speed of this search hardly depends on the capacity of the entire document, but depends on the length of the character string to be searched.

The search result obtained by the search unit 11 is sent to the client machine 4 as it is, and the document titles having the degree of coincidence equal to or more than the set threshold value are displayed together with the number thereof on the display as shown in FIG. 3). Then, the operator, for example, clicks the "sort" key 22 in FIG. 4 with a pointing device to rearrange and display the images in descending order of coincidence.

Next, when the operator selects (clicks) one of the documents displayed in FIG. 4, for example, "levitation supporting device" (step 4), the selected document is selected. The distribution state of the character strings matching or similar to the search character string is totaled by the totalization processing unit 12 (step 5), and the distribution table 3 is displayed as a pop-up window 30 as shown in FIG.
1 is displayed (step 6). The distribution table 31 is a table for dividing a document into segments 1 to n each having a predetermined length or a variable length, and showing a matching degree of a character string that matches or is similar to a search character string in the segment for each segment. When there are a plurality of character strings that match or are similar to the search character string in one segment, the highest matching score among them is the matching score of the segment. Here, by using the search result of the fuzzy search also for collecting the distribution state, the result of determination of the distribution state can be obtained together with each document search result by one search, and the processing time can be shortened. The segments may be paragraphs, sentences, items, or the like, and may be fixed lengths depending on the document format.

When the operator selects (clicks) one segment in the distribution table 31 (step 7), the content of the selected segment is displayed as indicated by reference numeral 32 on the right side of FIG. 5 ( Step 8). In this way, the display is selectively repeated for each segment in steps 7 to 9, and the process is ended by the instruction of the operator.

In this embodiment, after the distribution table is displayed, the operator selects a desired segment to display its contents. However, for example, it matches or is similar to the search character string in the selected document. The first appearing portion of the character string to be displayed may be displayed before the operator selects it.

FIG. 6 shows a modification of the above embodiment shown in FIG.
The same parts as those in FIG. 5 are designated by the same reference numerals, and detailed description thereof will be omitted. In the present embodiment, the distribution state of the character strings that match or are similar to the search character string is totalized by the totalization processing unit 12, and the distribution chart 3 is displayed as shown on the left side of FIG.
3 is displayed on the display unit 13. Here, in this distribution chart, the horizontal line indicates one segment, and the line thickness indicates the degree of coincidence at that portion.

Also in this embodiment, when the operator selects (clicks) one segment (line) in the distribution chart 33, the contents of the selected segment are displayed as shown on the right side of FIG. The other structure is similar to that of the above embodiment.

[0020]

As is apparent from the above description, according to the document search apparatus of the present invention, after fuzzy search is performed on all documents, the search character string in the searched document is matched or similar. By displaying the distribution state and the degree of coincidence, it is possible to easily confirm at which position the target character string is located even in a long document, and if the character string that does not completely match the search character string is displayed. Even in some cases, by displaying the distribution state according to the degree of coincidence, it is possible to easily check the words whose expressions do not match in the same document, and the search processing time is shortened. At this time, by using the search result of the fuzzy search also for displaying the distribution state, the search processing time can be further shortened because the result of determination of the distribution state can be obtained together with each document search result by one search.

[Brief description of drawings]

FIG. 1 is a block diagram showing a system configuration of a server / client type workstation to which the present invention is applied.

FIG. 2 is a block diagram showing a part of a functional configuration of a server and a client machine in a server / client type workstation to which the present invention is applied.

FIG. 3 is a flowchart showing a document search procedure in a server / client type workstation to which the present invention is applied.

FIG. 4 is an explanatory diagram showing a display state of a display screen of a client machine.

FIG. 5 is an explanatory diagram showing a display state of a display screen of a client machine.

FIG. 6 is an explanatory diagram showing a display state of a display screen of a client machine.

[Explanation of symbols]

 1 Server 2 Storage Device 3 Network 4 Client Device 11 Search Unit 12 Aggregation Processing Unit 13 Display Unit 21 Threshold Setting Slider 22 “Sort” Key 30 Popup Window 31 Distribution Table 32 Content Display Area 33 Distribution Map

Claims (1)

[Claims] 1. A document search device for performing a fuzzy search including a incomplete match of a character string on a plurality of documents stored in a storage device, wherein the character string is targeted for each document. And a search unit for searching for a document containing a character string that matches or is similar to the character string, and for determining the degree of matching of the character string that matches or is similar to the character string; Document retrieval characterized by having a totalization processing unit for checking the distribution state of similar character strings, and a display unit for displaying the distribution state of character strings that match or are similar to the character string and the degree of matching apparatus.