JPH10143502A - Sentence input device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To improve the efficiency of input by converting KANJI (Chinese character) established by a KANJI/KANA (Japanese syllabary) conversion means into KANA, converting the converted KANA into the KANJI by a KANA/KANJI conversion means, and then storing the KANJI in an abbreviated conversion buffer by an abbreviated conversion registration means. SOLUTION: A KANA/KANJI converter 1-7 converts the inputted KANA to the KANJI and a KANJI/KANA converter 1-8 converts the established KANJI to the KANA. A KANA/KANJI conversion dictionary 1-9 performs conversion from the KANA to the KANJI and a KANJI/KANA conversion dictionary 1-10 performs the conversion from the KANJI to the KANA. A KANA/KANJI conversion buffer 1-11 sets the KANA to be converted to the KANJI and a KANJI/KANA conversion buffer 1-12 sets the KANJI to be converted to the KANA. An abbreviated conversion storage device 1-13 stores the pair of words turned to the KANA and the KANJI and the abbreviated conversion buffer 1-14 stores abbreviated conversion data. A word conversion retrieval device 1-15 retrieves the word by the KANA and an external storage device 1-16 registers character data and the abbreviated conversion buffer to an FD or the like.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a Japanese word processor, DTP, and portable terminal.
The present invention relates to a text input device for performing kana-kanji conversion.

[0002]

2. Description of the Related Art FIG. 12 is a block diagram of a conventional text input device, which includes a CPU 101 for controlling the whole, a keyboard 102 for inputting kana, and a CRT 10 for displaying input characters.
6. A printing device 103 for printing the input characters, a sentence buffer 107 for storing the input characters, a cursor pointer 108 indicating the cursor position of the sentence buffer, a kana-kanji conversion device 104 for converting the input kana into kanji, and a kana for storing the kana It comprises a buffer 105.

FIG. 13 shows that a certain character string is a kana buffer 105.
FIG. 7 is a diagram showing an example of a case where the data is stored in a sentence buffer 107 from FIG.

[0004] As such conventional examples, there are the following references.

Japanese Patent Application Laid-Open No. Hei 2-181221 discloses that when a conversion instruction is made with a conversion key to Hiragana or Katakana, the conversion is made to Katakana, and the converted word is registered as a word. Thereafter, conversion to Katakana is possible by a normal conversion operation. It is what becomes.

[0006] Although this automatically registers words, the speed at the time of input can be increased. However, there is no effect when correcting homonyms later.

Japanese Patent Laid-Open Publication No. Hei 3-235162 discloses that, when re-converting a determined kanji, if the kana is determined to be a kanji, the buffer can be released and the conversion can be continuously performed. Can not.

Japanese Unexamined Patent Publication No. Hei 5-189418 discloses a method in which, when a part of a word is inputted and a conversion operation is performed, the input is smoothly performed by a shortening conversion function for converting the word into a corresponding word. Cannot be operated on.

[0009]

When taking the minutes of a meeting at a meeting or the like, there is a case where it is not possible to take time to select a homonym just by inputting.

[0010] When reviewing after the meeting is over, if the document is saved at the end of the meeting, it becomes impossible to select a homonymous word, and it is necessary to input again a word in which the homonym is missed.

If there is a function that enables conversion of kanji to kana and reconversion of the determined kanji, the next candidate can be selected using that function. Since the word is not stored in the short conversion buffer, it cannot be quickly input by the short conversion.

[0012]

According to a first aspect of the present invention, there is provided a sentence input device, wherein kana-kanji conversion means for converting a kana character to a kanji character corresponds to a part of the first character of the kana character and the converted kanji. Short conversion registration means for registration, short conversion search means for searching a corresponding word from a short conversion buffer during kana-kanji conversion, kanji kana conversion means for converting kanji to kana characters, and kana-kanji conversion of the kana characters again A sentence input device comprising re-conversion means and re-shortened conversion registration means for registering a part of a kana from the first character and a re-converted kanji in correspondence with each other.

According to a second aspect of the present invention, the sentence input device further comprises a short conversion deletion unit for searching and deleting a combination of a kanji character and a kana character stored in the short conversion registration unit from a short conversion buffer. The sentence input device according to claim 1.

According to a third aspect of the present invention, there is provided the text input device according to the first aspect, wherein the short conversion buffer is registered and called together with the text buffer.

According to a fourth aspect of the present invention, in the kanji kana conversion, if a kana character of the kana character exists in the kanji kana conversion, the kana character in the buffer is preferentially searched for in the shortened conversion buffer. The sentence input device according to claim 1, wherein the text input device converts the sentence into a sentence.

A sentence input device according to claim 5, wherein in said kanji kana conversion, it is determined whether or not a word whose first character is a character before and after a cursor position in the sentence is stored in said shortened conversion buffer. 2. The sentence input device according to claim 1, wherein, if stored, the word is converted into kanji kana.

[0017]

DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described with reference to FIGS.

FIG. 1 is an overall configuration diagram. CPU (1-1) for controlling the whole, keyboard (1-
2), a CRT (1-4) for displaying the input characters, a printing device (1-3) for printing the input characters, a text buffer (1-5) for storing the input characters, and a cursor position of the text buffer. A cursor pointer (1-6), a kana-kanji conversion device (1-7) for converting input kana into kanji,
Kanji Kana conversion device (1-
8), Kana-kanji conversion dictionary (1-9) for converting kana to kanji, kanji kana conversion dictionary (1-10) for converting kanji to kana, kana for setting kana for conversion to kanji Kanji conversion buffer (1-11), Kanji kana conversion buffer (1
-12), a short conversion storage device (1-13) for storing pairs of kana and kanji words, a short conversion buffer (1-14) for storing short conversion data, and a word conversion search for searching words by kana. Device (1-15), an external storage device (1-1) for registering character data and a short conversion buffer in an FD or the like.
6).

The cursor pointer (1-6) indicates the current cursor position. The character string is taken out from the sentence buffer (1-5), set in the kanji / kana conversion buffer (1-12), and the kanji / kana conversion processor (1-10) searches for kana from kanji. Set in the kana-kanji conversion buffer (1-11).

FIG. 2 shows a case where the "kanji kana conversion" of "convert kanji kana" is when the cursor is at the "inversion".

The "kanji kana conversion" is set in the kanji kana conversion buffer, "kanji" is searched from the kanji kana conversion dictionary with "kanji" as a heading, and set in the candidate buffer.

Since there is no other candidate, "kanji" in the candidate buffer is set in the kana-kanji conversion buffer. After that, the process is the same as the normal kana-kanji conversion.

FIG. 3 is a view showing a case where the cursor is located on the “line” of “I gave a lecture”.

"Go" is loaded into the Kanji / Kana conversion buffer, "Go" and "Go" are taken out of the Kanji / Kana conversion dictionary, the ending process is performed, and two candidates of "Go" and "Go" are set in the candidate buffer. I do.

Although the frequency of "go" is higher, the kana "o" in front of the cursor is extracted and the example dictionary is searched.
Since “do” and “do” are present, “do” is set as a first candidate in the kana-kanji conversion buffer, although the frequency is low.

FIG. 4 shows candidates for conversion to kana in the case of “performed”. There are two types of candidates, “performed” and “was”.

FIG. 5 is a screen display example of kanji kana conversion.

The display is changed by the cancel key.

FIG. 6 shows an example of the shortening conversion buffer.

“Ko” → “high school” means that “high school” can be shortened and converted by “ko”.

First, a kana is input (6-1) and converted to a kana-kanji (6-2).

When the homonym is determined, a pair of the first part of the kana and the kanji is stored in the shortened conversion buffer. When you register and call again, the kanji is fixed.

When the conversion key is pressed at the determined position of the kanji, the kanji is internally converted to a kana by the kanji kana conversion, and the kana is converted again from the kana to the kana.

At this time, a pair of kana and kanji is stored in the shortening conversion buffer (6-3).

Subsequently, the shortened conversion data corresponding to the kanji displayed so far is deleted from the shortened conversion buffer (6).
-4).

FIG. 7 shows an example of processing at the time of registration call.

When text data is stored in the floppy, the data of the shortening conversion buffer is also attached and registered.

When the text data is called, if the shortened conversion buffer is attached, it is called together.

FIG. 8 is a flowchart of the kana-kanji conversion.

First, when a kana is input (8-1) and a conversion key is pressed (8-2), a kana is set in a kana-kanji conversion buffer, and a kana-kanji conversion dictionary is used by a kana-kanji conversion dictionary. Conversion processing is performed (8-3).

Then, the word having the highest frequency among the conversion candidates is displayed (8-4).

If it is not the displayed candidate, the next candidate key is pressed (8-5), and the same phonetic word processing is performed (8-
6) The next candidate is displayed (8-4).

When the selection of the kanji is completed, the pair of the kanji and a part of the head of the current kana is registered by the short conversion registration means (8-
7).

When the text is completely input, the document is registered (8-8).

At this time, the short conversion buffer is also registered as a pair (8-9).

FIG. 9 is a flowchart of the kanji kana conversion.

The registered text is called (9-
1) If there is shortened conversion data in a pair, the shortened conversion data is also called (9-2).

When the sentence is reviewed from the beginning, the cursor is moved to the word where the same word is miss-selected and the conversion key is pressed (9-3), the kanji at the cursor position is set in the kanji kana conversion buffer, and the kanji kana is set. The conversion means converts the kanji to kana (9-4).

If there are a plurality of pseudonym candidates (9-5),
The short conversion buffer is searched to determine whether the word at the cursor position is used (9-6), and the one in the short conversion buffer is set as a first candidate.

If there is no candidate (9-7), the cursor position is internally shifted back and forth (9-8), and the shortened conversion buffer is searched for a word starting with that character (9-).
9).

When the kana is determined, kana-kanji conversion is performed with the kana (9-10), and the first candidate is displayed (9-11).

If it is not the desired candidate, the next candidate is displayed with the next candidate key (9-12).

When the kanji is determined, a pair of the kanji and a part of the beginning of the kana is registered in the shortening conversion (9-13).

The previous conversion of the kana and kanji pair is deleted from the shortened conversion buffer (9-14).

FIG. 10 shows an example of the actual correction.

When the user wants to input "Still life shines", but inputs without selecting the same phonetic word, "the creature grows"
It has become.

Move the cursor to "creature" and press the conversion key.

There are three kinds of pseudonyms of "creatures": "creatures", "natural things", and "seibutsu".

Then, the short conversion buffer is searched, and since "se → living" is present, "seibutsu" is selected as the first candidate of the kana, and "living""stilllife" obtained by the kana-kanji conversion of "seibutsu". Among them, the "still life" that has not appeared in the past is the next candidate.

“Grow” also replaces “shine”,
In the shortening conversion buffer, “se → creature” and “ha → grow” disappear, and “se → still life” and “ha → shine” are stored. Subsequently, a “still life” is output by the “se” conversion, so that subsequent inputs can be performed efficiently.

FIG. 11 shows an example of the fifth embodiment. If the cursor is not at the beginning of a word, in this case, "thing" of "creature"
It is not possible to decompose one sentence "creature grows" into "creature / thing / grows", so if you move the cursor back one character and decompose even "creature / grows" Can not.

It is possible to move the cursor one character forward and disassemble it as “living / growing”.

[0063]

According to the first aspect of the present invention, when the kanji-kana conversion means converts the determined kanji into kana, and the kana-kanji conversion means continuously converts the returned kana to kanji, the kana-kanji conversion is shortened. The conversion registration means stores it in the shortened conversion buffer.

The word stored when re-converted by the next input is searched and converted by the short conversion search means.

As described above, after the determined kanji is re-converted to select a homonymous word, the kanji selected earlier can be shortened when adding a sentence, so that the input can be performed efficiently.

According to the second aspect of the present invention, when the kanji-kana conversion means converts the determined kanji into kana, and the kana-kanji conversion means subsequently converts the returned kana to kanji, the shortened conversion registration Means to store in the shortened conversion buffer.

At this time, the short-form conversion data stored last time is deleted by the function of the short-form conversion registration means.

The word stored when reconverted by the next input is searched for and converted by the short conversion search means.

As described above, since the abbreviated conversion of the word selected first is invalidated, a homophone that does not require the abbreviated conversion does not appear, and the input can be performed efficiently.

According to the third aspect of the present invention, when the kanji-kana conversion means converts the determined kanji into kana, and the kana-kanji conversion means subsequently converts the returned kana into kana-kanji, the shortened conversion registration is performed. Means to store in the shortened conversion buffer.

The word stored when re-converted by the next input is searched and converted by the short conversion search means.

The document data and the shortening conversion buffer are registered as a pair in the external storage device.

As described above, since the shortened conversion buffer is registered together with the sentence, the sentence can be corrected smoothly on another machine.

According to the fourth aspect of the invention, the determined kanji is converted into kana by the kanji-kana conversion means, and the returned kana is converted into kana-kanji by the kana-kanji conversion means.

At this time, if there are a plurality of candidates, conversion to a kana corresponding to the kanji in the shortened conversion buffer is prioritized.

The data is stored in the short conversion buffer by the short conversion registering means.

The words stored when re-converted by the next input are searched for and converted by the short conversion search means.

As described above, when there is a homonym of the kana in the kanji kana conversion, the contents of the shortened conversion buffer are searched, and the homonym in the buffer is preferentially converted into the kana, so that Can be reduced, and the input can be performed efficiently.

According to the fifth aspect of the present invention, the abbreviation conversion search means checks whether a word whose first character is the character before and after the cursor position in the text is stored in the abbreviation conversion buffer, and if it is found. Kanji kana is converted to the word.

As described above, it is checked whether or not a word whose first character is the character before and after the cursor position in the sentence is stored in the shortening conversion buffer, and by converting the word into kanji kana, the cursor position is not always strict. Since there is no need to bring the word to the beginning, it is possible to input efficiently.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of a text input device according to the present invention.

FIG. 2 is a diagram (part 1) illustrating an example of kanji kana conversion;

FIG. 3 is a diagram (part 2) illustrating an example of kanji kana conversion;

FIG. 4 is a diagram (part 3) illustrating an example of kanji kana conversion;

FIG. 5 is a diagram showing an example of a screen display of kanji kana conversion.

FIG. 6 is a diagram illustrating an example of a shortening conversion buffer.

FIG. 7 is a diagram showing an example of processing at the time of registration call;

FIG. 8 is a flowchart (part 1) of kana-kanji conversion.

FIG. 9 is a flowchart (part 2) of kana-kanji conversion.

FIG. 10 is a diagram showing an example of an actual operation.

FIG. 11 is a diagram showing a text buffer and a shortening conversion buffer.

FIG. 12 is a configuration diagram of a conventional text input device.

FIG. 13 is a diagram showing conventional buffer management.

[Explanation of symbols]

 1-1 CPU 1-2 Keyboard 1-3 Printing device 1-4 CRT 1-5 Sentence buffer 1-6 Cursor pointer 1-7 Kana-kanji conversion device 1-8 Kanji-kana conversion device 1-9 Kana-kanji conversion dictionary 1 10 Kanji Kana Conversion Dictionary 1-11 Kana-Kanji Conversion Buffer 1-12 Kanji Kana Conversion Buffer 1-13 Abbreviated Conversion Storage 1-14 Abbreviated Conversion Buffer 1-15 Abbreviated Conversion Searching Device 101 CPU 102 Keyboard 103 Printing Device 104 Kana-Kanji Conversion Device 105 Kana buffer 106 CRT 107 Text buffer 108 Cursor pointer

Claims (5)

[Claims] 1. Kana-kanji conversion means for converting a kana character to a kanji, shortened conversion registration means for registering a part of the kana character from the first character in association with the converted kanji, and shortened conversion at the time of kana-kanji conversion. Abbreviated conversion search means for searching for a corresponding word from the buffer, kanji kana conversion means for converting kanji to kana characters, re-conversion means for converting the kana characters again to kana kanji, and a part of the first character of kana A sentence input device provided with re-shortened conversion registration means for registering the re-converted kanji in association with the kanji. 2. A sentence according to claim 1, further comprising a short conversion deletion unit for retrieving and deleting a combination of kanji and kana characters stored in the short conversion registration unit from a short conversion buffer. Input device. 3. The text input device according to claim 1, wherein the shortened conversion buffer is registered and called together with a text buffer. 4. The method according to claim 1, wherein in the kanji kana conversion, when a homonym of the kana character exists, the inside of the shortened conversion buffer is searched and the homonym in the buffer is preferentially converted into the kana character. The text input device according to claim 1. 5. In the kanji kana conversion, it is determined whether or not a word whose first character is the character before and after the cursor position in the sentence is stored in the shortened conversion buffer. 2. The sentence input device according to claim 1, wherein the kanji-kana conversion is performed.