JP2833650B2 - Document processing device - Google Patents

Description

Description: BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a document processing apparatus for inputting document information using an alphabet key.

[Prior Art] In a conventional Japanese document processing device (word processor), code information input using alphanumeric keys or the like is converted into document information by Roman kana / kanji conversion or the like and stored in a memory. It is displayed on the display such as the display.
When inputting an English word, a foreign word, or the like in katakana at the time of inputting the document, the input is performed using a letter key in a Roman character format corresponding to the katakana reading.

[Problems to be Solved by the Invention] However, an operator who is accustomed to the operation of an English word processor or the like must use a spelling of English when inputting a katakana reading of an English word, while having to input it in Roman characters. You may enter it. For example, when you enter "Spring" in katakana, you must enter "SUPURINNGU" in Roman alphabet input, but sometimes you enter "spring" due to the habit of English word input. Then, the input document information is converted into “SPRIng” by the Roman character kana conversion, which is completely different from the input of “spring” desired by the operator.

As described above, conventionally, for those who are accustomed to inputting English words, it may be easier to input katakana in English than in Roman characters, and the number of key presses required for input can be reduced. In spite of the case, it has always been possible to input Japanese documents, especially katakana characters, etc., only in romaji or kana.

The present invention has been made in view of the above conventional example, and in a kana-kanji conversion device based on Roman character input, when other information is input after alphabetic information, based on the determination of uppercase and lowercase of the alphabetic information. It is an object of the present invention to provide a document processing apparatus capable of inputting document data by processing as English word information or converting to Kana / Kanji as Roman character information.

[Means for Solving the Problems] In order to achieve the above object, a document processing apparatus of the present invention has the following configuration. Input means for inputting alphabetic information and other information; kana-kanji conversion means for performing Roman-kana-kanji conversion based on the English character information input by the input means; and the other information after the English character information. Determining means for determining whether or not the character information has been input; determining means for determining the uppercase / lowercase of the alphabetic information; and when the determining means determines that the other information has been input after the alphabetic information. Control means for controlling whether to process the English character information as English word information or to convert kana to kanji by the kana to kanji conversion means as Roman character information based on a result of the judgment by the judgment means. And

[Operation] In the above configuration, when it is determined that other information has been input after the input alphabetic information, based on the determination result of whether the input alphabetic information is uppercase or lowercase,
An operation is performed to control whether to process the English character information as English word information or to convert Roman character to Kana to Kanji as Roman character information.

Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings.

[Description of Word Processor (FIGS. 1 and 4)] FIG. 1 is a diagram showing a schematic configuration of a word processor according to the embodiment.

In the figure, 100 is a control unit for controlling the entire apparatus, 101
Is a keyboard for inputting document information and various function instructions, etc.
It is provided with a conversion key 102 for indicating an English word part of the input document information. A display unit 103 such as a CRT or a liquid crystal displays input document information and various messages to an operator. Reference numeral 104 denotes a document memory such as a hard disk which stores the document information input from the keyboard 101 in a nonvolatile manner.

 Next, the configuration of the control unit 100 will be described.

Reference numeral 111 denotes a CPU such as a microprocessor, for example, which outputs various control signals in accordance with control programs and various data stored in the program memory 112 and shown in the flowcharts of FIGS. Has control.
The RAM is used as a work area of the CPU 111, and temporarily stores document data including an input key code, and stores designation mode data to be described later. Reference numeral 113 denotes a katakana conversion table in which readings are stored in katakana codes corresponding to English word character strings, an example of which is shown in FIG.

The katakana conversion table 113 has English words arranged in alphabetical order like an English dictionary, and is configured to make it easy to search for input English words. FIG. 4 shows an example of data of the English word “SPRING”.
Is a code "FEH" indicating the end of the spelling of an English word, and this code 41 is followed by a corresponding katakana reading code sequence. Reference numeral 42 denotes a code "FFH" indicating the end of katakana reading. Following this code 42, the next English word string is stored. Here, "H" indicates a hexadecimal number.

Reference numeral 114 denotes a pattern memory for inputting code information and outputting corresponding pattern data. Reference numeral 115 denotes a Roman-Kana conversion dictionary for creating Katakana or Hiragana characters from the input Roman-character information. Reference numeral 116 denotes a character buffer for storing a key code input from the keyboard 101.

With the above configuration, alphabetic key codes input from the keyboard 101 are sequentially stored in the character buffer 116 of the RAM. At this time, if an instruction to convert an English word into katakana has not been input by the conversion key 102, the character buffer 11
The 6 key codes are sequentially converted to katakana or hiragana codes in Romaji kana, converted to character patterns by the pattern memory 114, and displayed on the display unit 103.

If an instruction to convert an English word to katakana is given by the conversion key 102, the character buffer
116, and the next time the conversion key 102 is pressed, the English word code of the character buffer 1116 is stored in the conversion table 11.
3 and convert it to Katakana code
It is converted into the corresponding character pattern by 14 and displayed on the display unit 103.

[Explanation of Operation (FIGS. 2 and 3)] FIG. 2 is a flowchart showing key input processing in the word processor of the embodiment. This processing program is started when a key of the keyboard 101 is pressed. .

In step S1, it is determined whether or not the character key of the keyboard 101 has been input. If the character key has not been input, the process proceeds to step S2 to determine whether or not the conversion key 102 has been input. If the conversion key 102 has not been input, the flow advances to step S3 to execute a key input process corresponding to the input key.

On the other hand, when a character key is input in step S1, the
Proceeding to S11, the character code input from the keyboard 101 is stored in the character buffer 116, and it is checked in step S12 whether or not the mode is a mode for converting into an English word, that is, a designation mode. If it is in the designated mode, the process returns to step S1 to wait for the next key input. If the mode is not the designated mode, the process proceeds to step S13, in which the input English character code is converted into Roman kana and converted into katakana code, and in step S10, the katakana code converted into katakana is converted into character pattern data by the pattern memory 114. It is displayed on the display unit 103.

When the conversion key 102 is input in step S2, step S4
To see if it is the designated mode to convert English words to katakana. If not, the process proceeds to step S5, the designated mode is set in the RAM, and the process returns to step S1. If the designated mode is selected in step S4, the process proceeds to step S6. After clearing the designated mode, it is determined whether the number of characters is equal to or greater than the maximum number of English words. As described above, the character string input between the time when the conversion key 102 is pressed and the time when the conversion key 102 is next pressed is checked. If the number of characters is equal to or more than the maximum number of characters, the process proceeds to step S13, and as described above, Romaji kana conversion is executed, and displayed on the display unit 103 in step S10.

If the number of characters is equal to or less than the maximum number of characters in step S6, the process proceeds to step S7, where the English word dictionary is searched with reference to the katakana conversion table 113 and converted into a corresponding katakana code string.
This search processing will be described later with reference to the flowchart of FIG. When the search process is completed in step S7, the process proceeds to step S8, and it is determined whether the corresponding English word has been found in the search process in step S7. If there is no corresponding English word, the process proceeds to step S13, but if there is a corresponding English word, the process proceeds to step S10, referring to the conversion table 113, and
The katakana code string obtained in S7 is developed into a pattern and displayed on the display unit 103.

FIG. 3 is a flowchart showing the English word search process in step S7 in FIG.

In step S20, the register of the CPU 111 is set as an address pointer of the conversion table 113, and the start address of the table 113 is set in this register. In step S21, the character code string of the character buffer 116 is compared with the English word character code string of the address indicated by the address pointer in the conversion table 113, and in step S22, it is determined whether there is a matching English word. If there is no matching English word, the process proceeds to step S23, where 113 of the conversion table storing the next English word is stored.
Is set to the address pointer.

To set the start address, the code "FFH" in the conversion table 113 is searched, and the address next to the address where the code exists is set in the address pointer as the start address of the English word.

In step S24, it is checked whether the search of the conversion table 113 has been completed. If the search has not been completed, the process proceeds to step S21, and the process proceeds to the search for the next character string. When the search of the table 113 is completed in step S24, the process proceeds to step S25, where there is no corresponding word, and the process returns to the main routine.

On the other hand, if an English word that matches the character string of the character buffer 116 can be found in step S22, the process proceeds to step S26, where the katakana code following the matched English character string in the conversion table 113, for example, in the case of FIG. Is "SPRING", the katakana code of "spring" is read and the process returns to the main routine. Thus step S1
At 0, this katakana code string is developed into a pattern and displayed on the display unit 103.

FIG. 5 is a diagram showing an example of a character string input in this embodiment and a character string output corresponding thereto.

In this embodiment, the case of ordinary English words has been described. However, the present invention is not limited to this. For example, Japanese English "nighter" which is not included in English may be converted to "nighter". .

Further, the configuration of the katakana conversion table 113 is not limited to this embodiment.For example, the conversion dictionary table is divided for each word length of English words, and the English words are arranged in alphabetical order in each word length table. It is assumed that Then, for example, two bytes following each English word are set as an address area of the table in which the corresponding katakana code is stored. By doing so, if the word length is the same, the number of bytes of the memory in which the English word information is stored becomes constant, so that the word search is simplified.

Therefore, in this case, first, the number of words of the designated English word is checked, a table storing the English words corresponding to the number of words is searched, and a spelling that matches the designated English word in the table is searched. Find English words that have. If the corresponding word is found, the address where the corresponding katakana code string is stored is obtained by referring to the two bytes following the word, and the corresponding code string can be obtained.

Furthermore, in this embodiment, the English word character string is designated by the conversion key. However, for example, the head of the English word character string is always input in uppercase, and the last character input of the English word is input by a special key or symbol. , The English word part may be designated.

Although the kana-kanji conversion is not described in this embodiment, it goes without saying that the katakana character string thus input can be converted to kanji.

As described above, according to this embodiment, it is possible to input a corresponding katakana character string by inputting a word in English even during Roman character conversion input.

[Effects of the Invention] As described above, according to the present invention, in a kana-kanji conversion device using Roman alphabet input, when other information is input after alphabetic information, it is possible to determine the uppercase and lowercase of the alphabetic information. There is an effect that the document data can be input by processing as English word information based on the information or by converting to Kana / Kanji as Roman character information.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a schematic configuration of a word processor according to an embodiment, FIG. 2 is a flowchart showing key input processing in the word processor according to the embodiment, and FIG. 3 is a retrieval process of step S7 in FIG. FIG. 4 is a diagram showing a configuration example of a katakana conversion table, and FIG. 5 is a diagram showing an example of an input character string and an output character string corresponding thereto in this embodiment. In the figure, 100: control unit, 101: keyboard, 102: conversion key, 103: display unit, 104: document memory, 111: C
PU, 112... Program memory, 113... Katakana conversion table, 114... Pattern memory, 115.

Claims (1)

(57) [Claims] An input unit for inputting alphabetic information and other information; a kana-kanji conversion unit for performing Roman-kana-kanji conversion on the basis of the alphanumeric information input by the input unit; Determining means for determining whether or not information has been input; determining means for determining whether uppercase or lowercase of the alphabetic information has been input; and determining that the other information has been input after the alphabetic information by the determining means. Control means for controlling whether to process the English character information as English word information or to convert kana to kanji characters by the kana to kanji conversion means as Roman character information, based on the result of the judgment by the judgment means. A document processing apparatus comprising: