JPS5918729B2 - Money Kanji conversion device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a kana-kanji conversion device that automatically corrects input errors.

In general, a kana-kanji conversion device has a dictionary storage section that stores kana series and kanji phrases in correspondence, and searches whether the kanji/idioms corresponding to the input kana series are present in the dictionary storage section. Outputs the corresponding kanji/idioms.

In this case, if the input kana sequence is incorrect, it is clear that incorrect kanji/idioms will be output or cannot be converted into kanji/idioms. For example, if an operator inputs a sentence using a keyboard in kana characters, if he accidentally types "gatsuko" instead of "school", it will not be converted correctly.

In this case, if ``gatsukou'' is not typed correctly, it will not be correctly converted to ``school.'' Similarly, if you mistakenly type ``kozutsumi'' instead of ``parcel'', it will not be converted correctly. In particular, on many input keyboards, "
Since the same key is used for ``tsu'' and ``tsu'' and a different shift key is used to distinguish between the two, there is a problem in that the operator is likely to make typos. The present invention has been made in view of the above circumstances, and it is an object of the present invention to provide a kana-kanji conversion device that can automatically correct input errors.

According to the present invention, a code conversion unit is provided that converts kana that is easy for an operator to make an error and basic kana, and even if the dictionary storage unit is searched based on the input kana series, there is no corresponding kanji or compound word. If the kana sequence is not found, the input kakana sequence or the kana sequence read from the dictionary storage section is converted by the code conversion section, and the search is performed again using the converted kana sequence.

In this specification, "error-prone kana" refers to kana character codes that are easy for operators to make mistakes due to the structure of the input device, for example, kana characters that are often input incorrectly due to the following syllables, consonants, or operator habits. This is the character code to represent.

Furthermore, "basic kana" is a character code representing a (correct) kana corresponding to "error-prone kana", and particularly refers to a kana character code used when performing the above-mentioned re-search.

For example, in the example shown below, for the above-mentioned consonants and consonants, the clear sound of the normal character corresponding to each of them is "tsu, yu, yo".
etc. Furthermore, to simplify the explanation, the kana series will be written as ``gatsuko,'' and the kanji/idioms will be written as ``school,'' but it goes without saying that these are both kana or kanji character code strings. FIG. 1 shows an embodiment of the present invention. In the figure, 1 is a temporary storage unit that temporarily stores the input kana sequence, 2 is a consonant/consonant conversion unit,
3 is a dictionary look-up control section, 4 is a consonant/continent conversion section, 5 is a dictionary storage section, and 6 is a conversion table storage section. Dictionary storage unit 5
has memorized a large number of correspondences between the kana series and kanji/idioms.

For example, as shown in the figure, the kana series ``gatsuko'' and the idiom ``school'' are stored as a pair. The dictionary lookup control section 3 searches the dictionary storage section 5, and has a comparison circuit that compares the kana series sequentially read out from the dictionary storage section 5 with the kana series in the temporary storage section 1. When the circuit detects a match, it outputs the kanji/idiom corresponding to that kana sequence and ends the search.

If all kana series in dictionary storage section 5 are temporary storage section 1
If there is no match at all with the kana sequence within, there is an extremely high possibility that the input kana sequence is incorrect. At this time, the dictionary lookup control section 3 outputs an ON signal for driving the sound/consonant conversion sections 2 and 4, and starts searching again. The consonant and consonant conversion units 2 and 4 are code converters that convert the character codes of consonants and consonants included in the kana series into the corresponding character codes of clear consonants.

The conversion section 2 converts the code of the kana sequence in the temporary storage section 1 and supplies it to the dictionary lookup control section 3. The conversion unit 4 is a dictionary storage unit 5
The kana sequence read out from the code is converted and supplied to the dictionary lookup control section 3. A conversion table storage section 6 is provided for this code conversion, and stores a correspondence table between the character codes of sulson and consonant and the corresponding character codes of clear sound. When the 0N signal is supplied to the consonant and consonant conversion sections 2 and 4, it is checked whether or not there is a consonant or consonant character code stored in the conversion table storage section 6 among the character codes constituting the kana series input to each of them. Detect and convert the character code, if any, to the corresponding Kiyone character code. Therefore, in the re-search, the dictionary lookup control unit 3 sequentially compares the basic kana series that have undergone code conversion, and when a match is found, outputs the corresponding kanji/idiom. can.

The overall flow will be described again with reference to the flowchart in FIG. When the input kakana series is supplied, first block 100
In this step, the conversion units 2 and 4 are set to the 0FF state (no code conversion). Next, in block 101, a search is made to see if the input kakana series exists in the dictionary storage section 5. As a result of the search, if a kanji/idiom exists, the process proceeds to block 102, where the kanji/idiom is output and the process ends. PROTSUKU 101
As a result of the search, if there is no kanji or compound word corresponding to the input kakana series, the process advances to block 103, where conversion unit 2,
4 is in the 0N state or the 0FF state. If the converters 2 and 4 are in the 0FF state, the converters 2 and 4 are set in the ON state in the block 104, and the plotter 101 performs the search again. On the other hand, if the converters 2 and 4 are in the ON state at block 103, the process advances to block 105.
At this time, even after re-searching, the kanji/idioms corresponding to the input kakana series (code converted) do not exist in the dictionary storage section 5, so the input kakana series is output as is and the process ends. For example, consider a case where the operator mistypes "school" and inputs "gatsuko".

In the first search, there is no phrase corresponding to "gatsuko", so the dictionary lookup control section 3 outputs an ON signal. Then, the conversion unit 2 checks whether the input kakana series "gatsukou" has a consonant or a consonant. In this case, since there are no consonants or consonants, "gakko" is supplied as is to the dictionary lookup control section 3 again.
On the other hand, the converter 4 similarly checks the kana sequences sequentially read out from the dictionary storage 5 to see if there are any consonants or consonants.
When the re-search progresses and "Gatsukou" is now read out, the conversion unit 4 converts the code to "Gatsukou" and supplies it to the dictionary lookup control unit 3. Therefore, the dictionary lookup control unit 3 can output "school" since both kana sequences match. FIG. 3 shows a configuration diagram of the dictionary lookup control section 3.

10 is a code buffer that accommodates the input kakana series supplied via the converter 2; 11 is a code buffer that accommodates the kana series and kanji/idioms supplied from the dictionary storage unit 5 via the converter 4; 12 is a code buffer that accommodates the input kakana series supplied via the converter 4; 13 is a read control unit for accessing the dictionary storage unit 5; 14 is a flip-flop for generating an ON signal; and 15, 16, and 17 are output gates.

Every time a mismatch signal is output by the comparison circuit 12, the read control section 13 accesses the dictionary storage section 5 and sets different data into the code buffer 11. If no match is found in the first search, the readout section 13 outputs a search end signal and sets the flip-flop 14 (the flip-flop 14 is initially set). Flip-flop 14 outputs an ON signal in the set state. When the comparison circuit 12 outputs a match signal in the next re-search, the kanji/idiom at that time is outputted via the gates 15 and 17, and the flip-flop 14 is reset.

If there is no matching kana sequence even after the re-search is completed, the contents of the code buffer 10 are output as they are via gates 16 and 17.

FIG. 4 shows a configuration diagram of the consonant/continent converter 2. As shown in FIG.

Reference numeral 20 denotes a readout control unit that retrieves each character code from the temporary storage unit 1 and stores it in the code buffer 21. Reference numeral 22 stores a pair of character codes for sul-on and consonant and corresponding character codes for clear sound read out from the conversion table storage unit 6. 23 is a comparison circuit, 24 is a read control unit for sequentially accessing data from the conversion table storage unit 6, and 25, 26, 27, 28, and 29 are gates.

In the case of the first search to which the ON signal is not currently supplied, the gate 27 is opened by the output of the gate 25, and the contents of the code buffer 21 are directly supplied to the dictionary lookup control section 3 via the gate 29. Ru. Next, in the case of re-search when the 0N signal is supplied, the code buffers 22 and 21
The contents of When the comparison circuit 23 issues a matching signal, since the content of the code buffer 21 is a consonant or a consonant, the corresponding clear consonant in the code buffer 22 is outputted via the gates 28 and 29. If all the data in the conversion table storage section 6 do not match, the contents of the code buffer 21 are output as they are via the gates 27 and 29 in response to the end signal output from the read control section 24.
As described above, according to the present embodiment, it is possible to automatically correct input errors in kana series including persistent consonants and consonants, which are likely to cause typographical errors by the operator, and to correctly perform kana-kanji conversion.

This embodiment does not necessarily correct all input errors.

For example, if you type ``hospital'' by mistake and type ``beauty salon,'' if the dictionary includes ``beauty salon,'' ``beauty salon'' will be output as the first search result. On the other hand, “Beauty Salon”
If you type "biyoin" when you want to input "hospital", it will output "hospital". In such a case,
It is necessary for the operator to view the kana-kanji conversion results and make corrections. However, most typographical errors in kana series with consonants and consonants can be automatically corrected by the above embodiment. Another character that operators are prone to making mistakes is confusing voiced and semi-voiced sounds. This is thought to be largely due to the fact that on a normal keyboard, voiced keys and semi-voiced keys are arranged side by side. For example, there are cases where ``Biyoin'' is mistaken for ``Biyoin''. In such cases, the problem can be solved by changing the basic kana to voiced sounds. That is, in the above embodiment, the conversion table storage unit 6 stores a correspondence table between a semi-voiced sound such as “ba” and a corresponding voiced sound such as “ba”, and each conversion unit 2 and 4 stores a correspondence table between a semi-voiced sound such as “ba” and a corresponding voiced sound such as “ba”, and each conversion unit 2 and 4 stores Convert all half-voiced sounds to voiced sounds,
All you have to do is search again. In addition, the present invention can similarly automatically correct characters and character strings that are likely to be input incorrectly by the operator due to structural constraints of the input device, or characters and character strings that are likely to be incorrectly input due to the operator's own habits. . The present invention is not limited to the above embodiments.

In the above embodiment, the basic kana is a clear sound corresponding to a persistent sound or a consonant sound, but conversely, the basic kana may be a persistent sound or a consonant sound. That is, it is clear that the converting units 2 and 4 may code-convert all the clear sounds corresponding to the consonants and consonants in the kana series to the consonants and consonants, and then search again. In addition, the conversion section 4 is removed, and instead, the dictionary has two types of kana series: the original series with consonants and consonants, and the series in which all the consonants and consonants are replaced with the clear consonants of regular characters. The dictionary lookup (search) is performed using the original kana series, and if it fails, the conversion unit 2
It is also possible to set the character to 0N and set the reference kana series in the dictionary to the normal character side. Furthermore, considering the above-mentioned cases of "hospital" and "beauty salon", the kana-style evening 1 from the dictionary storage unit 5
By converting all the consonants and consonants of Okino into normal characters in advance and keeping the converter 2 in the 0N state,
Since "beauty salon" and "hospital" are homophones, both can be output.

In this case, there is no need to distinguish between persistent consonants and consonant consonants at the time of input, so input becomes easy. Others, enter kana0CR
It can be used as an automatic error correction device for 0CR by reading the reading result such as , and changing the kanji/idioms in the dictionary storage unit 5 to kanji and leaving them as correct words, such as (gatsu koichi gatsu ko). It is also possible.

[Brief explanation of drawings]

FIG. 1 is a diagram showing an embodiment of the present invention, FIG. 2 is a flowchart showing the operation of an embodiment of the present invention, and FIGS.
The figure is a partial configuration diagram of an embodiment of the present invention. 1...temporary memory, 2,4...sound
Consonant conversion unit, 3... Dictionary lookup control unit, 5...
... Dictionary storage section, 6... Conversion table storage section.

Claims (1)

[Scope of Claims] 1. A temporary storage unit that stores the input kana sequence, and outputs the kana sequence output from the temporary storage unit as it is, or at least converts it into a consonant sound, a consonant sound, and a clear sound before outputting it. a code conversion section; a dictionary storage section that stores kanji phrases corresponding to a large number of kana sequences; and a dictionary storage section that searches the dictionary storage section using the kana sequences outputted as is from the code conversion section to find kanji phrases corresponding to the kana sequences. a dictionary look-up control unit that outputs a sequence subjected to kana-kanji conversion and outputs a code conversion instruction signal when a corresponding kanji compound word does not exist; The code converting unit converts at least a persistent sound or a consonant included in the input kana series to a clear sound or a clear sound to a persistent sound or a consonant, and the dictionary lookup control unit searches the dictionary storage unit again using the converted kana series. A kana-kanji conversion device featuring: 2. The kana-kanji conversion device according to claim 1, wherein the code converter converts a cursive sound in a kana series into a semi-voiced sound. 3. A temporary storage unit that stores input kana sequences, a dictionary storage unit that stores a large number of kana sequences and corresponding kanji phrases, and searches the dictionary storage unit using the kana sequences output from the temporary storage unit. and a dictionary look-up control unit that outputs a kanji compound word corresponding to the kana series as a series subjected to kana-kanji conversion and outputs a code conversion instruction signal when the corresponding kanji compound word does not exist; and this dictionary look-up control unit. a code conversion unit that outputs the dictionary kana series read from the dictionary storage unit as is to the dictionary lookup control unit, or at least converts it into a consonant/consonant sound and a clear sound and outputs it, the code conversion unit In response to a code conversion instruction signal from
The kana-kanji conversion device is characterized in that the dictionary conversion control unit compares the converted dictionary kana series with the input kana series.