JPH028956A - Document processor - Google Patents

Abstract

PURPOSE:To convert a character string inputted with the spelling of English to a corresponding KATAKANA (square form of Japanese syllabary) character string by discriminating a Roman character part in an inputted character string, and converting the inputted Roman character part to the KATAKANA character string by referring to a storage means. CONSTITUTION:A Roman character key code inputted from a keyboard 101 is stored sequentially in a character buffer 116 in a ROM. When no conversion key 102 is inputted at this time, the key code in the buffer 116 is Roman character/KANA (Japanese syllabary)-converted sequentially to a KATAKANA or a HIRAGANA (cursive form of Japanese syllabary) code, and is converted to a character pattern by a pattern memory 114, then, displayed on a display part 103. And when indication to convert a Roman character word to the KATAKANA is issued by the key 102, it is stored in the buffer 116 as it is, and the Roman character word code in the buffer 116 is converted to the KATAKANA code by referring to a conversion table 113 at the time of depressing the key 102 next, and its is converted to a corresponding character pattern by the memory 114, then, displayed on the display part 103.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a document processing device that manually inputs document information using alphabet keys.

[Prior art] In conventional Japanese document processing devices (word processors),
Coat information input using alphanumeric keys or the like is converted into document information by Roman character, kana, kanji conversion, etc., and is stored in memory or displayed on a display unit. When inputting English words or foreign words in katakana when documents are being manually written, they are input using alphabetic keys in Roman letters corresponding to the katakana reading.

[Problem to be solved by the invention] However, when an operator who is accustomed to operating an English word processor, etc. inputs the katakana reading of an English word, he or she must input the katakana reading of the word in Roman letters, but the operator cannot read the English spelling. You may end up inputting . For example, in katakana ゛°spring (
When manually writing ``Spring'', you would have to manually write ``5UPURINNGU'' in Roman letters, but due to the habit of using English words, you may end up manually writing ``spring''.Then, this manually written document information is written in Roman letters. Due to kana conversion, it was converted to "'5PRI NG", and the operator's desired ``spring'' was changed.
It will be completely different from human power.

In this way, for people who are accustomed to using English words manually, it may be easier to input katakana readings in English than in romaji, and the number of key presses required can be reduced. Despite this, it has always been possible to manually write Japanese documents, especially katakana, only in romaji and kana.

The present invention has been made in view of the above-mentioned conventional example, and is a document processing device that converts an English character string portion inputted in English spelling into a katakana character string corresponding to the pronunciation during Romaji conversion input. The purpose is to provide

[Means for resolving the problem] In order to achieve the above object, the document processing device of the present invention has the following configuration. That is, it is a document processing device that manually inputs Japanese document information using alphanumeric keys, and includes a discriminating means for determining the English character string part of the manually inputted character string, and an English character string information and a device corresponding to the English character string information. The apparatus includes a storage means for storing katakana reading information, and a conversion means for converting the English character string portion into a katakana character string by referring to the storage means.

[Operations] In the above configuration, the apparatus includes a storage means for storing English character string information and katakana reading information corresponding to the English character string information, and determines the English character string part of the input character string, It operates to convert the manually entered English character string part into a katakana character string by referring to the storage means.

[Implementation] 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 an embodiment.

In the figure, 100 is a control unit that controls the entire device;
Reference numeral 01 denotes a keyboard for manually inputting document information, various function commands, etc., and includes conversion keys 102 and the like for specifying English words in the manually inputted document information. C 103 displays input document information and various messages to the operator.
This is a display section such as RT or liquid crystal. 104 is the keyboard 10
This is a document memory such as a hard disk that non-volatilely stores the document information input from 1.

Next, the configuration of the control section 100 will be explained.

111 is a CPU such as a microprocessor, which outputs various control signals in accordance with the control programs and various data stored in the program memory 112 and shown in the flowcharts of FIGS. 2 and 3 to control the entire apparatus. There is. The RAM is used as a work area for the CPU 111, and temporarily stores document data consisting of manually entered key codes, and stores designation mode data to be sent later. Reference numeral 113 denotes a katakana conversion table which records the pronunciation of English word character strings in katakana codes, an example of which is shown in FIG.

This Katakana conversion table 113 has English words arranged in alphabetical order like an English dictionary, and is configured to facilitate searching for manually written English words. Figure 4 shows an example of data for the English word "S P RING", where 41 is the code ゛F indicating the final spelling of the English word.
E H", and this code 41 is followed by the corresponding code string in katakana reading. 42 is the code "'FFH"° indicating the end of the katakana reading, and this code 42 is followed by the next string of English words. It is stored.In addition, here ゛H
°゛ indicates a hexadecimal number.

Reference numeral 114 is a pattern memory for manually inputting code information and outputting corresponding pattern data. 115 is a Romaji-kana conversion dictionary that creates Katakana or Hiragana characters from input Romaji information. 116 is keyboard 10
This is a character buffer that stores the key code input from 1.

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 to katakana is not input manually using the conversion key 102, the key codes in the character buffer 116 are sequentially converted into katakana or hiragana codes, and then stored in the pattern memory 114.
is converted into a character pattern and displayed on the display section 103.

Here, if an instruction to convert an English word to katakana is given by the conversion key 102, it is stored as is in the character buffer 116, and when the conversion key 102 is pressed next, the English word is stored in the character buffer 1116. The code is converted into a katakana code by referring to the conversion table 113, and converted into a corresponding character pattern by the pattern memory 114 and displayed on the display section 103.

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

In step S1, it is checked whether the character keys of the keyboard 101 have been manually operated, and if the character keys have not been manually operated, the process proceeds to step S2, where it is checked whether the conversion key 102 has been manually operated.3, if the conversion key 102 has not been manually operated, the process proceeds to step S3 Execute key manual processing corresponding to the manually entered key.

On the other hand, when a character key is input in step S1, the process proceeds to step Sll, where the character code input from the keyboard 101 is stored in the character buffer 116, and in step S12, it is checked whether the mode for converting to an English word, that is, the specified mode is selected. . If it is the designated mode, the process returns to step S1 and waits for the next key manual input for 8 lines. If it is not the specified mode, step S1
Proceed to step 3, where the manually written English character code is converted to Roman characters and kana and then converted into katakana code.In step SIO, the katakana code that has been converted to katakana is stored in the pattern memory 11.
4, the data is converted into character pattern data and displayed on the display unit 103.

When the conversion key 102 is pressed manually in step S2, the process advances to step S4 to check whether it is the designated mode for converting English words into katakana. If it is not the specified mode, the process advances to step S5, sets the specified mode in the RAM, and returns to step S1. If the specified mode is selected in step S4, step S6
After clearing this specification mode, check whether the number of characters is greater than or equal to the maximum number of English words. In this way, the character string inputted after pressing the conversion key 102 until the next pressing of the conversion key 102 is checked, and if the number of characters is equal to or greater than the maximum number of characters, the process advances to step S13, and as described above, the character string is checked. Execute romaji-kana conversion and step S
10, it is displayed on the display unit 103.

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, in which the katakana conversion table 113 is referred to, an English word dictionary is searched, and the katakana code string is converted into a corresponding katakana code string. This search process will be described later with reference to the flowchart in FIG. When the search process is completed in step S7, the process proceeds to step S8, and it is checked whether the corresponding English word is found in the search process of 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, the conversion table 113 is referred to, the katakana code string obtained in step S7 is developed into a pattern, and the display section 103 to be displayed.

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

In step S20, a register of the CPU III is set as an address pointer for the conversion table 113, and the start address of the table 113 is set in this register. In step S21, the character code string in the character buffer 116 is compared with the English word character code string at the address indicated by the address pointer in the conversion table 113, and in step 522 it is determined whether there is a matching English word. If there is no matching English word, the process advances to step S23, and the start address of 113 in the conversion table in which the next English word is stored is set in the address pointer.

This start address is set by searching the conversion table 113 for the code ``FFH'', and setting the address next to the address where that code exists 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 is completed, and if the search is not completed, step S24 is performed.
Proceed to step 21 and proceed to search for the next character string. Step S2
When the search of the table 113 is completed in step S2
Proceed to step 5 and return to the main routine with the corresponding word in front.

On the other hand, if an English word that matches the character string in the character buffer 116 is found in step S22, the process advances to step S26, and the katakana code that follows the matched English character string in the conversion table 113, for example, in the case of FIG. 1
16 character string is 5PRING”, “SPRING °
Read the katakana code for ° and return to the main routine.

In this way, in step S10, this katakana code string is developed into a pattern and displayed on the display section 103.

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

Although this embodiment has been explained in the case of ordinary English words, it is not limited to this. For example, Japanese English words such as "'nighter", which are not included in English, can also be converted to ゛°nighter''. Also good.

Furthermore, the configuration of the Katakana conversion table 113 is not limited to this embodiment. For example, the conversion Jikichi table may be divided by word length of English words, and in the table for each word length, English words are arranged in alphabetical order. Assume that they are placed side by side. Then, for example, the 2 bytes following each English word,
This is the address area of the table that stores the corresponding katakana code. By doing this, if the word length is the same, the number of bytes of the memory in which English word information is stored is constant, making it easier to search for words.

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

Furthermore, in this embodiment, the English word string is specified using a conversion key, or, for example, the beginning of the English word string is always entered with a capital letter, and the last character of the English word is input using a special key or a symbol. You may specify the English word part by instructing.

Although this embodiment does not explain kana-kanji conversion, it goes without saying that the katakana character string input in this way can also be converted into kanji.

As explained above, according to this embodiment, even when converting to Romaji, it is possible to input a corresponding katakana character string by manually inputting a word in English.

[Effects of the Invention] As explained above, according to the present invention, when inputting Roman character conversion, an English character string portion input in English spelling is
It has the effect of being able to convert to the corresponding katakana character string.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing a schematic configuration of the word processor of the embodiment; FIG. 2 is a flowchart showing key manual processing in the word processor of the embodiment; FIG. 3 is a flowchart showing the search process of step S7 in FIG. 2; FIG. 4 is a diagram showing an example of the structure of a katakana conversion table, and FIG. 5 is a diagram showing an example of a human character string and a corresponding output character string in this embodiment. In the figure, ioo...control unit, 101...keyboard,
102...Conversion key, 103...Display section, 104.
...Document memory, 111...CPU, 112...Program memory, 113...Katakana conversion table,
114...Pattern memory, 115...Romaji-kana conversion dictionary. .

Claims (1)

[Scope of Claims] A document processing device for inputting Japanese document information using alphanumeric keys, comprising: a determining means for determining an English character string portion of an input character string; 1. A document processing device comprising: a storage means for storing katakana reading information corresponding to the information; and a conversion means for converting the English character string part into a katakana character string by referring to the storage means.