JPS5933535A - Keyboard device - Google Patents

Abstract

PURPOSE:To attain efficiently the input, by providing a means for inverting the definition of an upper case and a lower case. CONSTITUTION:A shift reverse key KR1 keeps the make state even if a finger is detached after the key is depressed once and when the key is depressed again, the key is brought to ''break'' and the state is kept even if the finger is detached. The output of an encoder EN is at the unshift code when a shift key Ks is opened in the operating output with the key KR1 opened and the output goes to the shift code with the key Ks closed. The shift code is obtained with the key KR1 closed and the key Ks opened and the unshift code is obtained with the key Ks closed. Thus, English capital and small letters are inputted with the same character key, the letter having high using rate is inputted with the unshift mode, allowing to attain the efficient input.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a keyboard device, and more particularly to a keyboard device that is suitable for use as an input device for a Japanese word processor, and is capable of efficiently inputting Japanese and English texts.

FIG. 1 shows a conventionally known standard ASCII keyboard. In addition, the character position and mode correspondence are shown in Figure 2.
The encoding circuit is shown in Figure 3.

In this keyboard, one character key is defined by two types of characters, each of which is placed in the upper case and lower case. The characters assigned to the upper case and lower case are selected depending on whether 8A or Ksn is pressed on the shift key (see FIG. 2). Normally, in the shift state, English capital letters (hereinafter simply 1A
In the unshifted state, one code "character" is converted to a lowercase English letter (hereinafter simply referred to as "one character").
Each code is the center of output. This operation is the third
As shown in the figure, character keys X1 to Xn and shift key Ks
(KSA or ni, sn) determines the output of the encoder En.

Further, a shift lock key KL is provided as a key for sustaining the shift state. When this key is pressed, the state is the same as when the shift key remains pressed. Normally, the shift lock key KL is configured to be mechanically locked until it is pressed again. Note that in FIG. 3, LD is an LED, which is used to display the operation of the shift lock function.

- When inputting lowercase letters while inputting a sentence consisting mainly of uppercase letters using a keyboard configured as described above, the operator must press the keys to input lowercase letters after releasing the shift lock. The operation of locking the shift and locking the shift again is repeated, making the operation extremely cumbersome.

By the way, when considering the keyboard device of a Japanese word processor that mainly inputs Japanese text, it is known that the usage rate of English characters in Japanese text is overwhelmingly uppercase (in the case of input to a computer program) etc). However, in English, there are overwhelmingly many lowercase letters (uppercase letters are used in titles and at the beginning of sentences).

It is only used as a proper noun.

Therefore, when uppercase letters and lowercase letters are input using the same character key, it is desirable to be able to input the character type with a higher usage rate in an unshifted state. However, a standard ASCII keyboard in which the contents of the shift key operations are fixed (uppercase letters in the shifted state, lowercase letters in the unshifted state) has a problem in that it cannot meet such demands.

The present invention has been made in view of the above-mentioned circumstances, and its purpose is to solve the above-mentioned problems in conventional keyboard devices, and to facilitate easy operation of output codes for the shifted and unshifted states of the same character key. To provide a keyboard device that can be reversed.

The above object of the present invention is that one character key is defined by a plurality of characters, at least two types of characters to which the plurality of characters belong are defined as upper case and lower case, and the upper case is defined separately from the character key. This is achieved by a keyboard device having a shift key for switching the lower case, characterized in that the keyboard device is provided with means for reversing the definitions of the upper case and the lower case.

Embodiments of the present invention will be described in detail below with reference to the drawings.

FIG. 4 is a diagram showing the key arrangement of a keyboard device showing an embodiment of the present invention, and FIG. 5 is a diagram showing its encoding circuit.

In this embodiment, a shift reverse key 1 (formerly) is provided in place of the shift lock key in the conventional keyboard device, and the shift reverse key I (formerly is configured as having a mechanical alternate function). In other words, when the shift reverse key KRI is pressed once, it makes and maintains the made state even if the finger is removed, and when it is pressed again, it breaks and maintains the made state even if the finger is removed. It is something to do.

8 (on the shift reverse key Kn+ and shift key)
The output of KSA or Kss) is input to an exclusive OR circuit X)t, and the output of the exclusive OR circuit XR is connected to a switching terminal for the shift side code and unshift side code of the encoder EN.

The operational output of the apparatus of this embodiment configured as described above is as follows.

(1) When shift reverse key Knl is open, shift key Ks is open, unshift code; when shift key Ks is closed, shift code (2) When shift reverse key Kn1 is closed, shift key Ks is If the shift key Ks is open, it is a shift code; if the shift key Ks is closed, it is an unshift code. FIG. 6 shows another embodiment of the encoding circuit.

In this embodiment circuit, the shift reverse key KIN!
, a normally open pushbutton switch similar to the shift key Ks is used, and its output is '('
17 is connected to the clock input terminal of flip-flop F. The output of the 1'' type flip-flop F is led to the exclusive OR circuit XR together with the output of 8 to the shift key.

In the circuit of this embodiment configured as described above, when the shift reverse key Kng is pressed, the output of the ``■'' type flip-flop F is changed to an alternate output, so this output and the output of the shift key Ks are By leading to the exclusive OR circuit XR, it is possible to obtain an operational output similar to that of the embodiment circuit shown in FIG.

Note that a reset signal from a system such as a Japanese word processor is led to the reset terminal of the r-type rough flip-flop. When the reset signal arrives, no matter what the state of the 'r-type flip-flop F is, it returns to its initial state in which the shift function is partially released. The above-mentioned reset signal is issued from the system side when a mode is switched, which will be described in detail later.

Hereinafter, details of processing in a Japanese word processor using a keyboard device as shown in the above embodiment as an input section will be explained.

FIG. 7 is a block diagram of a kana-kanji conversion processing device showing an example of application of the present invention. In the figure, 1 is a keyboard device, 2 is an input character buffer register, 3 is a control circuit, 4 is an output editor, 5 is a display device, 6 is a printer, 7 is a connection matrix table, 8
is a hiragana-kana-kana correspondence table, and 9 is an output sentence register. In addition, 10 is an independent word dictionary, 11 is a vocabulary conjugation table, 1
2 is an adjunct word table and 13 is an independent word buffer.

The independent word dictionary 10 includes a general kanji word dictionary (hereinafter simply referred to as the "-kanji word dictionary"), a part of which is shown in FIG. It consists of 5 parts of 10C. this house,
The kanji word dictionary 10A includes independent words that belong to common nouns, s-flexible nouns (nouns that can be affixed to the s-flexible "suru"), verbs, adjectives, adjectives, adjectives, adverbs, interjections, etc. Remember... The memory contents include two pronunciations (kanji only), nine parts of speech and conjugation, identification information (*marked) whether or not it is accompanied by an okurikana, and output order, etc., arranged in the code order of the pronunciation kana. There is.

The technical term *IOB stores only nouns (including slang nouns), and the stored contents are expressed in one reading.

Types (types of technical terms), output rankings, etc. are arranged as a set in the order of pronunciation code. Further, the user registered word dictionary 10C also stores only nouns (including slang nouns), and the stored contents are similar to the stored contents of the technical word dictionary 10B.

Part of the content of terminology usage table 11 is shown in Figure 9 (
, verbs, adjectives, part of speech of adjective verbs, and conjugation endings are stored for each classification.

However, the serial numbers marked with * are stored in the device.

Line numbers and word endings.

The auxiliary word table 12 is divided into a major classification table 12A and a minor classification table 12B.The major classification table 12A is divided into formal nouns, auxiliary verbs (formal verbs, ), each word of the auxiliary verb, and the six edicts of the particle, and correspond to the minor classification table 1.2B by number. Minor classification table 12B, as part of its contents is shown in Figure 11, includes each formal noun, the conjugated form of six auxiliary verbs,
It is classified according to the conjugation form of the six auxiliary verbs and the coronation form of the six particles.

Connection matrix table 7 is a table showing the connection relationship between independent words and adjunct words and the possibility of termination as a clause, and is associated with an independent word classification table and an adjunct word classification table. FIG. 12 shows a part of the contents of the connection matrix table, and FIG. 13 shows the correspondence with the classification table.

Note that the control circuit 3 has a function of controlling the relationship between a dictionary such as a "double" and a table.

The operation of this apparatus configured as described above will be explained below.

(1) Input Input is performed using the keyboard device 1. The arrangement of the 10 characters of the keyboard device is as shown in FIG. 4 above.

This keyboard device 1 is capable of specifying the conversion content of a character string that is subsequently input by using a combination of a space key and a special key marked with a circle.

The meaning of the expression position on the key top of the character key is defined as shown in FIG.

The shift key has 8A and KSB in each mode described below, and the shift function occurs only while this is pressed.

Shift key (Hereinafter, when key operations are explained, it will be abbreviated as ■.) K8A and 1gSB have exactly the same function, and either one may be used.

The shift reverse key KRI (or KH2) is a further development of the shift lock function, and after pressing this key, all shift states and non-shift states are reversed. By pressing the key again, the original state is restored.

Also, when you switch modes, it will automatically return. That is, the shift/reverse function is valid only within one mode and is not carried over to other modes. If you move to another mode and need to reverse the shift, use the shift reverse key again (hereinafter, when explaining key operations, abbreviated as O).
Write down. ) 1 (Press nl (or Kru).

The mode change key is also used as a character key, and does not function as a mode change when pressed at the same time as the space key Kp. Basically, it is desirable that the mode change keys be arranged symmetrically to the home position of the famous finger.

The following types of mode change keys are defined.

(1) Alphanumeric mode: When you press the space key (hereinafter referred to as ``■'') and then press the alphanumeric mode key (hereinafter referred to as ``■'') (hereinafter referred to as ``0'').

) Subsequent operations In this case, it can provide the same functions as a normal English typewriter. That is, (a) When inputting full alphabet capital letters and arithmetic numbers (including some alphanumeric characters), simply press the letter key displayed on the key top.

(b) When entering lowercase letters and alphabetic symbols, press and hold Shift Mode Ks or KSB.
Press the corresponding character key.

However, if the lamp of the shift reverse key KRI (or KH2) is lit, the operations in (a) and (b) above are reversed. In other words, in case (a), shift key 1 (8
You can press a letter key while holding down 8B for A or 8B.For (b), just press the letter key.

(2) Kanakana mode: When you press the above [phase] key and then press the kanakana mode key (hereinafter referred to as "■") (
Hereinafter, this will be referred to as "O". ) Subsequent operating functions In this case, it corresponds to the shift mode of kana and kana symbols of the JIS standard keyboard (C6233).

That is, (a) When inputting normal kanakana and long sound symbols, simply press the corresponding hiragana character key. Furthermore, for voiced sound characters and semi-voiced sound characters, a voiced sound symbol (mouth) is input.

(b) Lower case letters (a, i, tsu, ko, o, tsu, ya, yu).

When inputting capital letters (ヲ, ヰ, 工), and kana symbols manually, press the corresponding character key while holding down the shift key 1<SA or KSB.

(3) Hiragana mode: When you press ■ above and then press the hiragana mode key (hereinafter referred to as "■") (hereinafter referred to as
This is written as "0". ) Subsequent operating functions This case corresponds to the kana and kana symbol shift mode of the JIS standard keyboard CC6233).

That is, (a) When inputting ordinary hiragana and long sound symbols, simply press the corresponding character key. The input of voiced sound characters and semi-voiced sound characters is the same as in (2).

(b) Lower case letters (a, i, u, e, o, tsu, ya, yu).

To input bold characters (wo, ii, ゑ), and kana symbols, press the corresponding character key while holding down the shift key KSA or KSB.

(4) Kanji mode: When you press the above ■ and then press the Kanji mode key (hereinafter referred to as "@"), the following operation functions are basically set to this mode. The characters from the character string after switching until the next ■ and ○ (indicates an arbitrary mode change key -) are pressed in succession in this order are subject to the kana-kanji conversion process.

(a) For simple nouns, press the letter key for the reading.

(b) Divide the noun compound into the basic word base and affix, insert the 0 mentioned above at the delimiter, and press the reading character key.

(C) For pragmatics (verbs, adjectives, adjectival verbs), press the character key that reads only the kanji section.

(5) Okukana mode: When pressing the Okukana mode key (hereinafter referred to as "■") while pressing the ■ above (hereinafter referred to as
This is written as )-9J. ) Subsequent operation function When handling one yō in the above kanji mode, input the okurikana part in the desired word form from the time you switch to this mode until the word break.

(6) Technical language mode: When the technical language mode key (hereinafter referred to as "■") is pressed while pressing the above (hereinafter referred to as "■") (hereinafter referred to as rQJ), the subsequent operation function is the same as the above Kanji mode. , after switching to this mode, the character string is converted into kana-kanji using a professional candy dictioner. Use 1
cannot be used for

(7) User registered word mode: Operation function specialized song mode after pressing the above ■ and then pressing the user registered word mode key (hereinafter referred to as "@") (hereinafter referred to as rfOJ) Similarly, input the candy using the user registered dictionary.

Above, we have explained the method of switching between each mode by pressing the space key (■) and then pressing the various mode change keys, but other methods, such as using a combination of control keys and mode change keys, or using a dedicated mode It goes without saying that a method such as preparing a change key may also be used.

In addition to the above keys, the keyboard device 1 also includes -character kanji key I
E, 2-stroke key IF, next candidate key IG, update key 1■4. A delete key IJ, line feed keys lK, etc. are provided. Explain the functions of these keys.

(1) - Character Kanji key lE By pressing this key, you can input a word that is not registered in the word dictionary. In other words, input the reading for each - character and press the next candidate key to convert. When the - character kanji key is pressed again, the - character kanji key mode is canceled.

(2) 2-stroke key IF When this key is pressed, all characters can be input with two-touch bimonic. If you press the 2-stroke key again, 2-stroke mode will be canceled.

(3) Next candidate key IG The next candidate key is a key for requesting the next candidate when the Kanji mode is separated, and is also a key for requesting conversion and requesting the next candidate during the - character Kanji mode.

(4) Update key IH This key is used to select homophones when switching between Kanji modes.
This key requests the next candidate when the target word is not found in the displayed range. While the next candidate key is updated one word at a time, the update key is updated for each part of speech, as will be explained in detail later.

(5) Delete key IJ This key deletes the previous character and mode display, and can also cancel the mode itself.

(6) Line feed key lK This key moves the character input from the next character key pressed to the beginning of the next line.

An example of input by the apparatus of this embodiment configured as described above is shown below.

(1) Examples of general sentences [I go to school 2. ”, the key operation is ■ ■■ (4,) ■ ■■ (Fri■
[Phase] @@0, and the display changes as follows when shown corresponding to the above ① to 0.

■ It's me ■ Private seal ■Private seal is ■ I am a farm ■ I'm curious ■ I'm at school... ■ I go to Gakkoden (8) I am at school ■、　I'm afraid to go to school ＠）　I took Shigayo to school. @I go to school Q) I go to school and work there. ■ I go to school.

Note that the same result can be obtained by inputting as follows after -F (■).

■ Ge＠′ The display change in this case is Mosquitoes are buzzing to school 0' Me → 1 First of all, I went to school.

This makes the operation easier, but the internal processing of the machine increases and it takes some time.

(2) Examples of sentences containing homophones [゛Attending the school opening celebration. ” When creating a sentence,
The key operations are: ■ ■■■ ■ ■ ↓ ↓↓↓ ↓ ↓ 0Kaikou0 0いゎ0に↑■ ■■■■ [phase]■ The display changes as shown below.

■ Let's jump ■ Opening of lectures, opening of Taro, opening of Taro, opening of the port, and sailing to the seaport.

At this point, press the next candidate key (■ above) to open the F tuyeres. Opening of port. Seaport. Sailing around. It has been revised,
Now that you have obtained the desired "school opening", move on to the next input.■ School opening seal■ Congratulations for opening the school■ Sending the child to the school on opening day ■ Congratulations for opening the school■ Congratulations for the school opening celebration■ ■ Attendance at the school opening celebration Attendance at the school opening celebration ■ Attendance at the school opening celebration.

As mentioned above (if there is a homophone, the first conversion candidate is displayed in the regular position, and all of the second and lower conversion candidates are displayed after the homophone is displayed (above). In the example, the second candidate is the word you want to get, so if you press the next candidate key once, the first candidate "opening" will be deleted and "1 opening" will be displayed in its place. Along with this, all homophone j-word displays are shifted one word to the left.

If "Kaikou" becomes a conversion target again after this, the output order will be changed and "School Opening" will be displayed as the first candidate, "Course Opening" will be displayed as the second candidate, and so on. remains as before.

(3) Examples of sentences that include compound words If the word is a derivative word or compound word that contains only kanji, enter 0 again before the affix or base word.

For example, when inputting "Celebration Ceremony", the key operations are The display changes as shown below.

■ If you want to input "Celebration Ceremony or 1 Big Sports Day", the key operations are ■ ■
■ ■ ■ ■ ■ ■ ↓ ↓↓ ↓ ↓ ↓ ↓ ↓ 0 t C 0 um 850 00, and the display changes as shown below.

■ Sonodai ■　Large-11 questions. 6 units ■ U Oma ■ Great Circle Undo ■ Large sports hall ■ Afraid of large movements ■　Big Sports Association Taikai. times. floor, shell, solution. Kai.

杙■ Daisou Aida (4) Example of a sentence containing okuri kana If there is an okurikana in one word, enter the above-mentioned (foundation) before the okurikana part.

When entering "Hand out", the key operation is ■ ■■■
■ ■ ↓ ↓↓↓ ↓ ↓ ■ The display changes as shown below.

■　Shipping ■　Sashiken jko insert. finger ■ Point out one phrase ■ It's a shame ■ Send a gift ■　Paddy offered to you (5) Examples of sentences containing Chinese numerals There are two ways to input "-gani 1300 yen".

The first key operation is (I,) ■■■■■ ■■ ■[phase]■ O↓ ↓↓↓
↓↓ ↓↓ ↓↓↓ ↓ 0ichi (second Man0 ni 0sen0 ↑↑ ■■ oooooooooo.

The display changes as shown below.

■Sonoichi■ Location: Fukuguchi City/h 6ichi■ Severely ill. 1■ - 暎口一■ - Pleasure ■ - Jumping ■ - 10,000 mouths full. True■ -To all countries■ -Gani country 12, cargo, boiled [phase] -Gani ise■ -Many Sen■ -Gani thousand eyes same kasuri Δ plug Δ selectionΔ selectionΔ destination Δ fiber 0-Gani thousand eyes■ -Mr. Ganisen1fuchi■ -Ganisenzoen visit. Acid, praise 7! ! , M: from a■
-Gani Senzo Meditation ■ -Gani Senzo Biyaku 0 -Gani Senzo Hyakuen ■ -Gani Senzo Kirien [phase] -Gani Senzo 1300 yen 0 Enyu Feast 4, Salt■ -Gani Senzo Hyakuyenda The key operations for the second input method are (ri ■0.) (su (5p ■■ (female) ■qsu■
0↓ ↓↓↓↓ ↓↓ ↓↓↓↓ ↓ τ ■ The table changes as shown below. .

■ Sen 1 ■ 1 暎■ -暎口一■ - 暎ま■ - 暎まん■ On the other hand ■ -Bankoku 2 ■ -Man 2 暎■ -Gani 暎02[phase] -Gani 暎Se■ -Gani 暎sen＠ -Gani Sensen 3 ■ -Gani Sen 3- ■ -Gani Senzo 3- ■ -Kani Senzo 暎hi [phase] -Gani Senzo 3's Secret ■ -Gani 1300 [phase] -Gani 1300暎EN [phase] - Gani 1,300 yen rice party, banquet, ban ■ - 12,300 yen rice (6) Examples of sentences containing arithmetic numbers First, (¥ 1,234,567.j When inputting , the key operation becomes ■ (S↓ ↓ SENG ¥1.234,567.-(ES+), and the table changes as follows.

■ En ¥1.234.567. -C] ¥1', 234,567. -SenAlso, when inputting ``March 15, 1981 EIJ, the key operation is (ri ■■ (ri (5) 燵) ■Q,) (shun (yu O
.

The display changes as follows.

(I'm afraid.) A short story from the Showa era. Funny stories, chants ■ Showa period 5 ■ Showa period 57 ■ 1986 暎■ Showa 57 挎NE■ England in 1988 1983 Ei 3 ■ 1985 3 沎(he) March 1987 flash■ 1988 3 Month 15 Heel ■ March 15, 1980 Ta c7) Example of inputting English characters [old PO) tT 6000' When inputting, the key operation is ■ ■ ↓ ↓ 0RI PORTO6'a [S English, and the display is as follows. Changes to

■ %RIPORT, 6” Qaa ■ ) tlPORT, 5 (9) (6) Flash Mata, [1go
to 5choo1. When inputting J, the key operation is ■ ■ ↓ ↓ el IE3) S GO ■ TO ■ 5 el-+oot, Q, and the display changes as follows.

■ English ImgOmutoΔ5c11ool.

■ IΔgo, to, 1schoo1. Example of a sentence containing Sen (8) Katakana When inputting ``Coding Manual'', the key operation becomes ■ ■ and the display changes as follows.

■ Kano Coating Manual ■ :l-7' Ink Manual Piece (n) Processing Flow Figure 14 is a flowchart showing an overview of the kana-kanji conversion process by the device of this embodiment. Explain.

(1) Input processing (14A) Receive the code from the D keyboard device 1.

2. Identify the type of code.

3) Perform necessary processing depending on the type of code.

It is distributed to the necessary processing section depending on the type of recode.

(2) Number word dictionary search process (14B) In the alphanumeric mode using the 9th candidate key, the number word dictionary (
Search for heading section: Arithmetic numerals, corresponding character section: Kanji numerals) and create conversion candidates.

(3) Kanji word dictionary search process (14C114C') Search the Kanji word dictionary in D Kanji mode and set up conversion candidates.

(4) Technical term dictionary search process (14D) Search for technical candy 1 in the υ technical term mode and set up conversion candidates.

(5) User registered word dictionary search process (14E) 1) Search the user registered word dictionary in the user registered word mode and create conversion candidates.

(6) Grammar matching process (14F) Perform a connection test for D okuri kana.

(7) Part-of-speech priority processing (14G’) l) Display conversion candidates for parts of speech to be outputted first.

2) Leave the part-of-speech conversion candidates for later.

(8) Output order processing (141-1) l) Sort conversion candidates based on output ranking information.

(9) Display calibration processing (14J) Display D conversion candidates.

(10) Learning process (14K) Swap the output order of the D-converted candy and the previous candidate word.

2) Write the replaced words, which are output ranking information, to the dictionary.

A more detailed flowchart regarding the input processing section is shown in FIGS. 15A and 15B. In FIG. 15, P indicates code type check, Q indicates mode code identification and mode setting, R indicates processing mode identification, and S indicates kana-kanji conversion preparation. In addition, the 15th
In the diagram, it is abbreviated as "M" for mode, as well as alphanumeric characters, kanakana, and hiragana.

The modes of kanji, okurikana, technical language, and user-registered words are abbreviated as English M2 Kata M, 1000 M, etc., respectively.

The processing shown in FIG. 15 will be explained below.

(1) Code type check (P) If the D input is the next candidate key code, it is passed to the next candidate process (15A).

If 2-person power is not the next candidate key code, check whether there are characters in the input sentence buffer register (15A)
L, if there is nothing, move on to the next process after the conversion word confirmation process.

[Yes] Check whether the input is a mode code (1
5c) If the mode code is not L, move on to the process of accumulating the input characters in the input sentence buffer register.

Anything other than the above is treated as a mode code and moves to the next process.

(2) Mode code identification and mode setting (Q) If the D input is an okurikana mode code, check the mode code register, and if the previous mode was not kanji mode, proceed to error processing, if it is kanji mode, okurigana. A flag for conversion processing is set, and the flag is passed to the input sentence buffer register pointer processing (15D, 15M).

If the two-person power is not in the sending kana mode, the entire character string in the input sentence buffer register is transferred to the input sentence register for conversion (W) and the process moves on to the next process (15D, 15F).

3) If input is in alphanumeric mode, input character code table (
FIG. 16 shows a part of an example. ), select ■
Pass to alphanumeric mode code accumulation processing (15G, 15H)
.

If the input character is a kanakana mode code, select ■ in the input character code table and pass it to the kanakana mode code storage process (15J, 15K).

If the Q input is in user registered word mode, select ■ in the input character code table and pass it to user registered word mode code accumulation processing (15L, 15M).

6) If the input is not alphanumeric, kanakana, or user registered word mode code, select ■ in the input character code table and move on to the next process (15G, 15J, 15
L, 15N).

If the input is either a hiragana mode code or a technical language mode code, it is passed to the corresponding mode code storage process. If neither is the case, move on to the next process (1
5P, 15Q).

(3) Processing mode identification (R) 1) Check the mode code register and if the previous mode (previous mode) is alphanumeric, kanakana, or hiragana mode, pass it to the output sentence accumulation process ( 15 liters, 1
5T). However, if it is in the alphanumeric mode, a check ('15S) is performed to see if the last character is a number, and if it is a number, it is passed to the numeral conversion process.

2) If the previous mode was either technical language mode or user registered word mode, it is passed to each corresponding dictionary search process. If neither is the case, move on to the next process (15
0,15V).

(4) Preparation for kana-kanji conversion (S) Check the υ mode code register and create a new mode (
If the mode before the previous mode (new mode) is other than kanji and the previous mode (previous mode) was technical language mode or kanji mode, the corresponding suffix priority processing is performed, and then the next Move on to processing (1.5'W, '15X, 1
5Y) 2) If the new mode is the kanji mode and the previous mode is a mode other than the kanji mode, prefix priority processing is performed and then the process moves to fire processing (15Z).

3) Note that the processing mode identification described above does not depend on the program, but can also be done by drawing a table as shown in FIG. 17 to determine the jump destination.

In FIG. 17, i indicates a mode other than the kanji mode, and * indicates any mode.

Next, the kanji word dictionary search and grammar matching process (see FIG. 14) will be explained based on FIG. 18.

(1) If the Nominal Conversion Send Kana flag is not set, Nominal Medium 4
Process J in line 5 (18A).

2) Search the Kanji word dictionary using the first six characters in the conversion input sentence register (W), extract all matching characters as conversion candidates, and move to the next female conversion candidate accumulation process (18T).
18B).

3) In the above search, if there is no matching word, proceed to suffix processing (18v), and if there is still no match, proceed to non-conversion processing.

(2) Predicate conversion, dictionary search υ If the sending kana flag is set, processing centered on predicates is performed (18A).

(1) As an initial set, the length of the character string in the conversion input sentence register (W) is measured and set to k, and the length from the beginning to the pointer is set to l (18C).

3) Only the first character in the input sentence register (W) for conversion is searched in Yuame Toshimata Kanji word dictionary and all the results obtained and A
The kanji word dictionary is searched for all words containing the +1 character, and all the results obtained are transferred to the dictionary buffer (18D).

In the above search, if there is no matching word, the process moves to non-conversion processing.

(3) Word conversion, dictionary buffer processing l) Search the word 1 buffer for the first character in the conversion input sentence register (W) (18g).

2) If there is no match in the 4-record reach, add the next character of the pointer and touch the dictionary buffer (18F').

3) Repeat 2) above until a match is obtained.

O If the dictionary lookup character matches the number of digits of the dictionary heading, or if there is no word that matches the number of characters in the conversion input sentence register (W), then the first 6 characters in the conversion input sentence register (W) Search the dictionary buffer for characters, extract all the obtained results as conversion candidates, and move on to the next process.

5) In the above search, if there is no matching word, proceed to non-conversion processing.

(4) Word conversion and conjugation processing The part of speech of only m1 of the words matched in the above search is set in the part of speech name register (P) (18G).

2) Set the word stem candidate in the word stem register (H)K (
18G).

3) Set the remaining part in the candy tail register (T) (1
8G).

The character string in the lead word ending register (T) is checked for each conjugation ending for all parts of speech in the part of speech name register (P) (181-1).

υIf there is no matching word in the above search, the process returns to the dictionary buffer process via the l operation.

6) For all the matches, set the row number (CN) of the connection matrix table in the row number register (CNR) (18J).

(5) Adjunct word processing 9 One line number is taken out from the line number register (CN) t) and the CN pointer is checked (18K).

2) Add the matching ending (or attached word) to the end of the string in the stem register (H) and add it to the end of the string in the stem register (H).
(1'8L).

3) Put the matching word endings (Nukitake attached words) into the word ending register (
T) is subtracted from the beginning of the string in the word ending register (1
) (18L).

4) If the string remains in the tail register (T) after the above processing, move on to the next process (go to 18M80. If the string remains in the tail register (1゛), then H If so, check whether the process can be completed in the corresponding row of the connection matrix table, and if not, move on to the next process (18N).

6) If the result of the above check is acceptable, proceed to conversion candidate accumulation processing (18N).

7) Check whether or not the connection is possible at the corresponding row end in the connection matrix table, and check the character string in the word ending register ('r) using the adjunct word corresponding to the column number that is possible (18P).

8) Line number register (C
Accumulation processing is performed in N ) t ) (18Q).

If ω does not match, the connection possibility is checked from the next column number, and when the row reaches the end, the CN pointer is checked (18R).

zo) If the CN pointer indicates the end of the accumulated information in the line number register (CNR), the procedure for the above l operation [
, returns to dictionary buffer processing (188).

it) If the above stored information is not the last, return to the beginning of adjunct word processing (18s).

(6) Conversion candidate accumulation processing A (Process and accumulate the contents of one dictionary for one word as follows.)D If the number in the division part of the reading heading is other than O, the character string in the reading heading Leave only one number that shows that number from the beginning of , convert the remaining character strings into output codes, and then add them after the character string in the corresponding character field.

Then, storage processing is performed together with the contents other than the heading column 2 and the delimiter column (181').

α) Conversion candidate accumulation processing B D If the number in the delimiter of the reading heading is other than O, leave only the number indicated by the number from the beginning of the character string in the reading heading, and code convert the remaining string into an output code. and then append it to the end of the string in the corresponding character field.

2) Code exchange the string in the @tail register (T) into an output code, and then append it after the string processed above.

■ Reading of the contents of the dictionary is stored together with the contents other than the heading column 4 and the delimiter column (18tJ).

(8) Extract each character from the characters after suffix processing and perform suffix processing (18V').

(9) Non-conversion processing: convert the character string (input character string) in the conversion input sentence register (W) into an output code and proceed to display processing (18W).

FIG. 19 shows a specific example of the priority part-of-speech processing (see FIG. 14).

(1) If the Okukana flag is set, the 19th
Arrange the conversion candidates in the order shown in the figure.

(2) If the okurikana flag is not set, the first
The conversion candidates are arranged in an order completely opposite to that shown in FIG.

(3) Furthermore, if the affix (prefix, general suffix, specialized candy suffix, classifier) priority flag is set, the corresponding affix is arranged at the beginning.

In this case, the output order can be based on the algorithm as shown in FIG. 17 above.

Output) processing can be handled by arranging the output ranking information J[K within the same part of speech.

An example of the structure of two dictionary tables is shown below.

(1) Kanji word dictionary A configuration diagram is shown in FIG. 21 (5).

D Reading kana (reading heading) field handles only Himogana, the code is JIS C6226-4
The second byte (lower byte) of the ward is used. This allows easy conversion to the output code described later.

2 Notation (corresponding characters) column handles only kanji, the code is JIS C6226, and the first byte and the second byte are both the most significant pi) (b8).
Use as 1.

■Part of speech/conjugation column Use the JIS C6220 code and use numbers, letters, and symbols. Regarding the specific assignment of codes, see Chapter 19.
Please refer to the diagram.

O output rank column After word extraction, the display output order of homophone words is expressed.

This column will be rewritten during the learning process.

υCharacter count field Represents the number of characters to be output after the kana-kanji conversion process. In addition, the heading separator is the number of valid characters in the reading heading field.
This indicates how many subsequent characters are to be output, and the corresponding character field indicates the number of valid characters in the corresponding character field.

(2) Technical language dictionary A configuration diagram is shown in FIG. 21(B).

l) Reading heading column Other than the capacity, it is the same as the kanji word dictionary mentioned above.

2 Compatible character field This is the same as the Kanji word dictionary mentioned above except for the capacity to handle all character types.

3) Type column The type of technical term is specified, for example, general, place name, name of one person, etc.

The code is expressed in one character in JIS C6220.

Replacement output order It is exactly the same as the kanji word dictionary mentioned above.

■Number of Output Characters Column This is the same as the corresponding character section in the Number of Output Characters column of the Kanji word dictionary except for the capacity.

(3) User registered candy dictionary A configuration diagram is shown in FIG. 21(C).

1) It is the same as the Kanji word dictionary mentioned above except that it handles hiragana, alphabetic characters, and symbols in the reading column, and the capacity.

2) Compatible Character Field This dictionary is the same as the Kanji word dictionary described above, except for handling all character types and capacity.

0 type column The technical term dictionary is preparatory to pregnancy.

0 output character count field It is the same as the technical language dictionary described above except for the capacity.

(4) List of conjugated endings and attached words An example of the configuration is shown in FIG. 21 (1).

l) Reading heading column Other than the capacity, it is the same as the kanji word dictionary mentioned above.

2) Number of characters field Indicates the number of characters in the reading heading column.

3) Indicates the row number or column number of the connection matrix table (see Figure 12), which is the destination for subsequent processing of connected strange rocks.

Next, an example of the coding system is shown below. In addition, part of the correspondence table between the output code of the keyboard device and the input character code is shown in Part 1.
It is shown in Figure 6.

An example of the correspondence between the human character code and the output character code will be shown. The output character code is basically JIS as mentioned above.
Use the first byte and second byte bits )) l -b 7 specified in C6226 as they are, and set the most significant bit (bs) of each byte to 1".

(1) Set the Hiragana human power character code to the lower byte (2nd byte), and set the upper byte (1st byte) to A4 (10100100)
Add.

(Example) Input character code Output character code
A 2 44 A 2?
AB A4AB
ACA4AC (2) Set the kanakana human character code as the lower byte (second byte), and add KA5 (10100101) to the upper byte (first byte).

(Example) Input character code Output character code
A2 A3 A2 power
AB A5ABga
ACA5AC (3) Change the most significant bit (bs) of the human character code for numbers and alphabetic characters (both uppercase and lowercase) from O' to 1'', then set it as the lower byte (second byte) and change it to the upper byte (first
A3 (10100011') is added to the byte).

(Example) Input character code Output character code 131
(00110001) A3B1 (10100011,
10110001)A 41(01000001)A3
C] (10100011, 11000001) a 6
1 (01100001) A3-El (10100011
, 11100001) (4) English symbols and kana symbols cannot have regular correspondences, so the second example is
Use the table shown in Figure 2.

The mode code is, for example, '80'' to 119F in the functional character area of JISC6220a unit symbol.
Use area II.

1) Alphanumeric mode 81 2) Kanakana mode 82 ■ Hiragana mode 83 Shun Okukana mode 84 0 Kanji mode δ5 6) Technical language mode 86 Ka User registered word mode 87 6) Update mode 8E 9) Next candidate mode 6F Above A list of the code systems viewed from the code side is shown in Figure 23.

2. As described in detail with application examples etc. (According to the present invention, one character key is defined by a plurality of characters, and at least two character types to which the plurality of characters belong are upper case and lower case. In a keyboard device having a shift key which is defined as a case and which switches between the upper case and the lower case separately from the character keys, a means for reversing the definitions of the Atsuno<- case and the lower case is provided, so that they are the same. It is now possible to reverse the shifted and unshifted states of the character keys with a simple operation, and this has the remarkable effect of realizing a keyboard device that can perform input efficiently.

[Brief explanation of drawings]

Fig. 1 shows an example of a conventional keyboard, Fig. 2 shows its character position and mode correspondence, Fig. 3 shows its encoding circuit, and Fig. 4 shows an embodiment of the present invention. A diagram showing the keyboard, Figures 5 and 6 are diagrams showing its encoding circuit,
Fig. 7 is a block diagram of a kana-kanji conversion processing device which is an application example of the present invention, Figs. 8 to 13 are diagrams showing the contents of a dictionary, and Fig. 14 is an overview of kana-kanji conversion processing by the application example device. Figure 15 is a diagram showing the details of the main parts of (B) & Mashichi, Figure 16 is a diagram showing part of the input character code table, Figure 17 is a table for identifying processing modes. Figure 18 is a flowchart showing details of 1 process, Figure 19 is a diagram showing a specific example of 1 priority item ii'J process, and Figure 20 is a diagram showing key tops in the ψ11 keyboard. , FIG. 21 (A) to (D) (a diagram showing an example of the structure of a dictionary document, FIG. 22 (a diagram showing an example of an output code for the 1st class), and FIG. 23 is a list of code systems. °1; Keyboard device, 2; Input characters] (Zuffa register, 3
2 Control circuit, 4: Output editor, 5: Display device, 6: Printer, 7: Connection matrix, 8: Hiragana-kana-kana correspondence table, 9
: Output sentence register, lO: Independent word dictionary, 11: Word usage table, 12: Adjunct word table, 13: Independent word buffer, KSA
, Ksn: Shift key, KL-Shift lock key,
KRI, KH2,: Shift 1 horn (-ski. 28 Figure 2 Figure 3 Figure 10 (a) (b) Figure 1-1 Figure 12 Figure 284-

Claims (1)

[Scope of Claims] A single character key is defined by a plurality of characters, and a number of character types to which the plurality of characters belong (both two types are defined as upper case and lower case, and apart from the character key, the upper case Case: A keyboard device having a shift key for switching a lower case, characterized in that the keyboard device is provided with means for reversing the definition of the upper case and the lower case.