JPS599749A - "kana" (japanese syllabary) and chinese character converting device - Google Patents

Abstract

PURPOSE:To realize an efficient retrieval, by using not only a general word dictionary but also a provisional word dictionary for storing a word designated by a user, in a ''Kana'' (Japanese syllabary) and Chinese character converting device. CONSTITUTION:A character-string inputted from an input device 1 is stored in an input register 2, and is set to a retrieving device 16. The retrieving device 16 retrieves a provisional word dirtionary 17 having a word designated by a user by a rule which is different from the longest coincidence method, for instance, from a word registered in the end. In case when it cannot be retrieved in said retrieving device, retrieval of a general word dictionary 7 is executed by a retrieving device 3. In this way, there is an effect for raising the retrieval efficiency since a provisional word dictionary in which a word used frequently by a user is stored is used prior to a general word dictionary be the longest coincidence method which takes time for the retrieval, and also the retrieval is executed from a work which is used recently and registered in the end.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a kana-kanji conversion device for converting a kana character string into a character string mixed with kanji, and particularly to the structure of a word dictionary used in kana-kanji conversion.

Conventionally, there has been a device of this type as shown in FIG.

In the figure, (1) is a kana character string input device, (2) is an input register that stores the input from this kana character string input device (1), and (3) is a kana character string input device that uses the contents of input register (2). A searcher that searches a dictionary based on a certain rule such as the longest match method for the heading section, (7) is a word dictionary used by the searcher (3), and (4) is a word dictionary that searches for the search content of the searcher (3). A determiner (5) is an output register that stores the output from the determiner (4), and (6) is an indicator that outputs the contents of the output register (5).

FIG. 2 shows in detail the search device (3) in FIG. 1 and the parts before and after it. In the figure, (8) is the input data of input register (2) (kana character string a1 to a9)
Gi is a divider that divides and stores the first half in the search register (9) and the second half in the remainder register U. Gi is the search register (9).
A search device, α, that searches the data of 9) from the word dictionary (7)
2 is a search determiner, (13) is a search result storage register, (
14) is a synthesizer that synthesizes the contents of register 1 and register 00) and stores it in output register q9.

Next, the operation will be explained.

The input kana character string input by the input device (1) is stored in the input register (2) and is applied to the search device (3).

The search device (3) searches the dictionary (7) for words with headings that match all or part of the data in the input register (2), but this is not practical in normal Japanese conversion systems because the number of words recorded in the dictionary is large. It is necessary to set certain rules for the above search, and the longest match method, which searches from words in long headings, is generally adopted.

As a result of searching for a word using the search device (3), the data in the input register (2) is converted into a character string containing a mixture of kanji and kana. A determiner (4) determines the validity of the output result from the searcher (3) based on system-specific determination criteria,
If the test passes, the result is stored in the output register (5).

Next, the word search operation will be explained based on FIG.

The register divider (8) divides the kana character string in the input register (2) into a search part and a remainder part, and divides the kana character string in the input register (2) into a search part and a remainder part.
), and stored in the remainder register (1α).In this division, all the contents of the input register (2) are initially transferred to the search register (9), and the remainder register 0e becomes empty.

After that, each time the judgment result from the search judger (121) comes through a loop, the divider (8) divides the contents of the input register (2) character by character from the end into the remainder register (!0). , the data stored in the search register (9) also becomes shorter by one character from the end.
11) searches the dictionary (7) for a word having a kana heading that completely matches the kana character string stored in the search register (9), and determines the success or failure of the search using the search determiner O2.

If the search is not successful, the process loops back to the divider (8), deletes one character from the end of the search register (9), and repeats the search. Then, if the search is successful, register 1
13) Store the kanji part (B1-Bs) of the horizontal word,
Register 03) and register (
The contents of 101 are combined and stored in register 05).

Conventional kana-kanji conversion devices are structured as shown below, so that when a certain kana character is input, if there is a word A in the dictionary that can be searched with a heading length l, the heading length is ! (
The result is that word B (<7) is always searched after it, and when word B is frequently searched, the efficiency of the kana-kanji-ka-kanji exchange system is reduced.

This invention was made in order to eliminate the drawbacks of the conventional ones as described above, and a dictionary for temporarily storing words specified by the user is configured on the system separately from the general word dictionary. By unconditionally searching the provisional word dictionary using search rules such as last in and fast out before searching the dictionary, you can reduce the possibility of unnecessary conversion due to the length of the heading. The purpose is to provide a conversion device.

Hereinafter, one embodiment of the present invention will be described with reference to the drawings.

In Figure 3, (1) is an ephemeral character string input device, (2) is an input register that stores the input from this kana character string input device (1), and (161 is an input register that stores input from the kana character string input device (1)). Provisional word dictionary 0 with last-in, fast-out search rules that are different from the search rules of the general word dictionary (7).
(3) is a provisional word dictionary searcher that searches for words from η; (3) is a general word dictionary searcher that searches for a word using a general word dictionary (7) if the provisional word dictionary searcher (16) fails; (4) is a determiner that determines whether the search result of searcher Oe or searcher (3) is appropriate, (5) is an output register that stores the output from determiner (4), and (6) is an output register (5). ) is a display device that outputs the contents of If the judgment result of path (4) is valid, should the search results of the general word dictionary search device (3) held in the output register (5) be registered in the provisional term dictionary (1η? A registration determination circuit (31) is a registration circuit that registers the contents of the output register (5) according to the determination result of the registration determination circuit (30).

FIG. 4 shows the search device (16) in FIG. 3 in detail. In the figure, (2) is the input register a□
~a9 is the input kana character string, (2Il is the provisional word dictionary (1
71 is a word extractor that extracts registered words from the extractor (21), (2) is a heading register from the extractor (21), (the fence is a comparator that compares the contents of the input register (2) and the extracted word register ■),
0g) is a comparison judgment circuit that judges the comparison result of the comparator 081, and 0g) is an output register when the judgment is successful.

Next, the operation will be explained.

The input kana character string inputted from the input device (1) is stored in the input register (2) and is applied to the search device 06).

The searcher (161) searches the words stored in the provisional word dictionary α'71 using a rule different from the longest match method. For example, according to the "last in, fast out" rule, words are searched one by one from the last registered word. Extract in order and input register (2
) is searched based on whether the heading part is included. If the search fails, the search device (3) searches the general word dictionary (7), and if it succeeds, the search device (3) is skipped. A judger (4) judges the validity of the search results using system-specific judgment criteria,
If successful, the result is output to the output register (5) and displayed on the display (6). The operation of the general word dictionary search device (3) is the same as the conventional one shown in FIG.

The operation of the provisional word dictionary search device αe will be explained with reference to FIG.

The extractor 21+ sequentially extracts one word from the dictionary αη in one direction each time there is a request, and stores the heading in the register ■. Comparator Q8) compares the contents of input register (2) and header register @, and if the contents of register @ are included in the contents of register (2) including the contents of register (2) and the beginning, it is considered that the search has been performed. , print that word,
Store in register (22). Here, if the content of the register is longer or if there are unmatched characters in the middle, that word is deemed inappropriate and the extractor (21) is instructed to extract the next word.

Note that the registration of words in the provisional word dictionary 07) is performed as follows. That is, the kana character string input device (1) is equipped with a key for selecting the next candidate, and if the user does not find the desired conversion result, the user presses the next candidate key to cause the system to search for the next candidate. By pressing this next candidate key, the registration determination circuit (to) determines that the contents of the d register (5) after the search should be registered, and the registration circuit 01) registers the output register (5) according to the instructions from the registration determination circuit ■. The contents are registered in the temporary word dictionary 07) and sent to the display device (6).

As described above, according to the present invention, a dictionary that temporarily stores word data specified by the user is built on the system separately from the general word dictionary, and before searching the general word dictionary, the dictionary is We configured the system to perform a search, and also used a quick search rule that differs from that of a general word dictionary, so even though a certain conversion result is frequently used depending on the length of the heading, it is always This avoids the inefficiency of outputting the result after another unused conversion result.

[Brief explanation of drawings]

Fig. 1 is a block diagram of a conventional kana-kanji conversion device, Fig. 2 is a detailed circuit diagram of its word search circuit, Fig. 3 is a block diagram of a kana-kanji conversion device according to an embodiment of the present invention, and Fig. 4 is a provisional diagram. The search circuit diagram of the dictionary section shows (1)...kana character string input device, (3)...general word dictionary search device, (4)...determiner, (7)...general word dictionary. , Q6+... Provisional word dictionary search device, 0η... Provisional word dictionary, ■... Registration determination circuit, 011... Registration circuit. Note that the same reference numerals in the figures indicate the same or equivalent parts. Agent Shin Kuzuno - Figure 1 Figure 2 Figure 3 Figure 4

Claims (1)

[Claims] (1) A kana character string input device for inputting kana character strings, a general word dictionary in which general words are registered, and a search rule for the general word dictionary that will always rank lower in the search ranking than other registered words. a provisional word dictionary for registering words, and a provisional word dictionary search device for searching registered words having the heading of the kana character string from the provisional word dictionary based on provisional word search rules different from general word search rules. and a general word dictionary search device that searches the general word dictionary for registered words with the heading of the kana character strings based on search rules for general words when the search using the provisional word dictionary fails, and the temporary word dictionary search device or the general word dictionary. A determiner that determines whether the search results of the word dictionary search device are valid or not, and if the determination results of the determiner are valid, whether or not the search results of the general word dictionary search device should be registered in the provisional word dictionary. 1. A kana-kanji conversion device comprising: a registration determination circuit that determines whether or not a word is written; and a registration circuit that registers a search result of the general word dictionary search device in the provisional word dictionary according to the determination result.