JPH07287716A - Dictionary search device - Google Patents

Abstract

(57) [Summary] [Purpose] To search for a medium dictionary or a document similar to a dictionary. [Structure] The dictionary index search control unit 10 receives the search key information from the dictionary search control unit 9, searches the index of the target dictionary, searches for a record candidate of a dictionary that matches the search condition, and selects the candidate dictionary body. 15 addresses to the dictionary search control unit 9
Pass to. The dictionary body search control unit 11 receives the search key information and the address of the candidate dictionary body, searches the dictionary body 15, and finally collates the search key information. It has compression means for compressing the dictionary data in record units by an arbitrary method, and compression dictionary data obtained by compressing the dictionary data by the compression means. For the search, an index recording the compression dictionary data and the compression dictionary record position is used.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a dictionary search device,
More specifically, the present invention relates to a dictionary search device for performing document creation, document proofreading, and sentence refinement. For example, it is applied to all OA devices such as word processors, personal computers, and personal word processors.

[0002]

BACKGROUND OF THE INVENTION The use of various indexes to speed up searches is widely practiced. It is also very common to have a one-character or multi-character index. In addition, in order to speed up the search, an index having all the portions that are likely to be the search key is also common. Furthermore, the method of creating an index and the method of searching generally differ depending on the nature of the search key and the specified contents of the search key (forward match, backward match, arbitrary, etc.). For example, "Read the electronic book version of Kojien" (ASCII, Vol.15,
# 12 December 1991 pp.331-332).
Regarding dictionary compression, for example, Japanese Patent Laid-Open No. 57-15 is used.
It is proposed in Japanese Patent No. 0070, etc. Further, as for a compression technique of a dictionary for converting kana to kanji, for example, Japanese Patent Laid-Open No.
It is proposed in Japanese Patent Publication No. 1-285573.

In a dictionary or a large amount of character string data, it is widely used to use various indexes in order to speed up the search for the necessary contents. The following methods are generally used for dictionaries. Usually, a dictionary has some headings, and the headings are sorted in a character code order or a form close thereto. For example, in the case of a Japanese language dictionary, the heading has reading and notation, and then the part-of-speech name, lexical and the like are described. Headings are usually arranged in a reading order called lexicographical order (although it depends on the dictionary).

In a Japanese dictionary, the most popular search method for a dictionary is a search by reading a headline. This is used when looking up words that have a certain reading. In addition, when the reading is included at the beginning, it is also used when examining the word of the reading and the words before, after, and near it. On the other hand, since the heading notation corresponds to the reading, the dictionary as a whole is not arranged in a fixed order. In particular, apart from dictionaries arranged in the order of notation, it is difficult to search only by notation.
There are dictionaries and dictionaries that are indexed so that they can be drawn to some extent.

Although the above description of the dictionary refers to a paper dictionary, the same applies to recent electronic dictionaries. Most electronic dictionaries retain the image of paper dictionaries. However, with the help of a computer, it became possible to easily perform more diverse ways of searching. For example, if the target word is clear and the object is used as a key, the exact match search that extracts the target word itself, the prefix match search that includes the key in the head, the suffix match search that has the key in the tail, and the part of the key There is an arbitrary search that is included in, a conditional search that can be associated with a keyword included in a description such as not only a heading, but a fuzzy search that searches for a word similar to an ambiguous description.

[0006] For example, in order to realize the prefix matching of reading,
A heading reading index (a multi-step index from one character to the maximum reading character) may be provided. In addition, in the backward matching search of the reading, an index with a heading that reverses the reading is provided,
For the search key, the character string may be inverted. A simple ambiguous search method is to convert a character string that tends to be ambiguous when creating an index in advance and register it. In the conditional search, it suffices to previously associate a keyword with a related word. A database construction tool is generally provided as a tool that can realize these functions on a computer to some extent.

[0007]

As described above, in the conventional dictionary search device, in the case of a dictionary or document having a small capacity,
Searching is relatively easy. That is, the data of the text of the dictionary or the document should be swept from the beginning to find the one that meets the key condition. These search tools are also provided as auxiliary tools on general computers, editors, and word processor functions. However, dictionary data is generally large and requires a large storage capacity. Moreover, at present, the speed of a computer including a storage device is not fast enough to swipe dictionary data from the head, and to achieve the various search functions described above, it is necessary to pull it quickly. It uses a large amount of index data and, in some cases, a fairly complex search mechanism to meet its purpose. Further, in order to have a rich search function, the index sometimes becomes larger than the original contents of the dictionary (the original contents description).

A number of methods are known for compressing text data such as a dictionary, and a very efficient method is known for compressing the entire text data as it is. However, when compression involving search is required as in the present case, it is necessary to decompress the compressed data from an arbitrary location, and these methods cannot be simply applied as they are. For example, compression of a dictionary for converting Kana to Kanji is known as compression of a dictionary, and a dictionary with a high compression rate largely depends on the content or structure of dictionary data and is not common.

The present invention has been made in view of the above circumstances, and searches for a medium-sized dictionary or a document similar to a dictionary by utilizing the power of a current computer, and particularly, for maintaining or improving the dictionary. When referring to other dictionary data with, the appropriate search is performed, and the storage capacity of the dictionary data is generally large. Various conventional compression techniques are applied to each dictionary record. Applied to
Make it easy to search in a compressed state of the dictionary body, and mainly target dictionary data, but you can consider them as simple text data, and the capacity is small for a wider range of text data. In addition, the search speed is practical, and moreover, in recent Japanese text processing systems, it is almost always said that the input means is equipped with some kana-kanji conversion system. Is accompanied by a dictionary (kana-kanji conversion dictionary) containing the information of the notation corresponding thereto, and the dictionary is slightly different from the dictionary containing general words and explanations mainly used in the present invention, but the reading heading is in some form. Since it has the notation information corresponding to, it is an object of the present invention to provide a dictionary search device that effectively uses that information for compressing dictionary data.

[0010]

In order to achieve the above object, the present invention provides (1) a dictionary search apparatus for searching a dictionary in which data having readings or notations or other information is stored in record units. In, compression means for compressing the dictionary data in a record unit by an arbitrary method, compressed dictionary data obtained by compressing the dictionary data by the compression means, and each character of reading or notation which is a target of the search key,
It has a one-character index which is an index associating record positions on the compression dictionary, and includes a character extracting means for extracting a character in the search key when a search key is specified, and a character extracted by the character extracting means. Position extraction means for extracting the position of the compressed record in the compression dictionary, and decompressing the compressed record in the compression dictionary at the position extracted by the position extraction means into the original dictionary record and comparing the dictionary record with the search key Means and a display means for extracting and displaying records matching the search key, and further, (2) the character index is sorted for each character (in the order of the character code), and the compressed record position on the compression dictionary is displayed. It consists of a registered index and an index that registers the block start position for each character of the index,
Furthermore, (3) when comparing the dictionary record with the search key, the search key is a compressed search key compressed in the same manner as the compression dictionary, and the compressed record and the compressed search key are compared,
Extracting and displaying records matching the search key, (4) providing an index recording each compressed record position in the compression dictionary, and (5) creating an index for each record in the dictionary. The range is specified by character position, and the range of decompressing the compressed record at the time of search is limited to the range, and (6) the range of indexing each record in the dictionary is delimited. It is specified by a symbol, and the decompression range of the compressed record at the time of retrieval is limited to that range. Furthermore, (7) the reading of the dictionary record is set to the reading position of the heading of the Kana-Kanji conversion dictionary for document input. Compressing by storing, (8) compressing the notation of the dictionary record by storing the position of the heading notation of the kana-kanji conversion dictionary for document input, and (9) the above Compressing the commentary or commentary part of the record by storing the notation position of the kana-kanji conversion dictionary for document input, and (10) in (7), the kana-kanji conversion dictionary for document input (11) In (8) or (9), the heading whose reading is short is not stored, and the heading in which the Kana-Kanji conversion dictionary for inputting the document is short is not stored. Further, (12) above (7)-
In any one of (11), the reading or notation that does not correspond to the kana-kanji conversion dictionary is characterized by having a dictionary corresponding to the address information of the kana-kanji conversion dictionary.

[0011]

The dictionary search device of the present invention having the above-mentioned structure is
(1) The dictionary data is compressed in a record unit by an arbitrary method, and the dictionary data has compressed dictionary data. Each character of reading or notation, which is a target of the search key, and the record position on the compression dictionary are stored. It has an associated index (one-character index), and when a search key is specified, the character in the search key is extracted, the compressed record position in the compression dictionary that includes the character is extracted, and the position is compressed in the compression dictionary. It is decompressed into the dictionary record of the record source, compared with the search key, and the record matching the search key is extracted and displayed. As a result, since the dictionary data to be searched is compressed in record units, the storage capacity of the dictionary body can be reduced, and the device can be realized with a smaller storage capacity.

(2) The one-character index is sorted for each character (in the order of the character code), and the index (index 2) in which the compressed record position in the compression dictionary is registered and the block start position for each character of the index are registered. Since it consists of the index (index 1),
By using the index character position range information at the time of creating the index, the search range of the start position including each character can be prevented from being unnecessarily searched at the time of positioning the start, and the extraction of the line of the search result can be further speeded up. (3) When comparing the dictionary record with the search key, the search key is used as a compressed search key compressed by the same method as the compression dictionary, the compressed record is compared with the compressed search key, and the record matching the search key is extracted and displayed. Therefore, the data length of the compressed record is generally larger than that of the search key, and the compression of the search key only needs to be performed once. Therefore, the compressed record can be matched with the search key without being decompressed. Can obtain conformance information at high speed.

(4) Since the index recording each compressed record position of the compression dictionary is provided, when the data matching the search key and the data around it are extracted (referenced) collectively, the extraction range depends on the index. , Because it can be grasped in advance, it can be taken out faster.
(5), (6) The limit of the index creation range of each record in the dictionary is specified by a character position or a delimiter, and
The range of decompressing compressed records at the time of search can be limited to that range, and the range of decompressing compressed records can be limited according to the limitation of the range of index creation in the dictionary. Decompression of the compressed record outside the limited range can be omitted, and the matching with the search key can be performed faster.

(7) Since the reading of the dictionary record is compressed by storing the reading position of the heading of the kana-kanji conversion dictionary for document input, the character string of the reading part of the dictionary is read of the heading of the kana-kanji conversion dictionary. By replacing with the position information of the copy, the reading part of the dictionary can be effectively compressed. (8) Since the notation of the dictionary record is compressed by storing the position of the heading notation of the kana-kanji conversion dictionary for document input, the character string of the notation part of the dictionary is the position information of the notation part of the heading of the kana-kanji conversion dictionary. By replacing with, it is possible to effectively compress the notation part of the dictionary.

(9) Since the comment or commentary part of the dictionary record is compressed by storing the position of the notation in the kana-kanji conversion dictionary for document input, the character string of the commentary or commentary part of the dictionary is stored in the kana-kanji conversion dictionary. By replacing it with the position information of the notation part of the headline, it is possible to effectively compress the commentary or commentary part of the dictionary. (10) Since the kana-kanji conversion dictionary for inputting documents does not store headings with short readings, the kana-kanji conversion dictionary does not store position information although the headings have short readings, which is more effective for compression. Since the position information can be stored only in the character string portion with a small data length, the compression effect can be further enhanced.

(11) Since the heading with a short description in the Kana-Kanji conversion dictionary for document input is not stored, the position information is stored without storing the heading in the Kana-Kanji conversion dictionary. Only the character string part that has a compression effect can be stored with a data length with little position information,
Further, the compression effect can be enhanced. (12) For readings or notations that do not correspond to the Kana-Kanji conversion dictionary,
Since it has a dictionary that corresponds to the address information of the Kana-Kanji conversion dictionary, a character string that does not match the reading or notation of the Kana-Kanji conversion dictionary heading, in the form that corresponds to the position information (address information) of the Kana-Kanji conversion dictionary, By having a dictionary in which position information is associated with reading or notation, the dictionary can be accessed easily and at high speed.

[0017]

Embodiments will be described below with reference to the drawings. FIG. 1 is a configuration diagram for explaining an embodiment of a dictionary search device according to the present invention. In the figure, 1 is a display unit, 2 is an input unit, 3 is an external storage unit, 4 is a printing unit, and 5 is a control unit. Section, 6 is an input / edit control section, 7 is a dictionary search support section, 8 is an output control section, 9 is a dictionary search control section, 10 is a dictionary index search control section,
Reference numeral 11 is a dictionary body search control unit, 12 is an output display control unit, 1
Reference numeral 3 is a setting information management table, 14 is a dictionary index, and 15 is a dictionary body.

The structure is the same as that of a general OA device such as a personal computer and a word processor. At the center is a control unit 5 for controlling the whole, a general-purpose microcomputer,
Alternatively, it is realized by a dedicated LSI or the like. It also has a peripheral device display, keyboard, floppy, printer, etc. that handles input / output and memory. Further, under the control unit 5, there is a portion for controlling data input, editing, storage, and printing, which are realized by firmware, a dedicated LSI, or the like.

In the example of FIG. 1, the dictionary search support unit 7 is composed of a dictionary search control unit 9, a dictionary index search control unit 10, a dictionary body search control unit 11, and an output display control unit 12. The dictionary search control unit 9 is in charge of the entire reference search of the dictionary. It also interprets and manages the setting information required for reference retrieval for various dictionaries. Based on the support of the dictionary search control unit 9, the dictionary index search control unit 10 receives the search key information from the dictionary search control unit 9, searches one or more indexes of the target dictionary, and matches the search condition. The dictionary search control unit 9 is passed the address of the dictionary body of the candidate searched for.

The dictionary body search control unit 11 receives the search key information and the dictionary body 15 of the candidate under the command of the dictionary search control unit 9.
, The dictionary body 15 is searched, and the search key information is finally collated. The output display control unit 12 receives the setting information of the output display method of the dictionary record from the dictionary search control unit 9, processes the record to be output in the dictionary according to the setting information, and sends it as the record output information to the dictionary search control unit 9. The dictionary search control unit 9 displays the search result by sending the record output information to the output control unit 8 via the control unit 5. In addition, the input information coming from the above-mentioned keyboard and the kana-kanji conversion for Japanese input are under the input / edit control unit 6, and the editing / storing / printing of data is performed by the input / edit control unit 6. It is performed under the control unit 8.

FIG. 2 is a diagram showing an example of a dictionary for performing a search according to the present invention. In this example, "reading", "notation", "part of speech", and "word slang" are the contents of the dictionary. The "serial number" represents the serial number of the dictionary record (row) (normally, the serial number is not included in the contents of the dictionary). A compression dictionary is prepared by compressing the dictionary data having the concept of records in this format in record units by an appropriate compression algorithm in advance or at the time of index creation described below. Search for
This compression dictionary and the index recording the position of the compression dictionary record described below are used.

FIGS. 3A and 3B are examples of data showing the process of creating the search index of the present invention from the example of the dictionary shown in FIG. Here, an example of creating a one-character index for the "reading" part is shown. One character is sequentially taken out from the reading portion of FIG. 2, and the line position of the compression dictionary corresponding to the line position of the dictionary containing the character is recorded in the form of a table. This is performed for all records in the dictionary (FIG. 3 (a)). Next, this table is sorted in the order of character code and compression dictionary line position in pairs of (reading characters) and (compression dictionary line position). As a result, an index of one character is obtained by pairing the character and the compression dictionary line position (see FIG. 3).
(B)).

In this index, for each character, the line position (compressed dictionary line position) of the dictionary containing the character is recorded continuously. By using this index, it is possible to know the line position of the compression dictionary including any one reading character. Figure 3 (a),
In (b), an example of creating an index for "reading" is shown, but an index for "notation" can be created in the same manner. With this index,
The compression dictionary can be searched by referring to the index range of the part including the character of the search key. However, if the number of dictionary records is large to some extent, the amount of indexes also increases, and it takes time to search the indexes. Next, an actual search method will be described using an example of using an index configuration that complements this point in FIG.

FIGS. 4A to 4D are views for explaining the concept of the search method of the present invention shown in the search example. For example, the search key "ai" for reading is given (Fig. 4 (a)).
Then, the index 1 is searched by using the first character "A" in the search key as a key (FIG. 4 (b)). The index 1 is the index shown in FIG. 4B, which records the start position of each character (more accurately, the line number (serial number) of the index 2).
Is a table recording the compression dictionary row positions having the same contents as in FIG. However, the column of (character) in FIG. 4B is omitted because the correspondence with the column for describing the compression dictionary line position can be found in the index 1. The index 1 can be created at the same time when the index of FIG. 4 is created (see FIG. 5 described later).

The index 1 is searched for a match with the key "a" in order from the beginning "-" in the illustrated character column (sequential search).
(Refer to the arrow shown in FIG. 4B). In addition, a binary search (binary search) method may be used instead of the sequential search.
As a result, the start position (index 2 line number) “002770” of “A” of index 2 is obtained. Further, the end position “007937” of “a” is obtained from the start position “007938” of “i” in the index 2.

From now on, all dictionary line numbers (index 2) described in the "dictionary line number (position)" column of "a" of index 2
(Serial number) 002770 to 007937), the records in the compression dictionary body are sequentially read out, decompressed, and checked to see if they match the search key "ai", and as a result, the matched record is output. The above is one of the embodiments of the search method of the present invention based on the example of FIG.

FIG. 5 is a diagram showing a schematic flowchart of the index creating process described with reference to FIGS. 3 and 4. here,
Description will be made assuming that the dictionary and the index are stored as files in the external storage device. The steps will be sequentially described below. step1 : First, the dictionary data from the file to the buffer 1
Read the record. Next, the read dictionary record is compressed and written in the file (compression dictionary) and the write start position (compression dictionary line position) is stored. Next, the dictionary 1 above
All the characters corresponding to the reading part of the record are sequentially taken out, and the character code and the compression dictionary line position are paired and written to the file (index source data 1). step2 : Sort the index source data 1 in the order of character code and compression dictionary line position (index source data). step3 : The index source data 2 is sequentially read, and only the compression dictionary line position is written to the index 2, and at the transition of the code of the character part, the character and the line number of the index 2 are written to the index 1 as a pair.

FIG. 6 is a diagram showing a schematic flow chart of the search processing described in FIG. The steps will be sequentially described below. step1 : First, the search key "ai" is analyzed, and the character for searching the index is set as a one-character key (a). step2 : Next, the index 1 is read, the character field is sequentially searched from the beginning, and the one matching the one character key (A) is searched. The index 2 row start position of the matched row is stored. The (row start position-1) of index 2 of the next row is stored as the search end position of index 2. step3 : The compression dictionary line position of index 2 is sequentially read from the stored line start position of index 2 to the search end position, and the record data of that line number is read from the file of the compression dictionary body into the buffer, decompressed, and read. Match the search key and display the matching record or write it to a file.

FIG. 7 is a diagram showing a schematic flowchart of a search process for compressing a search key and comparing it with a compressed dictionary line. The steps will be sequentially described below. step1 : First, the search key "ai" is analyzed, and the character for searching the index is set as a one-character key (a). step2 : Next, the index 1 is read, the character field is sequentially searched from the beginning, and the one matching the one character key (A) is searched. The starting position of index 2 of the matched row is stored. Next row index 2
(Row start position -1) is stored as the search end position of index 2. step3 : The compression dictionary line position of index 2 is sequentially read from the stored line start position of index 2 to the search end position, the record data of that line number is read into the buffer from the file of the compression dictionary body, and the reading part and the dictionary are compressed. It collates with the search key compressed by the same method as described above, and if they match, the compressed record is decompressed and displayed or written to a file. FIG. 8 is a diagram showing an example of the compression dictionary line position index (index 3).

FIG. 9 is a diagram showing a schematic flow chart of index creation processing for creating index 3 at the same time as index 1 and index 2. The steps will be sequentially described below. step1 : First, the dictionary data from the file to the buffer 1
Read the record. Next, compress the dictionary 1 record you read,
The writing start position is stored together with writing to the file (compression dictionary), and further writing to the file (index 3). Next, all the characters that correspond to the restricted part of the index creation data range character position restriction specification table for the dictionary 1 record of the same as above are sequentially fetched, and the character code and the compression dictionary line position are paired and written to the file (index source Data 1). step2 : Next, the index source data 1 is sorted in the order of the character code and the compression dictionary line position (index source data 2). step3 : The index source data 2 is sequentially read out, and only the compression dictionary line position is written to the index 2, and at the transition of the code of the character part, the character and the line number of the index 2 are paired and written to the index 1.

FIG. 10 is a diagram showing a schematic flowchart of another search process using the index 3. In this example, the index 3 is used to easily search the position before and after the record corresponding to the line number or the key of the dictionary. For the search of the index 3, the same method as described in the description of the index 1 is used. It can be used. Further, by providing this index, when the information of the related record is described in the dictionary record, that record can be extracted from the compression dictionary at high speed. The steps will be sequentially described below.

Step 1 : First, the search key “ai” is analyzed, and the character for searching the index is set as a one-character key (A). step2 : Next, the index 1 is read, the character field is sequentially searched from the beginning, and the one matching the one character key (A) is searched. The index 2 row start position of the matched row is stored. The (row start position-1) of index 2 of the next row is stored as the search end position of index 2. step3 : The compression dictionary line position of index 2 is sequentially read from the stored line start position of index 2 to the search end position, and the record data of that line number is read from the file of the compression dictionary body into the buffer, decompressed, and read. Match the search key, display the matching record or write it to a file, and specify the display of the record number of the matching record,
Alternatively, when the display designation of the preceding and succeeding records is made, the index 3 is searched and the index 3 matching the compression dictionary line position data is searched.
The dictionary line number is specified from the record position of, and the record number or the records before and after are combined and displayed or written to a file.

FIG. 11 is a diagram showing a schematic flow chart of a search process in which a part that can be a key on the dictionary at the time of index creation is limited by the character position range, and decompression of the compressed dictionary line is limited at the time of comparing the search keys. . The steps will be sequentially described below. step1 : First, the search key "ai" is analyzed, and the character for searching the index is set as a one-character key (a). step2 : Next, the index 1 is read, the character field is sequentially searched from the beginning, and the one matching the one character key (A) is searched. The index 2 row start position of the matched row is stored. The (row start position-1) of index 2 of the next row is stored as the search end position of index 2. step3 : The compression dictionary line position of index 2 is sequentially read from the stored line start position of index 2 to the search end position, the record data of that line number is read from the file of the compression dictionary body into the buffer, and the index creation data range character position Decompress up to the limited part of the limited specification table, match the decompressed character string with the search key, and if they match, decompress the remaining part and display or write the record to a file. FIG. 12 is a diagram showing an example of an index creation data range character position limitation specification table that is referenced when creating an index.

FIG. 13 is a diagram showing a schematic flow chart of the index creating process. In this example, by limiting the range to be decompressed at the time of search matching to the character position range at the time of index creation, it is attempted to speed up the process compared to decompressing the entire record and then performing matching. The steps will be sequentially described below.

Step 1 : First, one record of dictionary data is read from the file into the buffer. Next, one record of the read dictionary is compressed and is written in the file (compression dictionary), and the write start position (compression dictionary line position) is stored. Next, all the characters corresponding to the restricted part of the index creation data range character restriction specification table for the dictionary 1 record of the same as above are sequentially taken out, and the character code and the compression dictionary line position are paired and written to the file (index source data 1). . step2 : Next, the index source data 1 is sorted in the order of the character code and the compression dictionary line position (index source data 2). step3 : The index source data 2 is sequentially read out, and only the compression dictionary line position is written to the index 2, and at the transition of the code of the character part, the character and the line number of the index 2 are paired and written to the index 1.

FIG. 14 is a diagram showing a schematic flow chart of a search process in which a part that can be a key on the dictionary at the time of index creation is limited within a range of delimiters and decompression of a compressed dictionary line is limited at the time of comparing search keys. is there. The steps will be sequentially described below. step1 : First, the index key "ai" is analyzed, and the character for searching the index is set as a one-character key (a). step2 : Next, the index 1 is read, the character field is sequentially searched from the beginning, and the one matching the one character key (A) is searched. The row start position of index 2 of the matched row is stored. Next row index 2
(Row start position -1) is stored as the search end position of index 2. step3 : Next, the compression dictionary line positions of index 2 are sequentially read from the stored line start position of index 2 to the search end position,
The record data of that line number is read from the file of the compression dictionary body to the buffer, decompressed to the limited part of the index creation data range delimiter limited specification table, the decompressed character string and the search key are collated, and if they match, the rest Unzip the part and display the record or write it to a file.

FIGS. 15 and 16 are diagrams showing examples of index creation data range delimiter limitation tables that are referred to when creating an index. That is, FIG. 15 is a diagram showing an example in which the notation part in the dictionary is surrounded by a start delimiter and an end delimiter.
FIG. 6 is a diagram showing an example in which the reading of the heading of the dictionary ends with the notation start delimiter or the Chinese character blank.

FIG. 17 is a diagram showing a schematic flow chart of the index creating process. In this example as well, the range to be decompressed at the time of search matching is limited to the character range at the time of index creation, so that the processing speed can be made higher than that of decompressing the entire record and then performing the matching. The steps will be sequentially described below. step1 : First, read one record of dictionary data from a file to Baafa. Next, one record of the read dictionary is compressed and is written in the file (compression dictionary), and the write start position (compression dictionary line position) is stored. Next, sequentially retrieve all the characters corresponding to the limited part of the index creation data range delimiter limited specification table of the dictionary 1 record of the above,
The character code and the compression dictionary line position are paired and written to the file (index source data 1). step2 : Next, the index source data 1 is sorted in the order of the character code and the compression dictionary line position (index source data 2). step3 : The index source data 2 is sequentially read out, and only the compression dictionary line position is written to the index 2, and at the transition of the code of the character part, the character and the line number of the index 2 are paired and written to the index 1.

In the above, a method of creating an index and a search method has been described by using a dictionary as an example, but this can be applied to similar documents or character string data other than the dictionary. Next, a method of compressing dictionary data will be described. The usual method is as follows. (1) For example, in the case of data such as the example of the dictionary shown in FIG. 2 in which all are written in 2-byte Kanji code, one character is generally described in 16 bits,
In addition, in the case of a code similar to the JIS code, the most significant bit of each byte of the 2-byte code can be omitted and each character can be represented by 14 bits. Moreover, since the range of the Kanji code is limited, if the range is mapped to a continuous range, the number of bits required for expressing one code can be further reduced.

The advantage of this method is that the process is simple and the process of compression and decompression is fast, and that the compressed code corresponds to each character on a one-to-one basis. Therefore, the search key described in FIG. 7 is compressed. Then, it is convenient to compare with the record of the compression dictionary. Further, since the decompression range is known in advance for decompressing the part where the index creation data range described in FIG. 13 is limited by the character position, the process is simplified. A null code is generally used at the end of the compressed record as a method of expressing the delimiter of the compressed record.

(2) Further, as a method of increasing the compression rate, a method of expressing a sequence of the same characters by a simple code,
There is a method of registering the code pattern appearing in the data and expressing the high frequency pattern with a short code. There is also a method of assigning short codes to commonly used characters.

FIG. 18 is a block diagram for explaining another embodiment of the dictionary retrieval device according to the present invention, in which 16 is KK.
C dictionary search control unit, 17 is the KKC dictionary body,
Portions having the same functions as those in FIG. 1 are designated by the same reference numerals.
The difference from the configuration shown in FIG. 1 is that the input / edit control unit 6 is provided with a kana-kanji conversion (KKC) dictionary.

FIGS. 19 (a) to 19 (c) are views for explaining the method of compressing dictionary data in record units according to the present invention. 19 (a) is an example of a dictionary record to be compressed, FIG. 19 (b) is an example of a kana-kanji conversion dictionary, and FIG. 19 (c).
Shows respective examples of correspondence tables for explaining that the "reading" portion of the dictionary record to be compressed is made to correspond to the "reading" portion of the kana-kanji conversion dictionary and the record position is stored as reading information.

In FIG. 19C, for example, the reading "aa" of the record number "20" in the compression target dictionary matches the reading "aa" of the record number "12" in the kana-kanji conversion dictionary, so the compressed data is The record number “12”, which is the record position of the kana-kanji conversion dictionary, may be stored. Also,
In this example, the reading “ai” of the record number “27” and the reading “ai” of the record number “29” in the compression target dictionary.
May store the record number “20” of the kana-kanji conversion dictionary.

FIG. 20 is a diagram showing a schematic flow chart of a process for creating compressed data for reading the dictionary to be compressed by the method shown in FIG. The steps will be sequentially described below. step1 : First, from the dictionary file to be compressed into the buffer 1
Read the record. step2 : Next, search for "yomi" in the kana-kanji conversion dictionary using the "yomi" of the read record as a key. step3 : The first record number that matches the reading in the Kana-Kanji conversion dictionary is stored as compressed reading data. step4 : The "reading" portion of the compression target dictionary file is written in the replacement file with the compressed data of the reading. step5 : The above operation is repeated for all records in the compression target dictionary.

In the example of FIG. 19, in order to simplify the explanation,
Although the Kana-Kanji conversion dictionary in the system is shown with the same record structure as the compression target dictionary, the Kana-Kanji conversion dictionary actually in the system does not have a simple structure like this example, but rather a faster search or In most cases, the dictionary itself is provided with an index for reading because of the compression of the dictionary capacity, and the reading, notation and part of speech of the dictionary itself are compressed.
In this case, “Kana-Kanji conversion dictionary reading position” in FIG.
The content of is stored not only in the record number of the Kana-Kanji conversion dictionary but in the corresponding reading position of the Kana-Kanji conversion dictionary body corresponding to it.

In this case, the record position or reading position is stored based on the uncompressed data of the kana-kanji conversion dictionary, or the corresponding reading position of the compressed kana-kanji conversion dictionary is stored. The reading position information of the compressed kana-kanji conversion dictionary is, for example, the first two readings in the reading index.
In the case of a search structure dictionary in which characters are stored and the remaining readings are stored in the main body, the reading position information is obtained by combining the index position of the first two characters of the reading and the remaining reading position of the main body. .

FIG. 21 is a diagram showing a schematic flow chart of the processing for creating compressed data for reading the dictionary to be compressed in the above case. The steps will be sequentially described below. step1 : First, from the dictionary file to be compressed into the buffer 1
Read the record. step2 : Next, search for "yomi" in the kana-kanji conversion dictionary using the "yomi" of the read record as a key. step3 : The position on the index of the first two characters that matches the reading of the Kana-Kanji conversion dictionary and the position of the remaining reading of the main body are stored as compressed data. step4 : Replace the "reading" part of the compression target dictionary file with the compressed data of the reading and write it out to the file. step5 : The above operation is repeated for all records in the compression target dictionary.

When the reading is restored from the compressed data of the compression target dictionary, the kana-kanji conversion dictionary is drawn from the reading position data of the kana-kanji conversion dictionary, and the reading data registered therein is acquired. FIG. 22 is a diagram showing a schematic flowchart of a process for restoring the reading from the compressed data in the above case. The steps will be sequentially described below. step1 : First, the compressed record of the dictionary obtained by searching is set in the buffer. step2 : Next, the compressed record storage buffer is scanned and the decompressed data is sequentially decompressed from the beginning, and decompressed data is sequentially set in the dictionary record buffer. Next, when the reading portion is decompressed, the compression code is interpreted as the reading position information of the kana-kanji conversion dictionary, the reading data is acquired from the kana-kanji conversion dictionary data according to the reading position information, and the reading data is set in the dictionary record buffer. Next, the data other than the read portion is set in the dictionary record buffer according to another decompression algorithm. step3 : Display the decompressed dictionary record or pass it to the next process.

The first two readings are added to the reading index as in the above example.
In the case of a compressed dictionary having a retrieval structure in which characters are stored and the rest of the readings are stored in the main body, in the case of decompressing the reading of the dictionary to be compressed, the first 2 of the stored readings are stored.
The position on the index of the character and the remaining reading position of the main body are taken out from the combined reading position information, the reading character strings at the corresponding positions are taken out, and they are combined.

FIG. 23 shows the pressure of the compression target dictionary in the above case.
Schematic flowchart of the process to restore readings from compressed data
FIG. The steps are described below in order.
It step1 : First, the compressed record of the dictionary obtained by searching
Set in buffer.step2 : Next, scan the compressed record storage buffer and
Decompress sequentially from the beginning, decompressed data into dictionary record buffer
Set sequentially. Next, when you start thawing the reading part, press
Interpretation of reduced code with reading position information of Kana-Kanji conversion dictionary
Then, according to the reading position information, is it Kana-Kanji conversion dictionary data?
From the dictionary record buffer.
To put. Next, read a part of the reading position information on the reading index.
To get the first 2 characters of the reading. Then read
Acquire the remaining reading position of the main unit from the remaining position information and read it.
Get the rest of the letters. Next, with the first two characters of the reading
The remaining characters are combined and used as reading data. Next, the reading section
For data other than minutes, follow the above decompression algorithm.
Set in dictionary record buffer.step3 : View the unzipped dictionary record, or
To process.

FIGS. 24 (a) to 24 (c) are views for explaining another embodiment of the method of compressing dictionary data in record units according to the present invention. FIG. 24 (a) shows the dictionary record to be compressed. FIG. 24 (b) is an example of a kana-kanji conversion dictionary, FIG.
4 (c) is a correspondence table explaining that the "notation" part of the dictionary record to be compressed is made to correspond to the "notation" part of the kana-kanji conversion dictionary, and that record position is stored as reading information. Examples are shown below.

In FIG. 24C, for example, the notation “love” of the record number “27” in the compression target dictionary matches the notation “love” of the record number “20” in the kana-kanji conversion dictionary, so that the compressed data is used. Should store the record number "20" which is the record position of the kana-kanji conversion dictionary. Also,
The notation “phase” of the record number “29” in the compression target dictionary is
The record number “22” of the kana-kanji conversion dictionary may be stored.

FIG. 25 is a diagram showing a schematic flow chart of the process for creating the compressed data of the notation of the compression target dictionary by the method shown in FIG. The steps will be sequentially described below. step1 : First, from the dictionary file to be compressed into the buffer 1
Read the record. step2 : Next, search for "notation" in the kana-kanji conversion dictionary using the "notation" of the read record as a key. step3 : The first record number where the "notation" matches the "notation" of the kana-kanji conversion dictionary is stored as compressed data of the notation. step4 : The "notation" part of the compression target dictionary file is replaced with the compressed data of the notation, and the file is written out. step5 : The above operation is repeated for all records in the compression target dictionary.

FIG. 26 is a diagram showing a schematic flow chart of the process for restoring the notation from the compressed data of the compression target dictionary by the method shown in FIG. The steps will be sequentially described below. step1 : First, the compressed record of the dictionary obtained by searching is set in the buffer. step2 : Next, the compressed record storage buffer is scanned and the decompressed data is sequentially decompressed from the beginning, and decompressed data is sequentially set in the dictionary record buffer. Next, when decompressing the notation part, interpret the compression code as the notation position information of the kana-kanji conversion dictionary,
The notation data is acquired from the kana-kanji conversion dictionary data according to the notation position information and set in the dictionary record buffer. Next, the data other than the notation part is set in the dictionary record buffer according to another decompression algorithm. step3 : Display the decompressed dictionary record or pass it to the next process.

FIGS. 27 (a) to 27 (c) are diagrams for explaining still another embodiment of the record-unit compression method for dictionary data according to the present invention. FIG. 27 (a) shows the dictionary to be compressed. An example of a record, FIG. 27 (b) is an example of a kana-kanji conversion dictionary, and FIG. 27 (c) is a part of the "word translation" of the dictionary record to be compressed is made to correspond to the "writing" part of the kana-kanji conversion dictionary. An example of a correspondence table for explaining that the record position is stored as reading information is shown.

In FIG. 27C, for example, a part of the word "surprise" of the record number "20" in the compression target dictionary matches the expression "surprise" of the record number "7410" in the kana-kanji conversion dictionary. As the compressed data, the record number “7410”, which is the record position of the kana-kanji conversion dictionary, may be stored. For the part of the same word, "sadness", the record number "10525" of the kana-kanji conversion dictionary may be stored.

FIG. 28 is a schematic flow chart of the processing for creating the compressed data of the word part of the dictionary to be compressed by the method shown in FIG. The steps will be sequentially described below. step1 : First, from the dictionary file to be compressed into the buffer 1
Read the record. step2 : Next, search the kana-kanji conversion dictionary notation using the word portion of the word "reading" of the read record as a key. step3 : The first record number in which the "notation" matches the notation in the kana-kanji conversion dictionary is stored as compressed data of the word portion of the lexical. step4 : Replace the word portion of "word word" in the compression target dictionary file with the compressed data of the word portion, and write it to the file. step5 : The above operation is repeated for all records in the compression target dictionary.

FIG. 29 is a diagram showing a schematic flow chart of a process of restoring a word translation from the compressed data of the compression object dictionary shown in FIG. The steps will be sequentially described below. step1 : First, the compressed record of the dictionary obtained by searching is set in the buffer. step2 : Next, the compressed record storage buffer is scanned and the decompressed data is sequentially decompressed from the beginning, and decompressed data is sequentially set in the dictionary record buffer. Next, when decompressing the lexical portion, interpret the compression code of the word corresponding portion as the notation position information of the kana-kanji conversion dictionary, obtain the notation data from the kana-kanji conversion dictionary data according to the notation position information, and use the dictionary record buffer. Set to. Next, the data other than the word corresponding part of the word translation is set in the dictionary record buffer according to another decompression algorithm. step3 : Display the decompressed dictionary record or pass it to the next process.

FIGS. 30 (a) to 30 (c) are views for explaining still another embodiment of the record unit compression method for dictionary data of the present invention. FIG. 30 (a) shows the dictionary to be compressed. An example of a record, FIG. 30B is an example of a kana-kanji conversion dictionary,
In FIG. 30C, the "reading" portion of the dictionary record to be compressed is made to correspond to the "reading" portion of the kana-kanji conversion dictionary,
An example of a correspondence table for explaining that the record position is stored as reading information is shown below.

In FIG. 30C, for example, the reading "aa" of the record number "20" in the compression target dictionary matches the reading "aa" of the record number "12" in the kana-kanji conversion dictionary, so the compressed data is The record number “12”, which is the record position of the kana-kanji conversion dictionary, is stored. On the other hand, in this example, the reading “A” of the record number “1” of the compression target dictionary
Is short, the record position of the Kana-Kanji conversion dictionary is not stored.

FIG. 31 is a diagram showing a schematic flow chart of the processing for creating the read compressed data of the compression object dictionary by the method shown in FIG. The steps will be sequentially described below. step1 : First, from the dictionary file to be compressed into the buffer 1
Read the record. step2 : Next, it is judged whether the "reading" of the read record is equal to or longer than the specified length, and if No, step described later
Go to 6. Step3 : If Yes in above Step2 , the "reading" of the kana-kanji conversion dictionary is searched using the "reading" of the read record as a key. step4 : The first record number that matches the reading of the reading kana-kanji conversion dictionary is stored as compressed reading data. step5 : Replace the "reading" portion of the compression target dictionary file with the compressed data of the reading. step6 : Write compressed data record to file. step7 : The above operation is repeated for all records of the compression target dictionary.

FIG. 32 is a diagram showing a schematic flowchart of a process for restoring the reading from the compressed data of the compression target dictionary by the method shown in FIG. The steps will be sequentially described below. step1 : First, the compressed record of the dictionary obtained by searching is set in the buffer. step2 : Next, the compressed record storage buffer is scanned and the decompressed data is sequentially decompressed from the beginning, and decompressed data is sequentially set in the dictionary record buffer. Next, enter the decompression of the reading part, and if the compression code can be interpreted as reading data with a length greater than the specified value, interpret the compression code as the reading position information of the Kana-Kanji conversion dictionary and follow the reading position information. Reading data is acquired from the kana-kanji conversion dictionary data and set in the dictionary record buffer. Next, if the data other than the reading portion or the reading portion can be interpreted as reading data having a length less than the specified value, it is set in the dictionary record buffer according to another decompression algorithm. step3 : Display the decompressed dictionary record or pass it to the next process.

FIGS. 33 (a) to 33 (c) are views for explaining still another embodiment of the record data compression method for dictionary data according to the present invention. FIG. 33 (a) shows the dictionary to be compressed. An example of a record, FIG. 33 (b) is an example of a kana-kanji conversion dictionary,
In FIG. 33C, the “notation” part of the dictionary record to be compressed is made to correspond to the “notation” part of the kana-kanji conversion dictionary,
An example of a correspondence table for explaining that the record position is stored as reading information is shown below.

In FIG. 33 (c), for example, the notation "love" of the record number "197" in the compression target dictionary matches the notation "love" of the record number "103" in the kana-kanji conversion dictionary, so the compressed data The record number “103”, which is the record position of the Hana-Kana character conversion dictionary, is stored. On the other hand, in this example, the record number “27” of the compression target dictionary
Since the notation "love" is short, the record position in the kana-kanji conversion dictionary is not stored.

FIG. 34 is a diagram showing a schematic flow chart of the process for creating the compressed data of the notation of the compression target dictionary by the method shown in FIG. The steps will be sequentially described below. step1 : First, from the dictionary file to be compressed into the buffer 1
Read the record. step2 : Next, it is judged whether the "notation" of the read record is equal to or longer than the specified length, and if No, step6 described later.
Go to Step3 : If Yes in above Step2 , the "notation" of the kana-kanji conversion dictionary is searched using the "notation" of the read record as a key. step4 : The first record number that matches the notation in the Kana-Kanji conversion dictionary is stored as compressed data for the notation. step5 : Replace the "notation" part of the compression target dictionary file with the compressed data of the above notation. step6 : Write compressed data record to file. step7 : The above operation is repeated for all records of the compression target dictionary.

FIG. 35 is a diagram showing a schematic flow chart of the process for restoring the notation from the compressed data of the compression target dictionary by the method shown in FIG. The steps will be sequentially described below. step1 : First, the compressed record of the dictionary obtained by searching is set in the buffer. step2 : Next, the compressed record storage buffer is scanned and the decompressed data is sequentially decompressed from the beginning, and decompressed data is sequentially set in the dictionary record buffer. Next, when entering the decompression of the notation part, if the compression code can be interpreted as the data of the notation having a length equal to or greater than the specified value, the compression code is interpreted as the notation position information of the Kana-Kanji conversion dictionary and according to the notation position information. The notation data is obtained from the kana-kanji conversion dictionary data and set in the dictionary record buffer. Next, if the data other than the notation part or the notation part can be interpreted as notation data of a length less than the specified value, set it in the dictionary record buffer according to another decompression algorithm step3 : Display the decompressed dictionary record, or Or pass it to the next process.

FIGS. 36A to 36C are views for explaining still another embodiment of the record data compression method for dictionary data according to the present invention. FIG. 36A shows a dictionary to be compressed. An example of a record, FIG. 36 (b) is an example of a kana-kanji conversion dictionary,
FIG. 36 (c) shows an example of an auxiliary dictionary, and FIG. 36 (c) shows that the “notation” part of the dictionary record to be compressed corresponds to the “notation” part of the kana-kanji conversion dictionary, and the record position is used as the notation information. An example of a correspondence table for explaining storing will be shown.

In FIG. 36C, for example, the notation "A" of the record number "1" in the compression target dictionary matches the notation "A" of the record number "1" in the Kana-Kanji conversion dictionary.
The compressed data stores the record number "1" which is the record position of the kana-kanji conversion dictionary. On the other hand, the record number "5" of the compression target dictionary is not registered in the kana-kanji conversion dictionary, so the record position of the kana-kanji conversion dictionary cannot be stored. In this case, use a newly created auxiliary dictionary corresponding to the contents of the auxiliary dictionary or auxiliary dictionary (single-kanji dictionary, special word dictionary, etc.) included in the system or the compression target dictionary. Memorize The notation “strain” stores the record number “523645” of the auxiliary dictionary (the record number of the auxiliary dictionary that is a serial number after the last record of the kana-kanji conversion dictionary). For example, the record number of the Kana-Kanji conversion dictionary is
"1 to 50000", the record number of the auxiliary dictionary is "50001"
Suppose it starts with.

FIG. 37 is a diagram showing a schematic flow chart of the process for creating the compressed data of the notation of the compression object dictionary by the method shown in FIG. The steps will be sequentially described below. step1 : First, from the dictionary file to be compressed into the buffer 1
Read the record. step2 : Next, search for "notation" in the kana-kanji conversion dictionary using the "notation" of the read record as a key. step3 : It is judged whether or not the notation matches the notation in the kana-kanji conversion dictionary. step4: If Yes at the step3, notation stored as compressed data representation of the record number of early consistent with representation of kana-kanji conversion dictionary. step5 : If No in step 3, the "notation" of the auxiliary dictionary is searched using the "notation" as a key, and the matched record number is stored as the compressed data of the notation. step6 : Replace the "notation" part of the compression target dictionary file with the compressed data of the notation. step7 : Write compressed data record to file. step8 : Repeat the above operation for all records in the dictionary to be compressed.

FIG. 38 is a diagram showing a schematic flow chart of the processing for restoring the notation from the compressed data of the compression target dictionary by the method shown in FIG. The steps will be sequentially described below. step1 : First, the compressed record of the dictionary obtained by searching is set in the buffer. step2 : Next, the compressed record storage buffer is scanned and the decompressed data is sequentially decompressed from the beginning, and decompressed data is sequentially set in the dictionary record buffer. Next, the notation part is decompressed, and the compression code interprets it as the notation position information of the kana-kanji conversion dictionary or the position information of the auxiliary dictionary, and acquires the notation data from the kana-kanji conversion dictionary data or the auxiliary dictionary according to the display position information. Then, the dictionary record buffer is set. Next, the data other than the notation part is set in the dictionary record buffer according to another decompression algorithm. step3 : Display the decompressed dictionary record or pass it to the next process.

In FIG. 28, "words" are decomposed into word parts by an arbitrary morpheme analysis such as simple morpheme decomposition by character type. In addition, the collation method when searching the kana-kanji conversion dictionary, such as the fluctuation of the syllabary when the word is a noun, is not particularly limited here, and a conventional morphological analysis method may be used. In an easy way,
Either use the same method as the collation process of the Kana-Kanji conversion dictionary, or consider all the word strings of the vocabulary as colloquial and collate, and use the Kana-Kanji conversion dictionary for those that do not match the Kana-Kanji conversion dictionary. It is also possible to use a method that does not use compressed data.

FIG. 20, FIG. 21, FIG. 25, FIG. 26, FIG.
In FIG. 1, FIG. 34, the character string that has not been matched with the kana-kanji conversion dictionary is not compressed or is compressed by another compression method described above. At that time, if necessary, between compressed data and uncompressed data, between compressed data using Kana-Kanji conversion position information and compressed data by other compression methods,
A delimiter (or code) is provided to identify
Make sure that the code areas do not overlap. Also,
In the above outline flow, each reading part of the dictionary record,
The notation part, word excerpt, etc. shall be recognizable using the position in the record and the delimiter.

21 and 22, the processing flow of an example in which "reading" exists separately in the index and the main body is shown, but the same applies to "notation". If the reading or notation of the Kana-Kanji conversion dictionary is compressed,
When the position of the compressed data is stored and the actual reading or notation is obtained, the data obtained by decompressing the compressed data in the position information of the kana-kanji conversion dictionary according to the compression algorithm of the kana-kanji conversion dictionary is used as the reading or notation information.

Furthermore, when the kana-kanji conversion dictionary is highly compressed, the original dictionary of the kana-kanji conversion dictionary and the actual compressed kana-kanji conversion dictionary are combined when the compressed data of the compression target dictionary is created. To obtain the position data of the notation without referring to the same dictionary or the same-source dictionary, once find the reading of the notation, find the kana-kanji conversion dictionary in the reading and find the notation corresponding to the notation, and check it with the target notation. Then, the position of the matching notation is stored as the position of the compressed data. These processing flows are omitted because they depend on the compression search algorithm of the individual kana-kanji conversion dictionary.

[0076]

As is apparent from the above description, the present invention has the following effects. (1) Effects corresponding to claims 1 to 4: It is possible to perform a very quick search of a medium-sized dictionary or a document similar to a dictionary with a relatively simple method, compared to a method of comprehensively searching from the beginning. . Further, as a search device for performing a high speed search for an arbitrary character string, it is considerably simpler than the conventional search device and the amount of indexes is very small. (2) Effect corresponding to claim 1: Since the dictionary data to be searched is compressed in record units, the storage capacity of the dictionary body can be reduced, and the device can be realized with a smaller storage capacity. (3) Effect corresponding to claim 2: By using the index character position range information at the time of creating the index, the search range of the line head position including each character can be prevented from being searched unnecessarily at the time of positioning the line head. The line cutting can be made faster. (4) Effect corresponding to claim 3: Since the data length of the compressed record is generally larger than that of the search key and the search key only needs to be compressed once, the compressed record can be collated with the search key without decompression. Matching information is obtained faster than decompressing and matching compressed records. (5) Effect corresponding to claim 4: Since an index for recording each compressed record position in the compression dictionary is provided, the data matching the search key and the data around it are retrieved (see).
When performing all in batches, the extraction range can be grasped in advance by the index, so that the extraction can be performed faster. (6) Effects corresponding to claims 5 and 6: The decompression range of the compressed record can be limited in response to the limitation of the index creation range on the dictionary. Therefore, when the index creation is limited, the compression record is limited. Decompression outside the range can be omitted, and matching with the search key can be performed faster. (7) Effects corresponding to claims 7 to 12: A relatively simple method can be used to search a medium-sized dictionary or a document similar to a dictionary in a very high speed, as compared with a method of comprehensively searching from the beginning. . Further, as a search device that searches for an arbitrary character string at high speed, it is considerably simpler and requires a much smaller amount of indexes than conventional devices. Further, since the dictionary data to be searched is compressed in record units, the storage capacity of the dictionary body can be reduced, and the device can be realized with a smaller storage capacity.
In particular, the Kana-Kanji conversion dictionary, which is almost always provided in the document processing system, is effectively used, and the record information of the dictionary is compressed in record units. In principle, the defrosting time can be done at high speed, which is very effective. (8) Effects corresponding to claims 7 and 10: Since the character string of the reading part of the dictionary is replaced with the position information of the reading part of the heading of the kana-kanji conversion dictionary, the reading part of the dictionary can be effectively compressed. (9) Effects corresponding to claims 8 and 11: Since the character string in the notation part of the dictionary is replaced by the position information of the notation part of the heading of the kana-kanji conversion dictionary, the notation part of the dictionary can be effectively compressed. (10) Effect corresponding to claim 9: Since the character string of the word part of the dictionary or the commentary part is replaced with the position information of the notation part of the heading of the kana-kanji conversion dictionary, effective compression of the word part of the dictionary or the commentary part is achieved. it can. (11) Effect corresponding to claim 10: Since the kana-kanji conversion dictionary has a short reading of the heading but does not store the position information, only the character string portion having a more compression effect can be stored with a small data length. Therefore, the compression effect is higher. (12) Effect corresponding to claim 11: Since the kana-kanji conversion dictionary has short headings but does not store position information, only a character string portion having a more effective compression can be stored with a small data length. Therefore, the compression effect is further high. (13) Effect corresponding to claim 12: A character string that does not match the reading or notation of the dictionary heading for kana-kanji conversion,
Since a dictionary having position information and reading or notation associated with the position information (address information) of the kana-kanji conversion dictionary is provided, the dictionary can be accessed easily and at high speed.

[Brief description of drawings]

FIG. 1 is a configuration diagram for explaining an embodiment of a dictionary search device according to the present invention.

FIG. 2 is a diagram showing an example of a dictionary in the present invention.

FIG. 3 is a diagram showing an example of index creation according to the present invention.

FIG. 4 is a diagram showing a conceptual diagram of a search method in the present invention.

FIG. 5 is a diagram showing a schematic flow (No. 1) of a process of creating an index in the present invention.

FIG. 6 is a diagram showing a schematic flow (1) of a search process in the present invention.

FIG. 7 is a diagram showing a schematic flow (No. 2) of search processing in the present invention.

FIG. 8 is a diagram showing a compression dictionary row position index according to the present invention.

FIG. 9 is a diagram showing a schematic flow (No. 2) of index creation processing in the present invention.

FIG. 10 is a diagram showing a schematic flow (No. 3) of the search processing in the present invention.

FIG. 11 is a diagram showing a schematic flow (No. 4) of the search processing in the present invention.

FIG. 12 is a diagram showing an example of an index creation data range character position limitation specification table according to the present invention.

FIG. 13 is a diagram showing a schematic flow (No. 3) of index creation processing in the present invention.

FIG. 14 is a diagram showing a schematic flow (No. 5) of the search processing in the present invention.

FIG. 15 is a diagram showing an example (part 1) of an index creation data range delimiter limitation specification table according to the present invention.

FIG. 16 is a diagram showing an example (No. 2) of the index creation data range delimiter limitation specification table in the present invention.

FIG. 17 is a diagram showing a schematic flow (No. 4) of index creation processing in the present invention.

FIG. 18 is a configuration diagram for explaining another embodiment of the dictionary search device according to the present invention.

FIG. 19 is a diagram for explaining an example of a method of compressing dictionary data in record units according to the present invention.

FIG. 20 is a diagram showing a schematic flow (No. 1) of the processing of creating compressed data for reading the dictionary to be compressed in the present invention.

FIG. 21 is a diagram showing a schematic flow (No. 2) of the processing for creating compressed data for reading the dictionary to be compressed in the present invention.

FIG. 22 is a diagram showing a schematic flow (No. 1) of the processing of restoring the reading from the compressed data of the compression target dictionary in the present invention.

FIG. 23 is a diagram showing a schematic flow (No. 2) of the processing for restoring the reading from the compressed data of the compression target dictionary in the present invention.

FIG. 24 is a diagram for explaining another embodiment of the dictionary data record-based compression method according to the present invention.

FIG. 25 is a diagram showing a schematic flow of a process of creating compressed data represented by a dictionary to be compressed in the present invention.

FIG. 26 is a diagram showing a schematic flow (No. 1) of the processing for restoring the notation from the compressed data of the compression target dictionary in the present invention.

FIG. 27 is a diagram for explaining still another embodiment of the dictionary data record-based compression method according to the present invention.

FIG. 28 is a diagram showing a schematic flow of a process of creating compressed data of a word part of a compression target dictionary according to the present invention.

FIG. 29 is a diagram showing a schematic flow of a process of restoring a word translation from compressed data of a compression target dictionary according to the present invention.

FIG. 30 is a diagram for explaining still another embodiment of the dictionary data record-based compression method according to the present invention.

FIG. 31 is a diagram showing a schematic flow (No. 3) of the processing for creating compressed data for reading the dictionary to be compressed in the present invention.

FIG. 32 is a diagram showing a schematic flow (No. 3) of the processing for restoring the reading from the compressed data of the compression target dictionary in the present invention.

[Fig. 33] Fig. 33 is a diagram for explaining still another embodiment of the method for compressing dictionary data in record units according to the present invention.

FIG. 34 is a diagram showing a schematic flow (No. 2) of the process of creating compressed data in the notation of the compression target dictionary in the present invention.

FIG. 35 is a diagram showing a schematic flow (No. 2) of the processing of restoring the notation from the compressed data of the compression target dictionary in the present invention.

FIG. 36 is a diagram for explaining still another embodiment of the method of compressing dictionary data in record units according to the present invention.

FIG. 37 is a diagram showing a schematic flow (No. 3) of the processing of creating compressed data in the notation of the compression target dictionary in the present invention.

FIG. 38 is a diagram showing a schematic flow (No. 3) of the processing of restoring the notation from the compressed data of the compression target dictionary in the present invention.

[Explanation of symbols]

1 ... Display unit, 2 ... Input unit, 3 ... External storage unit, 4 ... Printing unit, 5 ... Control unit, 6 ... Input / edit control unit, 7 ... Dictionary search support unit, 8 ... Output control unit, 9 ... Dictionary Search control unit, 10 ...
Dictionary index search control unit, 11 ... Dictionary main body search control unit, 12
... output display control unit, 13 ... setting information management table, 14 ... dictionary index, 15 ... dictionary body, 16 ... KKC dictionary search control unit,
17 ... KKC dictionary body.

Claims (12)

[Claims] 1. A dictionary search device for searching a dictionary in which data having readings or notations or other information is stored in record units, and a compression means for compressing the dictionary data in record units by an arbitrary method, and a dictionary. It has a compression dictionary data obtained by compressing data by the compression means, a one-character index that is an index that associates each reading or notation character that is the object of the search key with the record position on the compression dictionary, and specifies the search key. Then, the character extracting means for extracting the character in the search key, the position extracting means for extracting the compressed record position on the compression dictionary including the character extracted by the character extracting means, and the position extracting means for extracting the position Comparing means for decompressing the compressed record on the compression dictionary at the position into the original dictionary record and comparing the dictionary record with the search key;
A dictionary search device comprising: a display unit that extracts and displays records that match a search key. 2. The character index is sorted for each character, and an index in which a compressed record position in a compression dictionary is registered,
The dictionary search device according to claim 1, wherein the dictionary search device comprises an index in which a block head position for each character of the index is registered. 3. When the dictionary record and the search key are compared, the search key is a compressed search key compressed in the same manner as the compression dictionary, and the compressed record and the compressed search key are compared.
2. The dictionary search device according to claim 1, wherein records matching the search key are extracted and displayed. 4. The dictionary search device according to claim 1, further comprising an index recording each compressed record position of the compression dictionary. 5. The range of index creation of each record on the dictionary is specified by character position, and the range of decompression of compressed records at the time of search is restricted to that range. The dictionary search device described. 6. A delimiter is used to specify the limitation of the range of index creation for each record in the dictionary, and the range of decompression of compressed records at the time of retrieval is limited to that range. The dictionary search device described. 7. The dictionary retrieval apparatus according to claim 1, wherein the reading of the dictionary record is compressed by storing the reading position of the heading of the kana-kanji conversion dictionary for document input. 8. The dictionary search device according to claim 1, wherein the notation of the dictionary record is compressed by storing the position of the heading notation of the kana-kanji conversion dictionary for document input. 9. The dictionary search device according to claim 1, wherein the word translation or commentary portion of the dictionary record is compressed by storing the position of the notation in the kana-kanji conversion dictionary for document input. 10. The dictionary search device according to claim 7, wherein headings whose reading is short in the kana-kanji conversion dictionary for inputting documents are not stored. 11. The dictionary search device according to claim 8 or 9, wherein headings having a short description in the kana-kanji conversion dictionary for inputting documents are not stored. 12. The reading or notation not corresponding to the kana-kanji conversion dictionary has a dictionary corresponding to the address information of the kana-kanji conversion dictionary, according to any one of claims 7 to 11. Dictionary search device.