JPH03118661A - Word retrieving device - Google Patents

Abstract

PURPOSE:To reduce an access area and to shorten the retrieving time for an input word by retrieving the area which is specified by the first character of the input word with the second character of the word. CONSTITUTION:The character data inputted from an input part 1 are stored continuously in a data memory 5 until the input of the word punctuation data. When the word punctuation data is inputted, the words are retrieved. Then the first character of an input word is identified and an access is given to a big headline storage part 41. Thus the offset value of a crosshead storage part 42 is read out, and the second character of the input word is identified. An access is given to the second character from the offset position of the part 42 and the header of the code of the second character is retrieved. Hereafter the accesses are given to a subhead storage part 43 from the part 42 and to a semantic memory part 44 from the part 43 respectively. Thus the meaning of the input word and other information are read out and sent to a display part 3.

Description

[Detailed Description of the Invention] Industrial Application Field The present invention is used in word processors, translators, etc.
The present invention relates to a word search device that searches for data corresponding to a word made up of multiple characters.

2. Description of the Related Art Conventionally, this type of word search device stores words in the order of the 60 syllabary characters as a dictionary, accesses the first word in the dictionary, compares it with the input word consisting of multiple characters, and finds a match. If a match could not be obtained, the next word was accessed and compared with the input word, and this process was repeated until a match was found. When a match is found, the word search device outputs the result that the input word is correct, the address of the memory that stores the meaning of the input word, and ends the processing of the word search device.

Problems to be Solved by the Invention However, in this case, a large number of words are stored in the dictionary in a predetermined order, and since each word is compared with the input word one by one, it takes a lot of time to search. It was once put away. In addition, when the input word consists of a plurality of characters, it takes time to compare it with a single word read from the dictionary to determine whether it matches, and moreover, a lot of time is required for searching.

Means for Solving the Problem In order to solve this problem, the present invention provides a first memory in which each of a plurality of characters is used as a heading and data indicating the storage location of data corresponding to each character is stored in correspondence. A second area in which data indicating the storage location of data corresponding to each character is stored in correspondence with each of the plurality of characters as a heading for each storage location of data corresponding to each character stored in the area. Equipped with a storage area, the first character of the input word
The configuration is such that a storage area is searched, and an area specified by the obtained data is searched using the second character of the input word.

Effect: With this configuration, the input word is searched by searching the area specified by the first character of the input word using the second character.

Embodiment Hereinafter, a word search device according to an embodiment of the present invention will be described in detail.

First, FIG. 1 is a block diagram showing the configuration of this embodiment. Here, reference numeral 1 denotes a character data input unit comprised of a keyboard device or the like, through which alphabetical character data, kana data, and data indicating word breaks are input. Reference numeral 2 denotes a processing section, which includes a check section 21 that performs logical processing, calculations, etc., and a program storage device 22 that stores a control program according to the flowchart shown in FIG. 3 is a display unit that displays input character data, search results, and the like. Reference numeral 4 denotes a dictionary section composed of a read-only memory and the like. Reference numeral 6 denotes a memory serving as a work area used by the processing section 2 during its processing operations.

2, 3, and 4 are schematic diagrams showing the configuration of the dictionary section 4 of this embodiment. In detail, FIG. 2 is a schematic diagram of a main heading and a middle heading, and FIG. 3 is a schematic diagram of a middle heading and a middle heading. FIG. 4 is a schematic diagram of a subheading and a smaller heading or semantic data storage section.

In FIG. 2, 41 is a large heading storage section, and 42 is a medium heading storage section. The main heading storage unit 41 is a medium heading storage unit 4 for words starting with “&”, that is, words whose first character is “a”.
2 or the address of the middle heading storage unit 42, the middle heading storage unit 42 of the word whose first character is rbJ
The offset amount in , the first character is "0", and so on are stored sequentially.

In FIG. 3, 42 is a medium heading storage area, 43 is a small heading storage area, and the first character is "a" and the second character is
The offset amount in the subheading storage section 43 of the word whose letter is raJ is stored. Next, the first letter is “a” and the second letter is “a”.
The offset amount of the first character rbJ is stored, and finally the offset amount of the first character JzJ and the second character "z" is stored.

In FIG. 4, 43 is a subheading storage section, and 44 is a meaning storage section that stores word meaning information. Subheading storage section 4
In 3, the first character is "a", the second character is "2L", and the third character is "a".
The offset amount in the meaning storage unit 44 for a word whose letter is "a" up to the offset amount of a word whose first to third letters are "z" is stored. Semantic memory part 4
4 is a word in which the first to third letters are "a" and the fourth letter and subsequent letters do not exist, followed by the fourth letter.
The character strings after the first character are given headings in alphabetical order, and their meaning information is stored.

FIG. 6 is a flowchart showing the control procedure of this embodiment. At step 82.1, the character data input from the input section 1 is accepted. Here, the input character data is stored in the memory 6 until word delimiter data is input. When the word delimiter data is input, the process moves to step S2.2 and a word search is performed. Step 82.
In step 2, the first character of the input word is identified, the large heading storage section 41 is accessed, and the offset amount in the medium heading storage section 42 is read out. Then, the second character of the input word is identified and accessed from the previously read offset position of the middle heading storage section 42 to search for the heading of the character code of the second character. Thereafter, the subheading storage section 43 is transferred from the medium heading storage section 42 to the meaning storage section 4 from the subheading storage section 43.
4 to read out the meaning of the input word and other information. Then, the data read out in step 82.3 is displayed on the display unit 3, and the process ends.

An example of dictionary search when the input character string is [dictionaryJ] will be described below with reference to FIG.

First, in the main heading, the value of the part corresponding to the first character d is checked. This value is the search position for the middle heading (
(offset from the beginning of the middle heading). Next, from the search position of the medium heading, the index part of the medium heading is compared with the second character 1, and when there is a match, the value is checked and this value is set as the search position of the subheading (offset from the beginning of the subheading). In the subheading, from the search position of the subheading, the index part of the subheading is compared with the third character C. When a match is found, the value is checked and this value is used as the search position in the dictionary part.
ionary) to obtain information on the corresponding word.

Although the above explanation has been made using English as an example, the present invention is also effective with kana data.

Effects of the Invention As described above, in the present invention, since the area specified by the first character of the input word is searched by the second character, the area to be accessed for the search is reduced. be done. Therefore, the time required to search for input words can be significantly reduced.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the configuration of a word search device according to an embodiment of the present invention, FIG. 2 is a schematic diagram showing the structure of a large heading, FIG. 3 is a schematic diagram showing the structure of a medium heading, and FIG. 6 is a schematic diagram showing the structure of a subheading, FIG. 6 is a flowchart showing the control procedure of this embodiment, and FIG. 6 is a schematic diagram showing a search example.

Claims (1)

[Claims] a first storage area that stores data indicating a search area where each of the plurality of characters is used as a heading and the first character of the input word matches the heading; and a first storage area that stores data in the first storage area. a second memory storing data indicating a search area when the second character of the input word matches the heading, with each of the plurality of characters as a heading for each area indicated by the data; The first storage area is searched using the area and the first character of the character string constituting the input word, and the search area of the second storage area indicated by the data obtained therefrom is searched for the input word. A word search device comprising a search means for searching using the second character of a character string constituting a word and reading out data related to the input word from a search area indicated by the data obtained therefrom. .