JP3099683B2 - Information retrieval device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an information retrieval apparatus used for retrieving a large number of documents using an electronic computer.

[0002]

2. Description of the Related Art In recent years, as various documents have been digitized, a demand for retrieval of a large number of documents has been increased. In response to these requests, many conventional search devices extract a keyword from a document, add the keyword to the document and register it, and perform a search for that keyword when searching. Has adopted.

Hereinafter, such a conventional search apparatus will be described with reference to FIG. In FIG. 24, 2401 is a search target data storage unit, 2402 is a morphological analysis processing unit, 2403 is a morphological analysis dictionary, 2404 is word data, 2405 is a keyword extraction unit, 2406 is a keyword extraction dictionary, 2407 is keyword data, 240
8 is a search processing unit, 2409 is an input unit, and 2410 is an output unit.

[0004] The operation of the retrieval device configured as described above will be described below. First, when a registration start signal is input from the input means, the morphological analysis processing means 240
2 performs morphological analysis processing on one piece of search target data stored in the search target data storage unit 2401 with reference to the morphological analysis dictionary 2403 and obtains word data 2404.
Create

[0005] When the morphological analysis process is completed, the keyword extracting means 2405 next executes the keyword extracting dictionary 240.
6 is used to create keyword data 2407. After the above series of operations are performed on all the search target data stored in the search target data storage unit 2401, when a search condition is input from the input unit 2409, the search processing unit Reference numeral 2408 performs a keyword search and outputs the search target data stored in the search target data storage unit 2401 based on the collation result to the output unit 2
Output to 410.

[0006]

However, in the configuration of the conventional search apparatus described above, if the input search condition does not exist in the keyword data, no search is performed, and the keyword is extracted by morphological analysis. Whether it can be searched depends on whether the morphological analysis was performed correctly. In other words, if morphological analysis is not performed correctly, keyword leakage will occur, and search leakage will occur.

As another method for preventing the above-mentioned search omission, there is a full-text search method. However, since character strings that are not necessary for the search are searched, the search speed decreases as the amount of data becomes large. become.

To increase the search speed, there is a method using an index file. However, there is a problem that it takes a very long time to create an index for a large amount of data.

The present invention solves the above-mentioned problem of the prior art, and uses a full-text search for preventing a search leak without losing the information amount of the data for a large amount of data and without changing the amount of data to be searched. It is an object of the present invention to provide an information retrieval apparatus which performs high-speed retrieval by reducing the size of the information storage and further realizes resource saving of the data storage unit .

[0010]

In order to achieve this object, an information retrieval apparatus according to the present invention comprises: a search target data storage section for storing search target data; an unnecessary word dictionary storing words not to be searched; Unnecessary word deletion means for deleting words that are not to be searched from the search target data stored in the search target data storage unit using the unnecessary word dictionary, and also deleting overlapping portions of character strings in the search target data A redundant character string deleting unit, a compressed data storage unit for storing compressed data created from search target data by the unnecessary word deleting unit and the redundant deletion processing, an input unit for inputting search conditions, For the compressed data
Processing means for performing a full-text search, output means for outputting a search result of the search processing means, and unnecessary word deleting means
Unnecessary from the search target data using unnecessary word dictionary
An unnecessary word storage table for storing words,
Key word storage table to be searched by search processing means
It is characterized by the following.

[0011]

According to the present invention, an unnecessary word deleting means for deleting only unnecessary words registered in a dictionary without performing a morphological analysis process and a data not to be searched and a duplicate character string deleting means are provided. By deleting, the data capacity is further reduced. In addition, a search processing means for performing full-text search of data with such a reduced data volume is provided to prevent omission of search, to perform high-speed search , and to further store data.
Realization of device construction is realized by saving resources of storage unit .

[0012]

【Example】

Embodiment 1 Hereinafter, a first embodiment of the present invention will be described with reference to the drawings. FIG. 1 is a configuration diagram of an information search device according to an embodiment of the present invention. In FIG. 1, 1
01 is a search target data storage unit, 102 is an unnecessary word deletion unit, 103 is an unnecessary word dictionary, 104 is a duplicate character string deletion unit, 105 is a compressed data storage unit, 106 is a search processing unit,
107 is an input means, and 108 is an output means.

First, search conditions, search target data, unnecessary word dictionaries, and compressed data in this embodiment will be described.

One search condition includes a collation character string, a sum, a product,
Represented by logical symbols that represent logical relationships such as negation,
It is input by the input means 107.

The search target data in the present embodiment is a document, and is stored in the search target data storage unit 101.
One piece of document data is composed of text, images, and the like representing the contents of the document. Also, one search target data has a header for data identification such as a search target data number, and a plurality of search target data exists in one file with the above-mentioned header delimited.

The unnecessary word dictionary 103 stores unnecessary words. Unnecessary words here are, in a specific document,
Words that have no meaning in themselves and are not searched for;
For example, it indicates a symbol, a tag, a suffix, a connecting word, a noun specific to the document, and the like. Unnecessary words are words that do not need to be updated.

The compressed data is obtained by removing words that are not to be searched as unnecessary words from the data to be searched as described above, and character strings left between unnecessary words, that is, the search object A word that has been registered by removing the duplication of necessary words and separating them with delimiters. As a delimiter, a one-byte code that is not a search target is used.

One piece of compressed data is created from one piece of data to be searched, and the same header as that of the corresponding piece of data to be searched is used as a header. Exists. FIG. 2 shows an example of the search target data, the unnecessary word dictionary 103, and the compressed data described above.

The operation of the information retrieval apparatus configured as described above will be described. FIG. 3 shows the overall flow.
The overall flow is roughly divided into data registration processing and search processing. Further, the data registration processing is divided into unnecessary word deletion processing and duplicate character string deletion processing. The data registration process is performed for each search target file, and is performed until all the search target data are completed.

First, the data registration process will be described. As the data registration processing, the unnecessary word deleting unit 102
Then, compressed data to be actually searched is created in advance from the data to be searched by the duplicate character string deleting unit 104.

First, when a data registration start command is issued from the input unit 107, the unnecessary word deletion unit 102 performs an unnecessary word deletion process on one of the search target data in the file stored in the search target data storage unit 101. To start. Here, the flow of the unnecessary word deletion processing is shown in FIG.

As shown in FIG. 5, unnecessary word deleting means 1
02 is an unnecessary word calculation unit 102a and a necessary word calculation unit 102b
And the required word storage table 102c.

As unnecessary word deletion processing, the unnecessary word position extracting unit 102a refers to the unnecessary word dictionary 103, compares unnecessary words stored in the unnecessary word dictionary with search target data, and searches for unnecessary words in the search target data. Extract word position and word length. The unnecessary words are extracted by the longest matching method.

FIG. 6 shows the operation flow of the longest matching method. First, the character string is compared with the unnecessary word dictionary 103 one character at a time from the beginning of the search target data (step 1), and shifted one character at a time until a character that matches forward is found (step 2) (step 3). When a character whose front is matched is found (step 2), it is combined with the next character (step 4), and it is checked again whether or not the front matches (step 5). If the prefix does not match, the previous character string becomes an unnecessary word and the start position and length of the character are obtained (step 6).

If there is a forward match (step 5), the above operation is repeated until the forward match is no longer made (step 7). Here, if a perfect match is also established for the word that matches the head, the word is a word registered in the unnecessary word dictionary 103. A longer character string including the word is registered in the unnecessary word dictionary 103. A specific example is shown in FIG.

Subsequently, the required word calculating unit 102b calculates a character string other than the unnecessary word, that is, a required word to be searched from the obtained position and length of the unnecessary word, and stores the required word in the required word storage table 102c. Is stored. An example is shown in FIG. This completes the unnecessary word deletion processing.

Next, the flow of the duplicate character string deletion process will be described with reference to FIG. As a duplicated character string deletion process, the duplicated character string deletion unit 104 refers to the required word position storage table 102c to check for duplication of each required word, and extracts a necessary word that is not duplicated. At that time, partial matching of necessary words is recognized.

An example is shown in FIG. If the character strings A and B exist and the character string B includes the character string B (denoted as A⊇B), the character string B is treated as a duplicate character string. For example, when a television and a television are compared, the television is included in the television, so that a duplicate character string is obtained.

The header of the search target data to be processed is stored in the compressed data storage unit 105, and then the required data extracted by the above processing are separated by the above-described delimiter to form compressed data. And store.
When the duplication check / storage is completed for all necessary words of one search target data, the duplication deletion processing ends. When the duplication character string deletion processing ends for all the search target data, the data registration processing ends.

Next, the search processing will be described. FIG. 11 shows a flow of a series of search processing. When the search condition is input from the input unit 107 to all the compressed data created by the above operation, the search processing unit 106 performs a search. As a search method, a full-text search using the document itself as a search target is used. Specifically, a full-text search is performed on a character string between the delimiter of the compressed data and the next delimiter. At this time, a method of directly searching data or a method of creating an index file and performing an index search can be used. When performing an index search, a process of creating an index is performed after creating the compressed data as one of the data registration processes described above.

After performing the search process, the search processing means 106 extracts the information of the header of the collated data, and from the information of the header, searches the corresponding search target file from the search target file stored in the search target data storage unit 101. The target data is extracted and sent to the output unit 108 together with the header information and output.

More specifically, referring to FIG. 2, the search condition is set to "image data", and the search processing means 106 searches the compressed data. Then, since “image data” is present in the character string “send image data” of document number 2, the search processing means 106 sets the document number 2
Then, the search target data of the document number 2 stored in the search target data storage unit 101 is extracted, and the header information and the search target data of the document number 2 are sent to the output unit 108 and output.

As described above, according to the present embodiment, the unnecessary word deleting means 102 removes a character string which is not a search target, and the duplication deleting means 104 deletes a plurality of character strings which are unnecessary for the search. Since the data can be compressed and the capacity can be reduced while keeping the information amount as it is, the search can be performed with less search omission and at high speed. In addition, by reducing the size of the search target data, a search system using an index file can reduce the size of the index file.

Further, since the full-text search is performed on the compressed data, search omission such as the conventional keyword search can be prevented, and the search can be performed with more free search conditions than the conventional perfect match keyword search.

In the above description, a plurality of search target data are stored in one file, but a plurality of files may be stored. Also, one search target data can be stored in one file with the header of one search target data as a file name. In that case, the search processing means 10
6 performs a search process on the compressed data, retrieves the file name of the collated data, searches for the corresponding search target data file from the file name, retrieves the search target data stored therein, The output is sent to the output unit 108 together with the name.

Further, since the search target data storage unit 101 can be provided on the optical disk, the storage space for the search target data can be reduced.

(Embodiment 2) Hereinafter, a second embodiment of the present invention will be described with reference to the drawings. FIG. 12 is a configuration diagram of the information search device in one embodiment of the present invention. In FIG. 12, reference numeral 101 denotes a search target data storage unit;
Is an unnecessary word deletion unit, 103 is an unnecessary word dictionary, 104 is a redundant character string deletion unit, 105 is a compressed data storage unit, 106 is a search processing unit, 107 is an input unit, 108 is an output unit,
201 is an unnecessary word deleting unit 102 and a duplicate character string deleting unit 1
This is a compression range storage unit in which a range for compressing data is registered in advance by using a compression range 04.

A description will now be given of the compression range storage unit 1201 of the information retrieval apparatus configured as described above. The compression range storage unit 1201 registers the compression range input from the input unit 107 in advance before starting the data registration process. Whether the compression range is a combination of a compression start position and a compression end position represented by an offset from the start position of the search target data,
Alternatively, the tags of the compression start position and the compression end position are specified. An example is shown in FIG.

Next, the flow of the processing will be described. When a command to start data compression processing is input from the input unit 107, the unnecessary word deletion unit 103 causes the compression range storage unit 1
With reference to 201, a compression start position and a compression end position in the search target data are obtained. Subsequently, unnecessary word deletion processing is performed on the range of the search target data corresponding to the position obtained as described above, and then the duplicate character string deletion unit 104 performs the duplicate character string deletion processing. The structure of search target data, unnecessary word deletion processing, and duplicate character string deletion processing handled here are the same as in the first embodiment. Followed by the uncompressed search data,
That is, as shown in FIG. 13, the uncompressed data is stored in the compressed data as it is, with the delimiter character string used in the duplication elimination process as a delimiter from the compressed data. Thereafter, the flow of the search process is performed in the same manner as in the first embodiment.

As in the present embodiment, if the compression range of the search target data can be specified, it is desirable to compress only the sentence portion of a document having a word enumeration portion and a sentence portion in the text. Thus, only the desired location can be subjected to compression, and more flexible search target data can be handled.

(Embodiment 3) Hereinafter, a third embodiment of the present invention will be described with reference to the drawings. FIG. 14 is a configuration diagram of the information search device in one embodiment of the present invention. In FIG. 14, reference numeral 101 denotes a search target data storage unit;
Is an unnecessary word deleting unit, 103 is an unnecessary word dictionary, 104 is a redundant character string deleting unit, 105 is a compressed data storage unit, 107 is an input unit, 108 is an output unit, and 1401 is an unnecessary word deleting unit 102 and a redundant character string deleting unit 104. A plurality of compression range storage units 1402, each of which can specify and register a plurality of ranges for compressing data by using a search, can perform a search for each compression / non-compression range.

A description will now be given of the multiple-compression-range storage unit 1401 of the information retrieval apparatus configured as described above. Before starting the data registration process, the compression range plural storage unit 1401 registers the compression range input from the input unit 107 in advance. The method of specifying the compression range is the same as in the second embodiment. However, it differs from the second embodiment in that a plurality of compression ranges can be specified. FIG. 15 shows an example of the compression range plural storage section 1401.

Next, the overall flow will be described. When a command to start data compression processing is input from the input unit 107, the unnecessary word deletion unit 103 refers to the multiple compression range storage unit 1401 to determine the compression start position and the compression end position in the search target data by one. Can be paired. Subsequently, unnecessary word deletion processing is performed on the range of the search target data corresponding to the position obtained as described above, and then the duplicate character string deletion unit 104 performs the duplicate character string deletion processing. The structure of the search target data handled here, the unnecessary word deletion processing, and the duplicate character string deletion processing are the same as in the first embodiment. When the duplication character string deletion processing is completed for one compression range, a delimiter character that separates a necessary word from a decompression range different from the delimiter character used to separate the required word is stored. As a delimiter for the compression range, a 1-byte code or the like that is not a search target is used, like the delimiter for the necessary word.

Thus, the data registration processing for one compression range is completed. Subsequently, the search target data that is not compressed, that is, the non-compressed data, is stored as it is, separated by the delimiter of the compression range. The above-described data registration processing for all the specified compression ranges and the processing are repeated until the storage of all the uncompressed data is completed. FIG. 15 shows an example of the compressed data created as described above.

When the data registration processing is completed, the search processing means 1402 starts the search processing as in the flow of the first embodiment. The search method is the same as in the first embodiment. However, the difference from the first embodiment is that the search is performed within the range delimited by the delimiter of the compression range by the data registration process. That is, the delimiter of the compression range becomes the delimiter of the search range in the search process. As soon as the search condition is satisfied in one such range, the collation processing of the character string of one search target data ends. Subsequent operations are the same as in the first embodiment, and the header information of the collated data is extracted and the search result is sent to the output unit 108. The following is performed for all search target data.

As described above, by providing a search range and performing a search for each data sectioned as a tagged block, a logical expression used as a search condition can be effectively used. For example, a search can be performed with a search condition that is valid for a nearby character.

An example will be described with reference to FIG. If the user intends to find out about "a search device that can handle image data online", the search condition is set to "online & image data & search device", and the document number 1 shown in the figure is "claim 1", "claim" If one piece of data consisting of “item 2” and “explanation of drawings” is used as search target data, and if the search range is not set, document number 1 is hit as corresponding to the above search formula, but the range is set. If document number 1
Does not hit, and the intended result can be obtained.

Of course, when searching the whole object,
Since the entire compression range is sufficient, it can be used for various search target data.

Also, unnecessary word deletion processing and duplicate character string deletion processing are performed for each compression range. Unnecessary words are first deleted in the entire specified compression range, and then duplicate character strings are deleted for each specified compression range. Deletion processing can also be performed.

(Embodiment 4) Hereinafter, a fourth embodiment of the present invention will be described with reference to the drawings. FIG. 17 is a configuration diagram of the information search device in one embodiment of the present invention. In FIG. 17, reference numeral 101 denotes a search target data storage unit;
Is an unnecessary word deleting unit, 103 is an unnecessary word dictionary, 104 is a duplicate character string deleting unit, 105 is a compressed data storage unit, 1401
Is a compression range plural storage unit; 1701 is a search range designating unit for designating a range to be searched in the search target data;
02 is a search processing unit having a function of extracting a search range number from the search conditions and sending the search range number to the search range unit 1701;
7 is an input means, and 108 is an output means.

First, search data, compressed data, and search conditions in the present embodiment will be described with reference to FIG. The structure of the search target data is the same as in the third embodiment. Each search target data has a block-by-block structure common to all search target data. For example, in FIG. 18, the purpose, the description of the figure, the purpose, the description of the figure, and the repetition tag are included, and the purpose and the description are defined as one unit (one search target data).

Similarly to the third embodiment, the compressed data is also separated by a delimiter for separating the range of compression and non-compression.
Like the search target data, it has a structure common to each piece of compressed data.

The search condition is a search character string and a logical symbol indicating a logical relationship such as sum, product, negation, etc., and a search range which specifies the range to be searched. Attach a range number. In FIG. 18, one search target data is divided into two search ranges by one search range delimiter.

The flow of the information search apparatus having the above-described search conditions, search target data, search range designation means 1701 and search means 1702 will be described. The whole is divided into a data registration process and a search process, and the data registration process is the same as in the third embodiment.

Next, search processing performed by search processing means 1702 will be described. When the search condition is input from the input unit 107, the search processing unit 1702
Obtains the search range number to be searched from the search condition and sends it to the search range specifying means 1701.

Subsequently, the search range designating means 1701 scans from the beginning of one piece of compressed data, counts the delimiters of the range of compressed data and the range of non-compressed data, and
The start position of the data range corresponding to the search range number sent from 702 is found. Next, the found start position is specified to the search processing means 1702. Search processing means 1702 performs search processing from the designated start position to the end of the range. The search processing method is the same as in the first embodiment. The above search process is performed on all compressed data.

According to the present embodiment, it is possible to perform a search on search target data having the same structure by range, specifically, by item, and obtain desired data. .

Embodiment 5 Hereinafter, a fifth embodiment of the present invention will be described with reference to the drawings. FIG. 19 is a configuration diagram of the information search device in one embodiment of the present invention. 19, reference numeral 101 denotes a search target data storage unit;
Is an unnecessary word dictionary, 104 is a redundant character string deleting unit, 105 is a compressed data storage unit, 107 is an input unit, 108 is an output unit, and 1901 is header words of extracted unnecessary words and extraction target search target data. An unnecessary word deleting unit having a function of storing the unnecessary word in the storage table; 1902, an unnecessary word storage table for storing header information of the unnecessary word extracted by the unnecessary word deleting unit 1901 and the search target data of the extraction destination; A search processing unit having a function of searching the storage table 1902.

The structure of the unnecessary word storage table 1902 of this embodiment will be described with reference to FIG. As shown in the figure, the unnecessary word storage table 1902 stores the unnecessary word dictionary 10
A list of pairs of unnecessary words registered in No. 3 and header information of search target data from which the unnecessary words have been deleted is stored.

The flow of the information retrieval apparatus having the unnecessary word storage table 1902, the unnecessary word deleting unit 1901 and the search processing unit 1903 will be described. The whole is divided into a data registration process and a search process. Data registration process is 3rd
As in the third embodiment, the processing includes an unnecessary word deletion process and a duplicate character string deletion process. However, the unnecessary word deletion unit 1901 stores the unnecessary word extracted at the time of performing the unnecessary word deletion process and the header information of the search target data of the extraction destination in the unnecessary word storage table 1901.

For example, in FIG. 20, the character string “

[Purpose] is an unnecessary word to be deleted from the search target data, and is extracted from the document number 1 and the document number 2 of the search target data by the unnecessary word deletion unit 1901. Next, the unnecessary word deletion unit 1901 stores the character string “

[Purpose] ", and document number 1 and document number 2 are stored as a pair. Hereinafter, similarly, a pair of the unnecessary word and the header information is stored in the unnecessary word storage table 1902. The data registration processing for performing the above operation for all the search target data is completed.

Next, the flow of the search process will be described with reference to FIG. First, the search processing unit 1903 sets the input unit 1
When a search condition is input from 07, a matching character string is extracted from the search condition. Next, the search processing unit 1903 refers to the unnecessary word storage table and checks whether the above-mentioned collation character string is stored. If it is stored, it is deleted from the search target data as an unnecessary word (that is, it is not stored in the compressed data). If it is not stored in the unnecessary word storage table 1902, it means that it has not been deleted from the search target data.

The above collation character string is unnecessary word storage table 1
Referring to 902, if not stored, the search processing unit 1903 performs a search process on all compressed data as in the first embodiment.

If stored, the search processing means 190
3 acquires the header information of the search target data stored from the table. Next, a search target file is obtained from the header information. Then, the search target file and the header information obtained by the above operation are output as a search result by the output unit 1.
Send to 08. Next, data other than the search target data sent to the output unit 108, that is, the output unit 108
A search process is performed on the compressed data having no header information of the search target data sent to. The search process here is the same as in the first embodiment.

According to the present invention, even when an unnecessary word is deleted from search target data, unnecessary word deleting means 1901
Holds the deletion record in the unnecessary word storage table 1902, and the search processing unit 1903 performs the search by referring to the deletion record. Therefore, it is possible to simultaneously perform the search with less search omission while compressing the search target data.

Embodiment 6 Hereinafter, a sixth embodiment of the present invention will be described with reference to the drawings. FIG. 22 is a configuration diagram of the information search device in one embodiment of the present invention. In FIG. 22, reference numeral 101 denotes a search target data storage unit;
Is an unnecessary word dictionary, 104 is a redundant character string deletion unit, 105 is a compressed data storage unit, 107 is an input unit, 108 is an output unit, 1901 is an unnecessary word deletion unit, 1902 is an unnecessary word storage table, and 1903 is a search processing unit 2201 Deletes the specified unnecessary word from the unnecessary word dictionary 103, obtains header information of the compressed data from which the unnecessary word has been deleted by referring to the unnecessary word storage table 1902, and regenerates the unnecessary word into the corresponding compressed data. This is the data reproduction means to be stored.

The data reproducing means 2201 of this embodiment will be described with reference to FIG. Data reproduction means 2201
When an unnecessary word whose storage is to be stopped is input and designated to the unnecessary word dictionary 103 by the input means 107, first, the unnecessary word designated from the unnecessary word dictionary 103 is deleted. For example, in FIG. 23, “koto” is a target to be deleted from the search target data (FIG. 23A).

Next, referring to the unnecessary word storage table 1902, header information of the compressed data from which the unnecessary word has been deleted is obtained (FIG. 23B). Subsequently, the corresponding compressed data is searched for from the obtained header information, and an unnecessary word is attached to the last part (FIG. 23 (c)). Next, the data reproducing means 22
When the designated unnecessary word is attached to all the compressed data, 01 deletes the unnecessary word in the unnecessary word storage table 1902 and the header information of the search target data from which the unnecessary word has been deleted (FIG. 23). (B)).

The above operation is started immediately when an instruction is input from the input means 107 when the data registration process and the search process are not performed, and is reflected in the next data registration process and the search process.

According to this embodiment, the data reproducing means 220
1 provides unnecessary word dictionary 1 once as unnecessary words.
03 can be canceled immediately, and data can be reproduced by attaching the specified unnecessary words to the compressed data that has already been deleted as unnecessary words, making information retrieval easier to use. The device can be realized.

[0071]

As described above, the information retrieval apparatus of the present invention
Unnecessary word deletion means and search target data that can reduce the size of search target data without losing the information amount of search target data
Word storage table that stores unnecessary words deleted from
When, by providing the overlapping deletion means to prevent search omission, and the search can be quickly, and with reference to the deleted record
Because search can be performed, search with few search omissions
It has the effect that it can be done .

[0072]

[0073]

[0074]

[0075]

[0076]

[0077]

[Brief description of the drawings]

FIG. 1 is a configuration diagram of an information search device according to a first embodiment of the present invention.

FIG. 2 is a conceptual diagram of data according to the first embodiment of the present invention.

FIG. 3 is a flowchart showing an overall operation in the first embodiment of the present invention.

FIG. 4 is a flowchart showing unnecessary word deletion processing according to the first embodiment of the present invention.

FIG. 5 is a configuration diagram of unnecessary word deleting means in the first embodiment of the present invention.

FIG. 6 is a flowchart showing a longest matching method at the time of unnecessary word extraction in the first embodiment of the present invention.

FIG. 7 is a conceptual diagram showing a longest matching method in the first embodiment of the present invention.

FIG. 8 is a conceptual diagram of a required word calculation process and a required word storage table in the first embodiment of the present invention.

FIG. 9 is a flowchart showing a duplicate character string deletion process according to the first embodiment of the present invention.

FIG. 10 is a conceptual diagram showing a duplicate character string deletion process according to the first embodiment of the present invention.

FIG. 11 is a flowchart showing a search process according to the first embodiment of the present invention.

FIG. 12 is a configuration diagram of an information search device according to a second embodiment of the present invention.

FIG. 13 is a conceptual diagram of data according to the second embodiment of the present invention.

FIG. 14 is a configuration diagram of an information search device according to a third embodiment of the present invention.

FIG. 15 is a conceptual diagram of data according to a third embodiment of the present invention.

FIG. 16 is a conceptual diagram showing search conditions and search results according to a third embodiment of the present invention.

FIG. 17 is a configuration diagram of an information search device according to a fourth embodiment of the present invention.

FIG. 18 is a conceptual diagram of data in a fourth embodiment of the present invention.

FIG. 19 is a configuration diagram of an information search device according to a fifth embodiment of the present invention.

FIG. 20 is a conceptual diagram of data according to a fifth embodiment of the present invention.

FIG. 21 is a flowchart showing a search process according to a fifth embodiment of the present invention.

FIG. 22 is a configuration diagram of an information search device according to a sixth embodiment of the present invention.

FIG. 23 is a processing diagram of a data reproducing unit according to a sixth embodiment of the present invention.

FIG. 24 is a configuration diagram of a conventional information search device.

[Explanation of symbols]

 101 Search target data storage unit 102 Unnecessary word deletion unit 102a Unnecessary word position extraction unit 102b Necessary word calculation unit 102c Necessary word storage table 103 Unnecessary word dictionary 104 Duplicate character string deletion unit 105 Compressed data storage unit 106 Search processing unit 107 Input unit 108 Output unit 1201 Compression range storage unit 1401 Compression range multiple storage unit 1402 Search processing unit 1701 Search range designation unit 1702 Search processing unit 1901 Unnecessary word deletion unit 1902 Unnecessary word storage table 1903 Search processing unit 2201 Data reproduction unit 2401 Search target data storage unit 2402 morphological analysis processing means 2403 morphological analysis dictionary 2404 word data 2405 keyword extraction means 2406 keyword extraction dictionary 2407 keyword data 2408 search processing means 24 9 input means 2410 output means

Continuation of the front page (56) References JP-A-3-174652 (JP, A) JP-A-63-228326 (JP, A) JP-A-7-121548 (JP, A) JP-A-6-301721 (JP, A) JP-A-6-348756 (JP, A) JP-A-5-334355 (JP, A) JP-A-2-2877674 (JP, A) JP-A-5-67147 (JP, A) JP 64-31227 (JP, A) (58) Field surveyed (Int. Cl. ⁷ , DB name) G06F 17/30 JICST file (JOIS)

Claims (2)

(57) [Claims] A search target data storage unit for storing search target data; an unnecessary word dictionary storing words that are not to be searched; and an unnecessary word from search target data stored in the search target data storage unit. Unnecessary word deletion means for deleting words that are not to be searched using a dictionary, duplicated character string deletion means for also deleting overlapping portions of character strings in search target data, and the unnecessary word deletion means and the duplication deletion processing. A compressed data storage unit that stores compressed data created from the search target data, and an input unit that inputs a search condition;
A search processing means for performing a full-text search the relative compressed data in accordance with said search conditions, and output means for outputting the retrieval result of the retrieval processing unit, the unnecessary word deletion means unnecessary word dictionary
Store unnecessary words deleted from search target data using
An unnecessary word storage table for storing the unnecessary word storage table.
An information retrieval apparatus characterized in that a table is a search target of a search processing means . 2. Canceling unnecessary word registration from the unnecessary word dictionary,
The unnecessary word deletion means uses the unnecessary word dictionary to store the unnecessary words deleted from the search target data, matches the unnecessary word storage table, and adds the unnecessary words for which the unnecessary word registration has been canceled to the compressed data. from memory table and characterized in that a data reproduction means for canceling an unnecessary word registration claim 1
An information retrieval device according to item 1.