JPH04264674A - Method and device for retrieving file - Google Patents

Abstract

PURPOSE:To retrieve a file including a character string taking a complicated expression method by reading a retrieval condition, consisting of a retrieval condition code composed of a classification code showing that the character string is one sentence or that straddling sentences and the logical combination of plural character strings. CONSTITUTION:The classification code shows whether the character string comes under a retrieval request in one sentence of one file or that straddling the sentences. One sentence means a unit which is segmented from a period (round mark) to the period. The retrival condition code shows the combintation of various longical relations of the character strings such as OR and AND. An operator generates the classification code and the rectrieval condition code in accordance with a retrieval target and a causes a processor to read the retrieval condition and executes a retrieval processing.

Description

[Detailed description of the invention]

0001

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a search method and apparatus for searching a file by specifying a character string in the file.

0002

2. Description of the Related Art There are many cases in which it is desired to store files created using a word processor or word processing software that include sentences (sometimes containing both in part or all) and to search for the files. Conventional file search methods involve inputting search conditions and searching for files that match the search conditions. In this case, the search conditions are: (1) If you want to search for the character string ABC, use "ABC" as the search condition and read it into the processor. (2) A file containing AB and C under a character string where two character strings AB and C exist and any character is allowed to exist between character strings AB and C. When you want to search for , use "AB*C" as a search condition and read it into the processor. (3) If two character strings AB and C exist, and one character is allowed to exist between the character strings AB and C, create a file containing AB and C. When you want to search,
Set "AB?C" as a search condition and read it into the processor. etc. Processing within the processor uses pattern matching to compare character strings in files to see if there is a character string that matches the search conditions, and outputs and displays files that have matching character strings.

0003

[Problems to be Solved by the Invention] For example, there are three files, and file 1 states, ``The circumferential layer and the Shioka body cistern show mild high absorption and are strongly enhanced by contrast...
File 2 states, ``Slightly high attenuation areas are seen in the circumferential layer and Yotsuoka body cistern, which are strongly enhanced by contrast...'', and file 3 states, ``In the circumferential layer and the Yotsuoka body cistern......'' There are almost no high-absorption areas seen in the Mawari stratum and the Yotsuoka body cistern, but the contrast is weakly enhanced when contrasted. Suppose you want to find a file with . The three sentences above include "high absorption" and "high absorption area".
Moreover, high absorption is ``seen'', ``not seen'', and ``indicated''.
It is complicated. It is difficult to find a file that "exhibits high absorption" from these three files using the conventional method.

[0004] An object of the present invention is to provide a file retrieval method and apparatus that enable retrieval of files containing character strings using complex expression methods.

[0005]

[Means for Solving the Problems] The search method of the present invention is a method of searching for a file containing a specific character string from a plurality of files containing character strings. A process of reading a search condition consisting of a category code indicating whether the search request spans over a search code and a search code consisting of a logical combination of multiple character strings, and decoding whether the search request spans one sentence or between sentences based on the category code in the search condition. This process searches each file for each sentence or sentence interval depending on the decoding result to see if there is a logical combination that matches the above search condition code, and finds a matching file. (Claim 1)

Furthermore, the logical combination in the search method of the present invention is to combine a plurality of character strings (C1, C2,..., Ci...) (hereinafter C
n, Cm), (1) If one sentence in the file contains all the character strings Cn, Cm,...
2) If one sentence in the file contains any of the character strings Cn, Cm,..., (3) 1 in the file
The sentence contains all the character strings Cn, Cm,... and other C
If any of the character strings x, cy, ... is included, (4
), one sentence in the file contains the above (1), (2), (3
) is true, and the other sentences also have the above (1),
If either of (2) or (3) holds true, (5
), if the file contains any of the character strings Cn, Cm, ... (6), if one sentence in the file does not contain all the character strings Cn, Cm, ..., (7), If the file does not contain all of the character strings Cn, Cm, ..., (8), one sentence in the file contains the character strings Cn, Cm,...
Cm,... are not included, and other character strings Cx, C
If any of y,... is included, (9), If the case (8) above holds true for one sentence in the file, and the case (8) above holds true for the other sentences, (10 ), or (8) holds true for the sentences in the file (Claim 2).

Furthermore, the search device of the present invention is a file search device that searches for a file containing a specific character string from a plurality of files containing character strings. A means for reading a search condition consisting of a category code indicating whether it is a request and a search condition code consisting of a logical combination of a plurality of character strings, and a means for decoding from the category code in the search condition whether it is a single sentence or spans between sentences. and, after this decoding, means for searching each file for each sentence or sentence interval depending on the decoding result to see if there is a logical combination that matches the search condition code, and finding a matching file. , (Claim 3).

[0008]

[Operation] According to the present invention, a search condition consisting of a classification code indicating whether it spans between one sentence or between sentences and a search condition code consisting of a theoretical combination of a plurality of character strings is read, and the corresponding file is searched. Search (Claims 1 and 3). Furthermore, according to the present invention, logical combinations enable detailed combinations and realize file searches for complex character strings (claim 2).
).

[0009]

[Embodiment] The search condition used in the present invention consists of a classification code and a search condition code. The classification code is a code indicating whether the search request is within one sentence of one file or between sentences. Here, one sentence refers to one sentence in a collection of character strings, and is a unit separated by a "." (circle) mark. In other words, it refers to the character string that exists between "." and the next ".". Spreading between sentences means spanning multiple sentences, with the above-mentioned one sentence as one unit. For example, if there is a file that says "Symptoms are severe, but the possibility of malignancy is low...", "Symptoms are severe" and "
However, the possibility of malignancy is low. ” etc. means one sentence. and. This means that ``The symptoms are severe.'' and ``However, the possibility of malignancy is low.'' are interspersed between sentences.

Furthermore, the search condition code refers to a logical combination of character strings. Logical means various logical relationships such as logical product (OR) and logical sum (AND). These character strings that are logical targets are character strings that are search targets. The operator creates classification codes and search condition codes according to search goals. The created search conditions are read into a computer (processor) and search processing is performed.

[0011] A specific example will be explained below. However, each symbol is merely an example, and other symbology may of course be used. 1
AND and OR for searching within a sentence are "*" and ", respectively.
/", and furthermore, AND and OR spanning between sentences are represented by "&
” and “|”, “()” represents one sentence, and “!” means not included. Based on this promise, various search conditions such as the following can be created. (1) Search condition expression...Cn*Cm Meaning of search condition expression...Search for files in which one sentence contains the character strings Cn and Cm. (2) Search condition expression...Cn/Cm Meaning of search condition expression...Search for files in which one sentence contains either the character string Cn or Cm. (3) Search condition expression...Cn*Cm/Cx/Cy Meaning of search condition expression...A file in which one sentence contains all of the character strings Cn and Cm, and one of the other character strings Cx and Cy Search for. (4), Search condition expression...( ) | (
) The meaning of the search condition expression...The above (1) and (2) are included in one sentence.
, (3) (written in parentheses) holds true, and any of the above cases (1), (2), and (3) hold true for other sentences as well. (5), Search condition expression...Cn|Cm Meaning of search condition expression...Search for files containing either character string Cn or Cm (6), Search condition expression...! Cn*! Cm Meaning of search condition expression...Search for files that do not contain all of the character strings Cn and Cm in one sentence. (7), Search condition expression...! Cn&! Cm Meaning of search condition expression...Search for files that do not contain all of the character strings Cn and Cm. (8), Search condition expression...! Cn*! Meaning of Cm/Cx/Cy search condition expression: Search for files in which one sentence does not contain all of the character strings Cn and Cm, but contains any of the other character strings Cx and Cy. (9), Search condition expression...! Cn*! Cm/Cx/Cy
&! Cp*Cq/Cz/Ca Meaning of search condition expression...Case (8) above holds true for one sentence,
Search for files for which case (8) above also holds true for other sentences. (10), search condition expression...! Cn*! Cm/Cx/Cy
｜! Cp*! Cq/Cz/Ca Meaning of search condition expression...Search for a file for which (8) above is satisfied in another sentence.

[0012] By using the above search condition expressions, it is possible to search for files with complex character string meanings. For example, in the case of files 1, 2, and 3, such as those in the "Problem to be Solved by the Invention" column, the search condition expression is
"High absorption*! No*! No/show/seen/seen" may be used. Conversely, in order to search for files without high absorption, the search condition expression may be set to "high absorption*no/no".

FIG. 2 shows a common bus 100 that connects a CPU 101, a main memory 102, a magnetic disk 103, and a display memory 1.
04, a search system diagram comprising a CRT 108, a controller 105, a keyboard 107, and an interface 106 for connecting with various external devices such as a printer. Various files 1, 2, 3 are stored on the disk 103.
... is stored. This file is a file created by a word processor or word processing software. There are various creation formats such as DOS format and UNIX format.

Furthermore, the CPU 101 uses the main memory 102 that stores search processing software to control the keyboard 1.
The search condition expression input from step 07 is read and the search process is executed. The CRT 108 displays various types of files such as search files. Note that input formats other than the keyboard are also possible.

Next, the processing procedure will be explained using FIG. In step 1, a search condition expression such as "high absorption*no/no" in the above example is read. In steps 2 and 3, the classification code is deciphered to determine whether the search condition expression relates to one sentence in the file or extends over multiple sentences. In the former case, jump to step 4 and read the first file from the magnetic disk. Work through the buffer to examine the first sentence in step 5. In step 6, it is checked whether the search code is satisfied or not. For example, in the above example, "high absorption"
, "No", and "No" satisfy the search request, so this file name is stored in the memory (step 9). In step 7, it is determined whether all sentences have been examined, and all sentences in the file are examined. After examining one file, load the next file and repeat steps 5-7. This process is repeated, for example, for all files with JXW in the extension part of the file name.

[0016] In steps 2 and 3, if the search instruction extends between multiple sentences in the file, jump to step 10;
Load the first file. For the sake of explanation, let us assume that the search condition is "Cn | Cm". Parameter X representing the sentence number is set to 1 (step 11). Load the Xth sentence into the buffer and check whether the character string Cn or Cm exists. If so, F(X)=1 (when Cn) or F
(X)=2 (when Cm) is set (step 14A); otherwise, F(X)=0 is set (step 14B). In step 15, it is determined whether all sentences have been examined. If not, 1 is added to X and the process returns to step 12 to repeat this process. After examining all sentences, it is determined in step 16 whether the search conditions are satisfied. For example, “Cn
| Cm'', X that satisfies f(X)<>0 is 1
It is sufficient if there are at least one. Also, “Cn & Cm”
When , there is one or more X1 satisfying f(X1)=1, f
It suffices if there is one or more X2 that satisfies (X2)=2. If the conditions are satisfied, the file name is recorded in the memory in step 20. For example, the processing from step 10 to step 17 is
Repeat for all files with JXW in the extension part of the file name.

[0017] Once you know the file name that satisfies the search conditions,
Information recorded in the file (eg, patient number) can be sent through interface 106 to other devices (eg, a database) for use.

In the above embodiment, the classification code is one sentence or between sentences, but this classification is just an example, and there are also examples of classification based on the length of character strings and examples of classification based on items. Also, although we have made two categories, it is also possible to have three or more categories.

[0019]

According to the present invention, it is possible to specify detailed search conditions and search for a corresponding file (claims 1 to 3).

[Brief explanation of the drawing]

FIG. 1 is a processing flow of the present invention.

FIG. 2 is an embodiment diagram of a search device of the present invention.

[Explanation of symbols]

100 Common bus 101 CPU 103 Magnetic disk 107 Keyboard

Claims (3)

[Claims] [Claim 1] In a method of searching for a file containing a specific character string from a plurality of files containing character strings, a classification code indicating whether a search request is made within one sentence of one file or a search request spanning between sentences; A process of reading a search condition consisting of a search condition code consisting of a logical combination of character strings, a process of decoding from the classification code in this search condition whether it is one sentence or spanning between sentences, and after this process, ,
A file search method comprising the steps of searching for a logical combination that matches the search condition code for each sentence or between sentences according to the decoding results, and finding a matching file. [Claim 2] The logical combination of claim 1 includes (1) when a plurality of character strings (C1, C2,..., Ci...) (hereinafter referred to as Cn, Cm), one sentence in the file; contains all of the character strings Cn, Cm, ..., (2), if one sentence in the file contains any of the character strings Cn, Cm, ..., (3), one sentence in the file string C
n, Cm,... are all included, and other Cx, cy,...
If one of the character strings (4) is included, one of the cases (1), (2), and (3) above holds true for one sentence in the file, and the other sentences also contain the above ((4). 1), (2), (3
) holds true, (5), if the file contains any of the character strings Cn, Cm,..., (6), one sentence in the file contains the character strings Cn, Cm
,... are not included, (7), and if the file does not contain all of the character strings Cn, Cm,..., (8
), if one sentence in the file does not include all of the character strings Cn, Cm,... and includes any of the other character strings Cx, Cy,..., (9), one sentence in the file If the case (8) above holds true for , and the case (8) above holds true for other sentences, either (10), or if the case (8) holds true for the sentences in the file. File search method. [Claim 3] In a search device containing a specific character string from a plurality of files containing character strings, a classification code indicating whether a search request is made within one sentence of one file or a search request spanning between sentences and a plurality of character strings are provided. means for reading search conditions consisting of a search condition code consisting of a logical combination of the following; means for decoding whether the classification code in the search conditions is one sentence or spanning between sentences; A file search device comprising means for searching for a logical combination matching the search condition code for each sentence or sentence interval according to the result, and finding a matching file.