JPH0462664A - Data retrieving device - Google Patents

Abstract

PURPOSE:To retrieve a character string having the number of characters equal to the retrieved characters out of a sentence in a time shorter than the time required for retrieving a full sentence by dividing a sentence into paragraphs and retrieving only the character string part including the same number of characters as the retrieved characters out of the head of a paragraph with skipping the character string part for each paragraph. CONSTITUTION:A sentence stored in a sentence storage means 101 is divided into paragraphs by a syntax analyzing means 102, and the number of characters of each paragraph are stored in a paragraph length storage means 103 as the paragraph storage means 103. When an optional character string is inputted from an input means 104, a retrieving means 105 refers to the paragraph length stored in the means 103 and retrieves only the character string part having the same number of characters as the retrieved characters out of the head of a paragraph after skipping the character string parts for each paragraph. Therefore the character strings having the same number of characters as the retrieved characters are skipped for each paragraph and retrieved. Thus the corresponding character string can be retrieved in a time shorter than the time needed for retrieving all characters.

Description

Detailed Description of the Invention (a) Industrial Application Field The present invention is used in document processing devices such as Japanese word processors and computers capable of creating and storing Japanese documents. The present invention relates to a data search device that searches for desired characters.

(b) Conventional technology Conventionally, in this type of data retrieval device, past documents such as patent information are stored in memory as a database, and when searching for those documents, in order to improve search efficiency, For each document, terms that represent the document, that is, typical terms used in the text, are registered in advance as search keywords, and when searching, the specified keyword and the words in each document are registered in advance. A commonly used search method is to check whether a keyword to be searched matches, and to retrieve matching documents from a database.

(c) Problems to be solved by the invention However, in such a data retrieval device,
The quality of a database is determined by what terms are selected as the keywords to be searched. Furthermore, there is a possibility that the keyword to be searched no longer matches the document as time passes.

To solve these problems, it is best to check whether the specified keyword applies to all the characters in the text of each document, regardless of the search keyword. In other words, as shown in Figure 6, if you want to search for the word "prolog" in the text of a document, for example, shift the letters in the text one by one until it is the same as the specified keyword "prolog". All you have to do is check if the spelling string exists.

However, when searching all the sentences in a document and checking whether the corresponding word can be found in this way, there is a problem that the search takes a long time.

The present invention has been made in consideration of the above circumstances, and provides a data retrieval device that divides the text of a document to be searched into clauses and searches for corresponding words by skipping each clause. It is something.

(d) Means to solve the problem FIG. 1 is a block diagram showing the configuration of the present invention.

As shown in FIG. a phrase length storage means 103 for storing the number of characters in each phrase as a phrase length; a second input means +04 for inputting an arbitrary character string as a search character;
The same character string as the search character inputted from the human power means 104 is stored in the sentence storage means 101, and when searching from within the sentence, the phrase length stored in the phrase length storage means +03 is referred to and the search character is searched from the beginning of the phrase. This data retrieval device includes a retrieval means 105 that skips and retrieves only the same number of character string portions for each clause.

In this invention, the sentence storage means 101 and the phrase length storage means 103 include a floppy disk device,
External storage devices such as magnetic disk devices are mainly used.

As the syntax analysis means 102 and the search means 105, CP
The most common method is to use a microcomputer consisting of U, ROM, RAM, and I10 board.

The input means 104 may be any device that can input any character string as a search character, such as a keyboard device, a tablet device, or a floppy disk device or magnetic disk device that can input data all at once.

(E) Effect As shown in FIG. 1, according to the present invention, the sentence stored in the sentence storage means 101 is divided into clauses by the syntax analysis means 102, and the number of characters in each divided clause is
The phrase length is stored in the phrase length storage means 103.

When an arbitrary character string or a search character is input from the input means 104, the search means 105 refers to the phrase length stored in the phrase length storage means 103, and searches for the same number of character strings as the search characters from the beginning of the phrase. The search is performed by skipping only parts for each clause.

Therefore, since the same character string as the search character is searched by skipping in clause units, it is possible to search for the corresponding character string in a shorter search time than when searching all characters.

(f) Examples Hereinafter, the present invention will be described in detail based on examples shown in the drawings. Note that this does not mean that the temperature of this invention is determined by 1°C.

FIG. 2 is a block diagram showing the configuration of an embodiment in which the present invention is applied to a Japanese word processor.

In this figure, various sentences and search characters consisting of arbitrary character strings are input into the control unit 2 using a keyboard equipped with keys such as 1 and other keys, fan keys, etc.

The control unit 2 is composed of a microcomputer consisting of a CPU, ROM, RAM, and I10 port, and the RO
According to the control program written in M, various data processing described below is performed.

Reference numeral 3 denotes a magnetic storage medium such as a floppy disk device or a magnetic disk device for inputting data from the outside, or a human-powered device such as a Bointinog device.

Reference numeral 4 denotes a display device such as a CRT display device, an LC (liquid crystal) display device, or an EL display device.

5 (a database consisting of a keyboard I and a disk device for storing various texts input from the input device 3).

Reference numeral 6 is a syntactic analysis device that is used in grammar proofing support systems such as high-end Japanese word processors, and divides input sentences containing kanji and kana into phrases.

Reference numeral 7 denotes a parsing dictionary consisting of a ROM that is referred to by the parsing device 6 when a sentence containing kanji and kana is divided into bunsetsu units.

8 indicates the keyboard l in the text stored in the database 5.
This is a search device that searches to see if there is a search character input from .

9 is a result buffer consisting of RAM, and a pointer 1 indicates the position of the searched character searched by the search device 8.
I remember it myself.

The parsing device 6 and the searching device 8 are each composed of a microprocessor.

In such a data search device of the present invention, first,
Input device 3 in the form of text data or floppy disk, etc.
, and keywords as shown in FIG. 3(a) are added to this text data from the keyboard 1. This keyword is determined by the subjectivity of the person adding it. Next, the control unit 2 sends this text data to the syntactic analysis device 6.

The syntactic analysis device W6 uses the syntactic analysis dictionary 7 to divide the received text data into clause units as shown by "/°" in FIG. It is registered in the database 5 together with keywords and sentence data as clause length data as shown in Figure 3(b).In other words, the search character is usually specified by a noun, and the noun is always located at the beginning of the clause. Pay attention to the text and divide it into clauses in advance.

When searching the database 5, a keyword search or an entire sentence search is selected from the keyboard 1. A keyword search is the same as a general database search. When searching for the entire text, when the search string is entered and the start key is pressed,
The fit control unit 2 sends the character string to be searched to the search device 8.

The search device 8 checks whether each character from the beginning of the sentence matches the search character. If they do not match, as shown in FIG. 4, the search position is calculated from the clause length data and advances to the beginning of the next clause at a time. In this way, a search is performed that is faster than a casual database search.

Next, the contents of the processing operation of the control section 2 will be explained according to the flowchart shown in FIG.

At the time of data retrieval, the control unit 2 moves the phrase length data pointer shown in FIG. 3(b) and the sentence data pointer shown in FIG. 3(c) to the beginning in step 21.
22), and further moves the pointer of the search string input from the keyboard 1 to the beginning (step 23).

Then, it is determined whether or not the text data has ended (step 24), and if it has not ended, the following processing is performed.

First, compare the first character of the text data with the first character of the search string (step 25), and if they match, advance the text data pointer by one (step 26).
), advance the search string pointer by one (step 27
), reduce the number of characters in the bunsetsu length data by 1 (step 28),
Return to step 24.

Then, in step 25, if the characters of the sentence data and the characters of the search string do not match, the pointer of the sentence data is moved to the remaining bunsetsu length data.
i- (step 29), move the clause length data pointer to the next number of characters (step 30).

In addition, in step 25, if the character string of the text data and the search character string all match, the position of the matched character string to be searched is set in the result buffer 9 (step 3
1), proceed to step 30.

In this way, when registering the database, in addition to keywords, you can register the phrase length data of sentences, and when searching, you can refer to the phrase length data and search by skipping each phrase, allowing you to simply search all of the sentence data. Can you search faster than you can?

(g) Effects of the Invention According to this invention, when searching for the same character string as a search character in a text, the text is divided into clauses, and only the part of the character string with the same number of search characters from the beginning of the clause is searched for each clause. Since the search is now performed by skipping to the beginning, you can search for the same string of characters in a text in a shorter time than searching the entire text.

[Brief explanation of drawings]

Figure 1 is a block diagram showing the configuration of this invention, Figure 2- is a block diagram showing the configuration of an embodiment of this invention, and Figure 3 (
a) to (C) are explanatory diagrams showing examples of the storage contents of keywords, phrase length data, and text data, FIG. 4 is an explanatory diagram showing the search method of the present invention, and FIG. 5 is an explanatory diagram showing the operation of the embodiment. The flowchart shown in FIG. 6 is an explanatory diagram showing a conventional all-character search method. 1.keyboard, 2.control unit, 3.input device, 4.display device, 5.database, 6.syntax analysis device, 7.
・Dictionary for syntactic analysis, 8... Search device, 9...
result buffer. Figure 11 (a) Figure 3 (b) (C) Figure 12 Figure 4 Figure 6

Claims (1)

[Claims] 1. A sentence storage means that stores sentences, a syntactic analysis means that divides the sentences stored in the sentence storage means into clauses, and a clause length storage means that stores the number of characters of each clause divided by the syntax analysis means as a clause length. an input means for inputting an arbitrary character string as a search character; and a character string that is the same as the search character inputted from the input means and stored in the phrase length storage means when searching from a sentence stored in the sentence storage means. A data retrieval device comprising a retrieval means for skipping and retrieving only a character string portion of the same number as the search characters from the beginning of a bunsetsu for each bunsetsu by referring to the bunsetsu length.