CA1149963A - Electronic keyboard system and method for reproducing selected symbolic language characters - Google Patents

Electronic keyboard system and method for reproducing selected symbolic language characters

Info

Publication number
CA1149963A
CA1149963A CA000363994A CA363994A CA1149963A CA 1149963 A CA1149963 A CA 1149963A CA 000363994 A CA000363994 A CA 000363994A CA 363994 A CA363994 A CA 363994A CA 1149963 A CA1149963 A CA 1149963A
Authority
CA
Canada
Prior art keywords
character
characters
identifier
code
storage means
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired
Application number
CA000363994A
Other languages
French (fr)
Inventor
Paul L. King
Joseph E. Grimes
Richard C. Cochran
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NCR Voyix Corp
Original Assignee
NCR Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NCR Corp filed Critical NCR Corp
Application granted granted Critical
Publication of CA1149963A publication Critical patent/CA1149963A/en
Expired legal-status Critical Current

Links

Classifications

    • BPERFORMING OPERATIONS; TRANSPORTING
    • B41PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
    • B41JTYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
    • B41J3/00Typewriters or selective printing or marking mechanisms characterised by the purpose for which they are constructed
    • B41J3/01Typewriters or selective printing or marking mechanisms characterised by the purpose for which they are constructed for special character, e.g. for Chinese characters or barcodes

Abstract

ELECTRONIC KEYBOARD SYSTEM AND
METHOD FOR REPRODUCING SELECTED
SYMBOLIC LANGUAGE CHARACTERS

Abstract of the Disclosure A method and apparatus for electronic typing of symbolic language texts is disclosed. A twelve-key keyboard utilizing a modified four-corner identifier system permits construction of a first shape identifier code utilizing indicia which represent the shape of a character to be reproduced. Alternatively, a phonetic identifier code uti-lizing a phonetic alphabet can be constructed to represent the character. The identifier code is used to select one or more characters stored in a data processing system memory, each character selected by the shape identifier code having the same four-corner identifier indicia, and each character selected by the phonetic identifier code having the same phonetic spelling. Only a limited number of characters can be uniquely identified by either the four-corner system or the phonetic spelling system; for the remainder of the characters, a single set of indicia or a single phonetically spelled word can represent two or more characters, and thus ambiguities exist in the selection process. If the word to be typed comprises a single character, means are provided for manually disambiguating the characters selected by the indicia code. If the word consists of two syllables, means are provided automatically to disambiguate the word in ac-cordance with known character pairings. If more than one such pairing exists for a given identifier code, additional means are provided for manually disambiguating the pairs.

Means are provided for storing and/or displaying the unique character or character pair which results from the selection process.

Description

8ackground of the Invention The present invention relates, in ~eneral, to a system for producing in text form a manuscript which is to be written in a language utilizing symbolic characters.
More particularly, the invention relates to the method of and to electronic equipment for carrying out such a pro-cedure through the use of a unique identifier code which is generated to identify selected aspects of each character in the text. The identifier code so produced operates to select one or more previously stored characters for use in reproducing the manuscript characters in a te~t form for display or printing, the system thus effectively comprising an electronic typewriter for such characters.
The use of ideograms and logograms as the graphic ~ymbols in written languages is found in many parts of the world. An ideogram i5 a graphic symbol used to represent an object or an idea without expressing, as in a phonetic system, the specific sounds which form the name of that object or idea. Thus, it is a symbol representative of an idea, rather than of a word. A logogram is a letter, char-acter, or other graphic symbol used to represent an entire word. The use of logograms and ideograms is typified by Chinese, Japanese, Korean, and like languages, but for pur-poses of illustrating the concepts of the present invention specific reference will be made herein to a preferred embodi-ment of the system and method as it applies to the Chinese language.
Among the world's writing systems, Chinese ortho-graphy stands out because phonetic representation is a minor factor in its construction. There is no alphabet or syllabary from which Chinese characters are built, in con-trast to other 114g~63 written languages, such as English, which employ alphabets having a relatively small number of digits or letters which are arranged in specific sequences and directions to permit classification of the words on the basis of the letters' conventional locations in the alphabet. As a result, alpha-betically written, in contrast to symbolically written languages, are amenable to type-setting, typewriting, tele-graphy, and sorting through assembly and disassembly of the letters. Further, the arrangement of the letters in alpha-betically written languages is often phonetic so that the sound representation can be deduced from the particular arrangement, while only a hint of sound representation can be deduced from Chinese characters, and that only after one has learned a considerable number of them. As a functional writing system in modern Chinese, the characters can best be described as discrete units, or ideograms, which represent specific meanings. They can be learned by rote and can be retained in the memory only by frequent use. A repertoire of between 2500 and 3000 ideographic characters is necessary to achieve normal business adequacy in reading and writing, while the language itself has approximately 50,000 characters that have been identified historically, with about 10,000 characters being in current use.
Traditionally, the Chinese characters are classified by their shapes, not by the correspondence to linguistic forms.
Accordingly, the problem of reproducing the characters me-chanically has been extremely difficult, and it has been virtually impossible to derive adequate indexing methods. Each character contains one or more of some 214 meaning classifiers or radicals, with further clarification being by the number k' il499~3 of penstrokes in the remainder of the character. Further, the radicals themselves are classified by the number of strokes in them, but these are meaning classifiers, and do not ease the problems discussed above.
Because there is no straightforward system for indexing characters by their relation to elements of the language, the technology for printing has stayed at a rudi-mentary stage in the Chinese language until very recently.
Although movable type was invented by the Chinese, the very nature of their writing system hindered any technical advance beyond the use of hand-set type or hand-drawn reproduction of characters. The origins of the Chinese system of writing can be traced back six thousand years, but the efficient use of modern communications and data processing systems has effectively been blocked by the problem of rapidly locating the desired character or characters to be printed. An early example of this problem appeared with the development of telegraphy, for in order to transmit messages it became neces-sary to assembly a telegraphic code which consisted of the International Mor~e Code combinations for the numbers O through 9,999 which were used as labels for 10,000 of the 50,000 Chinese characters. The "Telegraphic Code~ was published, and the telegraph book was used by both the sender and the receiver of a message. The sender looked up each Chinese character in turn and transmitted the Morse Code representation of the number assigned to that character, while the receiver used the same book to reconvert the number to the Chinese character. Such a slow and painstaking method of transmitting a Chinese text, and the equally slow method of printing by the use of hand-set type or the use of hand-drawn pages of .,, ~
,~
,. ...

characters has resulted in numerous attempts over the years to develop more satisfactory solutions.
Among early attempts at solving the foregoing problems were mechanical typewriters which attempted to pro-vide a mechanical keyboard arrangement for`reproducing selected ideographic characters. Such typewriters, however, typically are nothing more than small manipulators for lead type wherein an operator sits before a case of several thousand type slugs arranged by radical and stroke count. The operator searches through the display of characters, which may, for example, be identified on a large and complex keyboard, and uses a pointer/printer linkage to retrieve the desired slug, print the character, and return the slug to its tray. A
great deal of practice is required to achieve some degree of facility with such a machine; a maximum speed of about eleven characters per minute can be attained, with normal type speeds being in the range offive or six characters per minute.
Although many attempts have been made to improve the mechanical typewriter, as by providing machines which will print certain strokes and radicals so that the characters can be mechanically constructed, nevertheless, the very nature of the Chinese ideogram prohibits effective mechanical reproduction by means of a typewriter. Similar problems exist with the written forms of other languages which similarly utilize graphic symbols rather than an alphabetical representation of words.
In an attempt to overcome some of the problems presented by the Chinese language ideographs, a phonetic system of spelling Chinese syllables through the use of a romanized alpha-bet was devised, and has been widely promoted in China. This phonetic spelling, known as the pinyin system, is based on the 1149~
sound of the spoken Chinese syllables. However, because Chinese syllable structure allows a limited number of possible ~-sound combinations, a single syllable sound is ambiguous in that it will usually identify a large number of characters.
This presents little problem with the spoken word in conver-sation, since the intended meaning usually is apparent from the context or from particular word phrases and compounds.
But because of the ambiguity as to which character is meant by a particular syllable sound, the introduction of the pinyin system and other like phonetic systems for languages other -than Chinese did not solve the problem of reproducing specific ideographic characters in a manuscript by a typewriter.
With the advent of computer technology, it was recognized that a new tool had become available for use in the fast and accurate production of Chinese ideograms.
Accordingly, various research and academic institutions, companies, and individuals have for many years worked on the development of electronic data processing machines and methods for producing Chinese characters. At the present time, this art has been developed to the point where computers can generate adequate ideographic shapes, and sophisticated character generators and hard-copy printing units have been developed that have the flexibility to produce acceptable Chinese characters with high resolution. Various optical readers, matrix systems, and expanded memory storage systems have made it easy to store in a data processing system the information necessary to reproduce a specified Chinese character. But even with such developments the essential problem of selecting which character should be printed or displayed remains a major stumbling block. In a typewriter --system where it is desired to transfer a manuscript document to printed form, for example, the problem still remains that there are some sa r ooo Chinese characters from which to select, and there has been until now no convenient, accurate and rapid method or apparatus for identifying à particular character, locating it in the processing system memory, and causing the correct character to be printed. A number of approaches have been suggested in the prior art and some have been marketed, but none has provided a satisfactory typewriter operation.
One approach has been to~ provide a device that stores standard character particles in a memory. An operator then uses coded sequences on an alpha-numeric keyboard to assemble the desired characters on a particle-by-particle basis on a cathode ray tube. After completion of the assembly procedure, the displayed character can be reproduced on a hard-copy device. Essentially, this approach is an electronic reproduction of the pen or brush technique wherein each part of a character is constructed by hand, one stroke or one radical at a time.
Another approach has been simply to copy electronical-ly the type tray and movable arm technique of mechanical type-writers. In this arrangement, a character table is displayed on a tablet surface, the operator hunts for the character which is required, and then touches that character location on the tablet with an electronic pen to produce the character code. This code is then fed to a computer and results in the printing of the selected character. However, this is a "hunt-and-peck" process which does not facilitate speedy typing.

.. ; ~ .-, ~14~963 A recent approach to the problem of typing Chinese ideographs is discussed in U.S. patent No. 4,096,934 to Kirsmer et al., in which a computer is employed to store a catalog of Chinese characters. The characters are retrieved by means of a completely phonetic indexing system in which an ideograph is identified by spelling the pronunciation and/or by using the phonetic symbols themselves to describe the geometry of the character or parts of the character or to describe meanings of the character. All the standard Chinese characters are described phonetically, and this information is stored in the computer. However, a single phonetic word does not uniquely describe a single Chinese character, so a second sequence of phonetic symbols is provided to describe the shape or some descriptive charac-teristic of each character. To recover a specific character, then, two sequences of phonetic symbols are required. If that still does not identify the desired character, then additional sequences of phonetic symbols representing either the appear-ance of or the pronunciation of brush strokes or radicals must be encoded. This process, which requires plural encoding steps to recover a single character is extremely complex and time consuming, and thus does not meet the need for a simple, accurate and rapid typing method.
Still another approach has been to utilize the existing mechanical typewriter, while adding the capability for producing a paper tape having optical markings that corres-pond to the mechanically selected type characters. The result-ing tape can then be scanned electronically to produce a code which may then be fed to a computer for electronic generation of character displays or for operation of a high-speed printing 11~9~3 device. Although this system allows faster reproduction of the typed material, the process of selecting the characters to be typed remains the same; namely, slow and tedious.
In an effort to reduce the time required to identify to a character generator the particular ideogram to be reproduced, so called "four-corner" coding schemes have been developed which attempt to classify Chinese characters by the particular shapes which appear at each of the four corners of the character. These four shapes can then be used to identify and retrieve characters from a computer memory.
This approach is similar to the above described procedure of constructing desired characters through the selection of character particles, and to a more recent approach which uses a three element character construction scheme using a one-hundred radical keyboard. Such systems of identifying Chinese characters by selecting only portions of the character have a serious and common fault: even with very sophisticated coding systems, the use of only selected portions of a character for identification purposes does not uniquely identify a single Chinese character every time. This is because there are many characters which have the same general stroke or radical configurations on their periphery, but have different shapes at the center position so that the use of the so-called "four cor-ner" or "three corner" codes have always resulted in ambiguities which have prevented effective use of such system.

Summary of the Invention The present invention provides a new and unique typewriter system and method which overcomes the difficulties of prior systems and enables an operator to type symbolic graphical characters such as Chinese language ideograms or logograms at much higher speeds than was previously possible.
In accordance with the present invention, there is provided a method of producing ideographic text material utilizing a keyboard having a plurality of keys carrying indicia corresponding to graphic characters to be produced, comprising storing in a memory graphic characters having features similar to those of characters to be produced, each stored character having an identifier code based on such features, selecting one or more keys in a sequence dependent upon selected features of characters to be pro-duced to construct an identifier code for each desired character, calling up from said memory all stored charac-ters having the constructed identifier code, temporarily storing said called-up characters, determining if an ambi-guity exists between the number of characters desired and the number of characters called up by said identifier code and placed in temporary storage, resolving any ambiguities, and transferring the desired character to a text storage means.
Further, in accordance with the present invention, the~e is provided an electronic system for identifying and resolving ambiguities in the selection of single character or two-character symbolic language words, comprising a keyboard having--a plurality of key indicia corresponding to selected features of graphic characters and adapted to produce an identifier representing a character to be typed, file means containing a first list of characters and a second list of permitted character pairings, said charac-ters and pairings being listed in said file by index codes ~ 1149963 selectable by specified identifiers, whereby a selected identifier will call up the index codes and pairings of all characters having that identifier, first storage means for receiving the index codes and permitted pairings for the identifier of a first character to be typed, second storage means for receiving the index codes for the identifier of a second character in a two-character word to be typed, a matching networX fox matching the index codes stored in said first storage means with the index codes in said second storage means to produce a list of possible character pairs for a two-character word, selection storage means; means for connecting said selection storage means either to said first storage means to receive and store only the index codes in said first storage means for a single character or to said matching network to receive said list of possible pairs for a two-character word, a comparator connected to said selec-tion storage means for comparing said list of permitted character pairings with said list of possible pairs, sig-nificant pair storage means to receive and store character pairs appearing in both said list of permitted pairings and said list of possible pairs, and selector means connected either to said selection storage means to resolve single character ambiguities or to said significant pair storage means to resolve two-character word ambiguities.
In a preferred embodiment, the invention utilizes a modified "four-corner" shape recognition encoding system and an associated keyboard arrangement which are unique in that they permit a rapid entry of identifying characteris-tics into the system and rapid retrieval of the corres-ponding character ~rom the system for suitable reproduction.

.
In a second embodiment of the invention, a phonetic encoding system and an associated keyboard are provided for the same purpose. The system of the invention is further unique in its provision of an apparatus and method for resolving the ambiguities which are inherent in such encoding systems because of the characteristics of symbolic language. The modification of the four-corner identification system or the phonetic encoding system combined with the method and apparatus for resolving ambiguities provides a substantial and unexpected advance in the art of typing graphic symbols such as Chinese characters. The invention greatly reduces the time required for an individual to learn to reproduce ideographic characters, and results in a many-fold increase in the number of characters which can be typed in a given time period.
In accordance with the invention, then, there is provided a data storage system having the capability of generating a large number of Chinese language ideograms, logograms or like symbolic characters. ~he data required to generate each character are stored at a predetermined loca-tion in the data storage system memory so that, upon demand, ~elected characters may be located, generated, displayed on a conventional optical display such as a cathode ray tube, and ,, .

., li4~963 printed by means of a conventional printer or stored for later display and/or printing. The storage and generation of such characters may be accomplished by any number of known techniques, for example, through the use of optical readers, electronic contact pen devices, or the like.
Also provided in the system of the invention is a storage file of Chinese character pairings. This file includes for each character stored in the character memory a listing of other characters with which it might be combined to make a two-syllable word, or compound. This is done in view of the fact that over sixty percent ~60%) of Chinese words consist of a pair of characters, rather than a single character.
One key to the present invention lies in the recognition that such pairings provide a tool for the automatic removal of ambiguities in the selection of a character, and accordingly the invention provides a method and apparatus for utilizing this file of pairings in the rapid reproduction of the desired Chinese characters for the typing of a manuscript.
In both embodiments, information concerning the symbol to be typed is supplied to the system by way of a keyboard in which the keys represent predetermined characteristics of the symbol, such as its shape or some aspect of its appearance, sound, usage or the like. In the preferred form of the invention, a twelve-key keyboard is provided in which ten keys represent ten peripheral stroke configurations found in Chinese ideograms. These stroke configurations permit rapid identi-fication of an ideogram, production of a corresponding identifier code, and entry of the code into the system. The remaining two keys are provided to serve as delimiters, one signaling the space between characters in a pair and the other :
~, ~i4~63 indicating the end of a simplex character or the end of a pair of characters. In using this system, the typist inspects the manuscript which is to be typed, and operates the keyboard to produce a series of signals which ccnstitute an identifier that is coded in accordance with the peripheral stroke configuration of the particular character or pair of charac-ters that are to be typed. Means responsive to the identifier codes of each character recall from a data processing system memory all of the characters which have that identified code, and which, therefore, have similar configurations.
In the second form of the invention, a standard computer terminal keyboard having the conventional alpha-betical symbols is used. This keyboard is used to type the pinyin spelllng of a Chinese or other ideographic character, and to facilitate its use, no changes are made in the location of the conventional alpha symbols.
Because the pinyin system does not use the letter "v", only 25 alpha symbols are required. In addition, since pinyin requires the use of superscripts to symbolize tone, the keys representing selected conventional punctuation symbols are used to denote tones.
The standard keyboard is used to provide a series of key inputs representing the phonetic spelling of an ideogram, thereby producing an identifier code for the ideogram that is to be typed. This phonetic identifier code is used to recall from the data processing system memory all of the characters which have that identifier code and which, therefore, sound the same when spoken and have the same phonetic spelling.

1149g63 As indicated above, because of the nature of symbolic language in general, and the Chinese ideogram in particular, numerous characters may have the same peripheral strokes or radicals, while the interior of the character may have a wide variety of strokes or radicals. Similarly, the nature of such a symbolic language results in a large number of phonetically identical words. Accordingly, a given identifier code, either based on shape or on phonetics, may call up a large number of characters, but usually not more than 15, which are similar in appearance or pronunciation but which may be widely divergent in meaning, thus producing an ambiguity which must be resolved.
Where a word involving only a single character is to be typed, a manual procedure for resolving the ambiguity is provided by the present invention, and thereafter the proper character is supplied to an appropriate display, text storage file, printer, or the like. However, where the word to be typed consists of two syllables (or characters), the peripheral stroke configuration information or the pinyin spelling is supplied for each of the two characters, producing a coded identifier for each character. In the case of a shape identifier, all characters having the peripheral stroke configuration corresponding to the first identifier code are called up and are stored in a first location, the characters being accompanied by a pairing list which indicates second syllables that can be paired with them. If the identifier code represents a pinyin input, then all characters having a sound corresponding to the first identifier code are called up, together with a pairing list for each. Thus, in either embo-diment, the first storage location will contain a list of all ,, ~i49963 of the possible characters that correspond to the first identifier code entered through either keyboard, and each such possible character will be accomplished by a list of other characters with which it might be paired in forming a word. Means are further provided to locate and store in a second location all of the characters which correspond to the identifier code selected by the typist as identifying the peripheral stroke configuration or the pinyin spelling of the second character to be typed. This second location will not contain pairing information, since such information is not required for the second character.
The system includes means for selecting the first character in the first location and for comparing each of its possible pairings with each of the characters in the second location, for thereafter selecting the second character in the first location and comparing each of its possible pairings with each of the characters in the second location, and so on, until all of the pairings in the first buffer have been compared to the characters in the second buffer. Each time a possible pairing from the first buffer finds corres-pondence with a character in the second buffer, the identifier codes of that pair are stored, and if upon completion of all of the comparisons only a single pair of identifier codes is so stored there will have been a unique selection of the pair of characters which meets the peripheral stroke configuration or the pinyin spelling criteria of the typist, and the desired word has been selected automatically and without ambiguity.
If more than one pair is selected during the compari-son process, means axe provided for storing each of the selected pairs. Although storage of a plurality of such pairs indicates 114~963 that there has not been a complete disambiguation, never-theless this procedure provides a partia~ disambiguation which greatly reduces the number of characters to be con-sidered by the operator. Further means are then provided for displaying first one and then another of the selected and stored pairs so that the typist can ma~ually choose the desired character pair for storage in a display buffer, text storage location, or the like for immediate display of the chosen character pair, for printing of those characters, or for storage for future use.
In accordance with the foregoing, there is provided a unique method and apparatus for typing graphic or symbolic language texts, particularly those utilizing Chinese charac-ters, rapidly and accurately, the system of the invention overcoming the difficulties of prior typewriter devices.

Brief Description of the Drawings The foregoing and additional objects, features and advantages of the invention will become apparent from a consideration of the following detailed description of a preferred embodiment thereof, taken in conjunction with the accompanying drawings, in which:
Figs. lA and lB are diagrammatic illustrations of keyboards used with the system of the present invention;
Fig. 2 is a diagrammatic illustration of a pair of Chinese characters;
Fig. 3 is an illustration of the application of the modified four-corner shape identifier code used in the present invention;

Figs. 4a-4f illustrate a plurality of Chinese characters all having the same shape identifier codes;

~i4~963 Fig. S is a block diagram of a system for climi-nating ambiguities in the selection of a Chinese character, in accordance with the present invention;
Figs. 6A and 6B combine to form Fig. 6, and comprise a more detailed block diagram of the system of Fig. 5;
Figs. 7A, 7B and 7C present a flow diagram of the method of the present invention;
Fig. 8 illustrates the relationship of Figs. 6A
and 6B; and Fig. 9 illustrates the relationship of Figs. 7A, 7B and 7C. :-Description of Preferred Embodiments The aspect of typing ideograms, logograms or likecharacters that produces the greatest difficulty to both the typist and the designer of the~typewriter is the problem of identifying the particular character desired. When the selection must be made from the 50,000 Chinese characters historically available, or even from among the 10,000 characters in current use, thiæ identification becomes a slow, time-consuming task. By the use of either or both of the keyboards illustrated in Figs. lA and lB, however, the identification and selection of a character for printing, typing, display or the like, is greatly facilitated. The keyboard 10 shown in Fig. lA is a shape identification board which enables a typist to operate the system of the invention in a shape recognition made by inspecting a character and producing a shape identifier code rapidly andaccurately through the use of a modified "four corner" coding system. The keyboard 11, shown in Fig. lB, is a pinyin keyboard which enables a typist to operate the system in a phonetic typing mode by producing an identifier code based qr~

~,~49~3 on the pronunciation of the character so that the typist who speaks the language can use the phonetic spelling of the character/word as the basis for typing. Either keyboard may be used to call up a given character, and if desired, the keyboards may be used interchangeably in typing a series of characters, so that the system may be operated in the shape recognition mode or the phonetic mode as desired by the typist.
Although the present invention is illustrated as having both the phonetic and the shape recognition modes, it will be apparent that the system of the invention may be constructed with only one mode, if desired. However, of the two, the shape recognition mode represents the preferred embodiment of the invention, with the phonetic mode representing an alternative method of providing coded data representative of a character to be produced.
In accordance with the preferred embodiment of the present invention, the individual keys on key pad 10 display ten basic stroke configurations which are found at the extremities of Chinese ideograms, and these stroke configura-tions are used to identify the character to be typed. This key pad may be a standard alphanumeric twelve-key keyboard, with ten of the keys carrying the Arabic numerals 0-9, and the two additional keys 12 and 14 carrying indicators for character delimiter functions,key 12 providing a comma (",") between adjacent characters and key 14 providing an "end of word" or "print" indication. The Arabic numerals not only identify the keys 0-9, but are used for manual disambiguation, as will be described below. Although the key pad 10 is shown as a separate unit, it will be understood that, if desired, it can be integrated with a standard typwriter-style keyboard, li4~63 either as separate keys or as an overlay. This may be conveniently done with a conventional computer input terminal keyboard.
The placement of the several stroke configurations on the various keys is determined by shape association, fre-quency of use, and the usual positions of the strokes in Chinese characters, so that there is a natural relationship between the keys and the characters that are to be typed.
Thus, the stroke configuration on key 1 is the Chinese number l; the configuration on key 7 looks like the Arabic numeral 7, and the configuration:on key 8 is the Chinese number 8.
Among the seven remaining stroke configurations, those indicated on keys 5, 4 and 6, respectively, are the most frequently used, in descending order of frequency. Those are, therefore, placed on the keys which are the normal rest positions for the operator's fingers, so~that the operator need not move his fingers in order to select those configurations. In addition to being frequently used, there are additional associations for the stroke configurations on keys 4 and 6.
The configuration on key 4 is the Chinese number 10, which is pronounced ~Ishi~ in Mandarin Chinese. The number 4 is pronounced "si" in Mandarin. Although this pronunciation of the numbers 4 and 10 is similar, it is even more so for southern Chinese dialects, particularly Taiwanese, which does not have a retro-flex sibilant in tis dialect. For the latter dialect, both the numbers 4 and--lO are pronounced '!si" in Madarin, with only a difference in tone, and in common speech the two numbers often are confused. Thisphonetic affinity is used in the keyboard 10 by placing the stroke configuration for the number 10 on key 4, thus enabling an operator to quickly learn the location .

.1~ .

~14~9~3 of the particular configuration, and facilitating the use of the keyboard.
The frequently used configuration on key 6 of pad 10 is one which often appears on the right side of a character, and thus there is a positional association between the location of the stroke on the character and its location on the keyboard.
The remaining four stroke configurations are the least frequently used of the ten selected configurations. The one illustrated on key 9 always appears at the top of a charac-ter, and thus is placed on the top line of keys. Similarly, the configuration on key 3 is often at the lower right portion of a character while the configuration on key 2 is usually somewhere in the bottom half of a character.
The least frequently used stroke configurations is that illustrated on the "0" key. This key is furtherest from the most frequently used key,_and thus provides a double association for the typist: the frequency of use is least, so it is on the lowest number, and it is furtherest in location from key 5. In addition, this configuration represents a shape that is usually found in the bottom portion of a character.
The configurations shown on keyboard 10 are used by a typist to identify portions of a character to be typed, so as to call that character from the processing system memory.
The process of identification is built on the known "four-corner" system, wherein the ten stroke configuration types described above are used to produce a code which corresponds to the character. Onthe basis that a Chinese ideogram is basically square in appearance, a four-digit code can be produced from the above-described key pad 10 by identifying various stroke shapes in the four quadrants of a character:

.~,;~ .

i~49~3 the upper left, upper right, lower left, and lower right, and by depressing the corresponding keyboard keys in that sequence. This produces a series of keyboard signals, which for convenience may be referred to as a series of corresponding keyboard numbers, which constitute an identifier code for the character. When this code is determined by the shape of the character, it will herein be referred to as a shape identifier code.
The previously known four-corner system for identify-ing ideograms required a four-digit code number to identify every character, whether or not that character had four identifiable corners. In the case where there was not an identifiable stroke configuration, the prior system required insertion of a "O" (or null); however, since the O key also represents a specific stroke configuration, the prior four-corner system had a built-in ambiguity. Further, since the prior system required a null identifier, the use of that system resulted in the generation of numerous unneeded signals. In fact, in one sampling it was found that a null signal appeared in about 53%
of the characters, and thus introduced ambiguities or extra key strokes in a majority of characters to be typed. In accordance with the present invention, however, the null key stroke of the four-corner system is eliminated, so that the zero key is only used to provide identification for a stroke shape actually appearing in the character to be typed. Thus, for example, the Chinese character "~" has all four corners covered by a single stroke; however, the prior four-corner system required the typist to identify it with four key strokes:
a "1" and three null indicators, to provide a code number of 1000. Under the new four-corner system of the invention, the character may be identified by a "1" key stroke alone.

~4~9~63 The new four-corner encoding system thus has the advantage that while simple characters can be identified by as few as one code number, more complex characters have additional identifier code positions available, and this increase in stroke categories serves to reduce the ambiguities which occur as a result of the typing process. Further, the typist need not remember to add null zeros when reading an ideogram; it is only necessary to identify the shapes that are actually present in the character so that, on the average, fewer key strokes are required in typing the characters.
An example of the use of the stroke configuration displayed on the key pad 10 of Fig. lA to encode Chinese ideograms is illustrated in Figs. 2 and 3, wherein the Chinese characters "di" and "fang" are diagrammatically illustrated.
These characters may be translated into English as ~land"
and "area", respectively, and ~when used together as the single, two-syllable word (or word phrase) difang, may be translated as meaning "place". The character "di" may be identified by the stroke configurations indicated within the dotted circles 16, 17, 18 and 19 in the four quadrants of the character, and a comparison of these configurations with those on the keyboard 10 illustrates that the character may be identified by the new four-corner system of encoding by striking keys, 4, 4, 1 and 1 in sequence, giving the shape identifier code 4411 for that character. It will be understood that the illustrated numeric code is exemplary of the presently preferred form of this invention, and that other numerical, alphabetical or symbolic codes may be provided, the particular indicia used being a matter of choice and in part dependent upon the particular keyboard being used.

`:

1~4~g63 The character "fang" similarly may be encoded through use of the new four-corner system, wherein the upper left, lower left, and lower right quadrant configurations 20, 21 and 22, are respectively represented by the keys 9, 5 and 5, respectively. Note that no stroke configuration need be identified for the upper right quadrant, and that no filler key stroke is required; thus, no ambiguity is created by the encoding process. The identifier code 955 thus represents the character "fang", as illustrated in Fig. 3.
When typing Chinese characters by means of the electronic typewriter system of the present invention, in the shape recognition mode, the typist looks at the character to be reproduced, and by use of the new four-corner system described above, strikes selected keys on keyboard 10 in sequence to produce an identifier code for that character.
The keyboard produces correspo~ding signals which are fed into the data processing system (to be described) to call up the character so selected. Although the identifier code selected by the operator for a particular character will often call up the desired character, the complexity of the Chinese ideogram, the manner in which it is constructed, and the large number of characters in the Chinese language result in a large number of characters which closely resemble each other, and it often happens that a given identifier code will call up more than one character from the data processing system; i.e., will produce an ambiguity. An example of this ambiguity is illustrated in Fig. 4, with respect to the character "fang".
As noted, the character "fang" of Fig. 2 may be identified in the new four-corner system by the shape identifier code 955. However, this code number only refers to peripheral 114~63 characteristics of the ideogram, and a number of other characters having distinct configurations and meanings have the same identifier code. Figs. 4a-4f illustrate six ideograms having the identifier number 955, as follows:

Fig. 4a: yù, meaning "education" (Telegraph Code 5148);
Fig. 4b: fang, meaning "area" (Telegraph Code 2455);

Fig. 4c: di, meaning "emperor" (Telegraph Code 1593);

Fig. 4d: gao, meaning "height" (Telegraph Code 7559);

Fig. 4e: shang; meaning "commerce" (Telegraph Code 794);

Fig. 4f: shi, meaning "marketplace"
(Telegraph Code 1579).
It is noted that the "Telegraph Code" number is the number assigned to each character in the standard Telegraph Book that has been in use for many years to provide means for identifying particular Chinese characters.
When the system of the invention i9 used in the phonetic mode, the keyboard 11 illustrated in Fig. lB may be used. This may be a standard typewriter-style keyboard, and conveniently is a conventional computer input terminal key-board. All of the alpha symbols, with the exception of the letter "v" are used, and thus no overlay or modification of the board is needed. However, since the phonetic pinyin system utilizes superscripts as well as alpha symbols, standard keys carrying the standard symbols "-", "/", "=", and "~" may be used to represent the first, second, third and fourth tones, respectively.

Although the tone marks in standard pinyin trans-scriptions are written as superscripts over syllabic vowels, in accordance with the present invention the pinyin words are typed on keyboard 11 simply by typing the needed tone mark in sequence after the spelled syllable is typed. Thus, for example, a pinyin syllable such as "shi" is typed on keyboard 11 as "shi-", the syllable "di" is typed "di/" and the syllable "fang" is typed "fang/".
The pinyin alpha symbols and tone marks serve the same function as the shape identifiers of key pad 10, in that they produce an identifier code which corresponds to ~he ideo-graphic character to be typed. In the case of the key pad 10, the identifier code is a series of numbers (e.g., 4411 and 955), which correspond to the shape of the character, while in the case of keyboard 11, it is a series of alpha and tone symbols which correspond to the sound, or pronunciation, of the character.
Although the identifier codes produced in accordance with this invention do not themselves introduce ambiguities, a given code may call up more than one character from the system, and accordingly, both manual means and automatic means for disambiguating the identified characters are provided.
These means take advantage of the fact that while a Chinese ideogram represents a single syllable in the language, many Chinese words consist of two characters in a pairing to make a compound, or word phrase. Ithas been found in accord-ance with the present invention, that by typing these compound word pairings in sequence, most of the ambigui-ties due to similarities in shape or pronunciation can be eliminated. Thus, for example, if only one of the many ~, ;3 characters in Fig. 4 identified as 955 can be paired with only one of the characters which might be identified as 4411 (Fig. 3), then when the typist calls for the pair 4411, 955, the pairing of Fig. 3 will be uniquely identified, thus eliminating the ambiguities that would othèrwise exist for 4411 standing alone and for 955 standing alone. The same pairings exist, of course, when the identifier code is based on pinyin instead of shape characteristics.
It is possible that for some identifier code pairings there will still be ambiguities, since there are some identi-fiers which call up multiple Chinese character pairings. When this occurs, means are provided to display the multiple pairings in sequence, for manual disambiguation. This manual -disambiguation is also available when a single character is to be typed, where automatic disambiguation cannot be used.
The manual operation provides a rapid display of the various choices available to the typist, who may then select the desired character for printing or storage. This allows the typist to proceed quickly to the next character to be typed, enabling the typist to achieve typing speeds not previously possible.
The system of the present invention is disclosed in block diagram form in Fig. S, which illustrates at 28 a data processing system having a character selection control logic section 30 (to be described) which is operated under the control of the keyboards 10 and 11 shown in Figs. lA and lB.
The control logic responds to instructions from either keyboard to call up the desired characters from an addressable storage section or memory 32, which may, for example, be a disc or other read-only memory. The memory 32 receives, by way of data 1149~3 .
input 34, information files which relate specific Chinese characters to specific identifier code indicia, so that the typing of shape or sound identifiers on keyboards 10 or 11 will produce identifier codes which will cause logic section 30 to call up, or retrieve, the corresponding character or characters. Preferably, each character has a unique index code by which it is cataloged in storage section 32. Con-veniently, the Telegraph Code may be used for this purpose, although other index codes may be used.
klso stored in section 32 is the pairing information for each character, listing the other characters with which it may be paired to form a two-syllable word. In this listing, the character is considered to be the first of a pair, with the pairing information identifying which characters may be used as a second syllable. Thus, when the shape identifier code 4411 ("di" in Fig. 2) is used to call up a character, section 32 provides a listing, by index code (here, the Telegraph Code) of those characters which have the identifier number 4411, together with a listing, by index code, of characters which might be paired with the selected characters.
Thus, 4411 calls up the following information:

Table I

Identi-fier Telegraph Code Index Code Pairings (Telegraph Index Code) 4411 : 966 (7240, 7, 3~., 143, 690, 1601, 2455, 2975, 3810, 4122, 4318, 3808, 528, 7191, 7820) 5413 (5413) , ~

~14g9~3 Note that the character having Telegraph Code 966 can be paired with fifteen other characters, while the character having Telegraph Code 5413 can only be paired with itself.
The file section 32 similarly contains for the identifier number 955 the following information:

Table II

Identi-fier Telegraph Code Index Code Pairings (Telegraph Index Code) 955 : 5148 2455 (3127, 4104, 7240, 2973, 143 686, 189, 1709, 11, 2088) 1593 (79, 455, 948, 1004, 1446, 3769, 6757) 7559 (1129, 5281, 2814, 3808) 794 (86, 5307, 756) 1579 (6,~198, 90, 1034, 1627, 1869, 239~, 3127, 5116, 6133, 7024, 7240, 7333) ' In similar manner the phonetic identifier codes (e.y,, "di~" or "fang/") produced by keyboard 11 will cause the logic control 30 to call up any character or characters listed in file 32 as having the same phonetic code. This will result in a listing, by Telegraph Code, of all characters which sound like the typed syllable, together with their possible pairi.ngs. It will be apparent that the list of characters called up by the phonetic identifier code may differ rom the list called up by the shape identifier code, even though the typist is seeking to type the same ideogram. Furthermore, the pairing lists of index codes and pairings produced by either method will contain the desired ideogram or ideogram pair, so ~1491~63 that the disambiguation of the present invention (to be described) will produce the desired character or character pair.
When the character selection control logic 30 to be described has been operated to select the desired character or characters from file section 32 and has eliminated any ambiguity, the selected characters are stored in a text file section 36 for printing, storage, or both.
To permit the system to generate the Chinese charac-ters sélected by the typist, a character storage and generator section 38 is provided. This section is a conventional character generator such as that shown, for example, in U.S.
Patent No. 3,936,664, which may receive graphic information from a graphics data input device 40. This data input may be from a pen tracer device for direct graphical input, from an optical scanner for producing digital representations of graphical information, or from any other conventional graphics data source which will enable the system to store in section 38 the information required to allow generation of any Chinese characters selected by logic section 30.
The character generator 38 produces an output to a display unit 42 and to a printer 44 to produce the required characters. The display unit may be, for example, a cathode ray tube at the typist's table for visual display of the characters being selected. This enables the tyPist to verify the selection-and-to~compare it with the original manuscript from which the characters are being typed. The display also aids the typist in manual disambiguation. The printer 44 may be a conventional dot matrix printer for producing a printed copy of the text being typed after disambiguation has been completed.

` ~149963 In a preferred form of the invention currently -being implemented, the data processing system utilizes apparatus such as a PDP-11/40 model computer manufactured by Digital Equipment Corporation. The keyboard 10 is a conventional 12-key pad which is used in conjunction with the data input keyboard 34 of the PDP-11/40, the keyboard 11 may be a part of the data board 34, the graph$cs input device is a graphics tablet manufactured by Talos Systems, Inc., the display unit 42 is a Tektronix Model 4013 CRT display asso-ciated with the PDP-11/40, and the printer is a Versatec Model 1200A Printer/Plotter manufactured by Versatec, a division of Xerox Corporation. ~PDP" is a registered trademark of Digi-tal Equip~ent Corporation.
A more detailed description of the system of Fig. 5 is provided in the block diagram of Fig. 6, which incorporates Figs. 6A and 6B, and to which reference i6 now made. In this block diagram, the elements of Fig. S are similarly numbered, and thus keyboards 10 and 11, the random access memory section or file 32 for storing character codes and pairings, the selection control circuit 30, the text file 36, the graphics dat~ input 40, the display 42, and the printer 44 are all illustrated in Fig. 6.
The character selection control 30 incorporates a pair of identifier storage buffers 50 and 52 which receive from keyboards 10 and ll the identifier codes for the charac-ters to be typed. Where a single character is being typed, the identifier code i8 fed to buffer S0, but where a two-syl-lable word is being typed, the first syllable is entered in buffer 50 and the second syllable is entered in buf~er 52. The characters are entered by first typing on the keyboard the identifier code for the first character which, in the example , .
.
.:; ~ ~ . . . .

114g~3 of Fig. 3, would be the shape identifier code number 4411.
If this character is to be followed by a second character to form a two-syllable word, a comma (,) is typed on key 12 of keyboard 10, the "," being the symbol for the space between characters in a pair. Thereafter, the identifier code for the second character, 955 in the example, is typed and this is followed by depressing key 14 on the keyboard which carries the "print" symbol and which serves as the delimiter which is used to indicate either the end of a single character or the end of a pair of characters. It should be noted that this print symbol is used for both the shape and the phonetic identifier codes, and thus may be provided on keyboard 11 if desired.
Upon depressing key 14, the first identifier code is entered in buffer 50 (Fig. 6A) and if there are two codes, the second identifier code is entered in buffer 52. These buffers provide outputs on lines 54 and 56, respectively, to the memory file 32 to call up the information located at the addresses specified by these two identifiers. The file 32 transfers by way of lines 58 and 60 the data corresponding to the first identifier code to a storage buffer 62, transferring to buffer 62 the index codes and pair codes for all of the characters which correspond to the first identifier code. In this instance, the identifier code for the first character calls up the information indicated in Table I hereinabove and stores that information in buffer 62. In similar manner, the identifier code for the second character calls up the data from Table II
hereinabove and feeds that data by way of lines 58 and 64 to storage buffer 66. This storage buffer receives the index codes corresponding to the selected characters, but since the pairs ~, 1~4~63 information for the second character is not required for resolving ambiguities, pairs information need not be included.
A suitable logic circuit 68 is provided to sense whether the data entered by keyboards 10 and 11 represents a single character or a two-character word. If only a single character (simplex) word is entered, there is no need for the pairs information stored in buffer 62; only the index codes stored therein are needed to identify the character to be typed. The index codes representing each of the characters which correspond to the identifier code supplied by the key-boards 10 and 11 are fed by way of line 70 through gating means 72 to line 74 and thence to a "pick list", or automatic selection buffer 76. Gate 72 transfers this index code information to the pick list when the number of character identifier codes ~nJ enteréd in the storage areas 50 and 52 is equal to one (n=l). When two sets of character identifier codes are entered (n=2), a different procedure is followed which will be discussed below. The output of logic network 68 is applied by way of lines 78 and 80 to gate 72 and is also applied by way of lines 78 and 82 to a second gate 84, the latter being operated when an identifier code representing only a single character is received from the keyboard 10 or 11 to transfer the data from the pick list buffer 76 by way of lines 86 and 88 to a selector logic network 90.
When only one character is to be typed (n=l), the selector logic 90 receives the first index code from the pick list buffer 76 and determines if it is the only one. If only one index code is in that buffer, it is transferred immediately to the text buffer 92 (Fig. 6B) by way of line 94 and to a . .
~;

~i4~3~63 display buffer 96 by way of line 98. The data in display buffer 96 then activates the character generator 38 by way of line 100 and the display unit 42 by way of line 102 to provide a visual display of the character. Transferring the index code to the character generator 38 calls up the specific character which is identified by that index code and the typist may then compare the displayed character with the character from the manuscript material being typed to determine whether the system has produced the correct Chinese ideogram. When only one index code is received by the selector logic, the data in text buffer 92 is automatically transferred to the text file 36 by way of line 104 for storage and for printing. If the character is to be printed, the data in the text file activates the charac-ter generator 38 by way of line 106 to generate data relating to the printing of the selected character, which information is supplied by way of line 108 to printer 44. An appropriate format control may be provided for theFrinter by way of format control circuit 110 which is activated by an output on line 112 from the text file and which controls the printer 44 by way of line 114.
If the identifier code for the charactsr to be typed calls up a plurality of index codes for storage in the pick list buffer 76, the selector logic 90 selects ("picks") the first one in the list, transfers it to the text and display buffers 92 and 96, as described above,and displays the corresponding Chinese ideogram. If the typist wishes to use that character, the keyboard 10 is operated, for example by depressing the "1" key followed by key 14 (the "print" key) to transfer the selected index code to the text file for ~ g~G3 printing or storage of the corresponding character. If the first index code does not display the desired character, the typist depresses only the key 14 (for example), which produces a signal on line 114 to cause the selector logic to sample all of the remaining index codes in the pick list buffer 76 and to transfer them sequentially and repetitively to the text and display buffers 92 and 96. This causes the characters corresponding to the remaining index codes to be displayed for visual selection by the typist. The typist then depresses the key or keys on keyboard 10, or equivalent keys on keyboard 11, which have numerical values that corres-pond to a desired selection from the displayed list, with that number being followed by the print command of key 14 or its equivalent. Thus, for example, if nine index codes are displayed, and the operator wishes to select the fifth one in the list, he depresses key 5, followed by key 14 to transfer the fifth character in the list to the text file 36.
To facilitate the foregoing selection process, the file 32 normally contains the index codes corresponding to any given identifier code in the order of most frequent use, so that when the index codes are transferred to the pick list buffer 76, the first one on the list will be the one that is most likely to be the desired character. This results in a considerable saving of time if there is an ambiguity to be resolved.
In the event that the Chinese word being entered by way of keyboard 10 or keyboard 11 consists of two characters, so that two identifier codes are entered into the buffers 50 and 52, the index codes of all of the characters which correspond to each of these two identifiers will be called up -~4~g63 and stored in buffers 62 and 66, respectively. The control circuit 30 will then proceed to determine whether any ambigùities exist, and if so to revolve them. This is accomplished by means of a matching network 120 (Fig. 6A).
The matching network 120 is connected to the output of storage buffer 62 by way of lines 70 and 126 and is connected to the output of storage buffer 66 by way of line 128. The circuit scans the contents of buffers 62 and 66 to match the index codes in each of these buffers, creating a series of index code pairs which are supplied by way of line 130 to the pick list buffer 76. Thus, the matching network 120 selects the first index code stored in buffer 62 and matches, or pairs, it in turn with each of the index codes stored in buffer 66 to create a first series of index code pairs, which are then stored in the pick list buffer 76. The matching network 120 then sel~cts the second index code (if any) in buffer 62 and matches it in turn with each of the index codes in buffer 66, creating a second series of index code pairs which also are stored in pick list 76. The matching circuit 120 continues in this manner until each of the index codes in buffer 62 is paired with each of the index codes in buffer 66 and these index code pairs are all listed in the pick list buffer 76. The pick list buffer 76 then contains a complete listing of all of the possible combinations of index codes which can be derived from the two identifier codes selected by the typist.
The index code pairs stored in pick list buffer 76 are supplied one at a time by way of lines 86 and 132 to one input of comparator 122. This comparator then compares each index code pair on line 132 with the pairs information contained in the storage buffer 62 and fed to the comparator 122 by way of line 134. In this way, all of the possible ~, O, ~4g~63 index code pairings listed in the pick list 76 are compared with the permitted index code pairings previously established for each of the characters selected by the identifier code for the first character in a word pair. Each time a possible pair on line 132 is found to correspond to a permitted pair on line 134, that pair is immediately transferred by way of line 136 to the significant pair storage buffer 124 to indicate a "hit".
After all of the possible pairs in buffer 76 have been compared to all of the permitted pairs for each of the index codes in buffer 62, the selector logic circuit 90 scans the pair storage buffer 124 to determine whether any hits have been registered and if so, whether there is more than one hit. If only a single pair is stored in buffer 124, the selector logic 90 immediately supplies that pair of index codes to the text buffer 92, to the ~text file 36 for storage or for printing, and to the display buffer 96 for visual display on unit 42 of their corresponding characters to permit visual inspection by the typist. When this occurs, the system has successfully resolved all ambiguities automatically to provide extremely rapid typing of the desired character pair.
If the pair storage buffer 124 contains no pairs, the selector loglc 90 may be activated to display the first pair of index codes stored in the pick list buffer 76. If that pair is not accepted by the typist, then the selector logic scans each of the other pairs in buffer 76 and displays them for visual inspection by the typist and manual selection by way of a keyboard entry, as discussed above, for manual resolution of the ambiguity.

;7 ' . . , ' ~ :

1149~63 If more than one pair of index codes is present in the storage buffer 124, the selector logic 90 provides manual resolution of this ambiguity, again in the manner described above, by selecting a first pair from buffer 124 for display, and if that is not the pair desired by the typist, thereafter displaying the remaining pairs in the buffer i24 for manual selection. If none of the foregoing procedures producethe desired character or character pair, then either the typist has misidentified the desired character, or the data file does not carry that character.
Although the selection control circuit 30 is ilIustrated in diagrammatic form in Fig. 6, it will be under-stood that each of the components thereof is conventional and may be activated by conventional switching or logic circuits.
Thus, for example, the matching circuit 120 may simply be a conventional stepping circuit which receives inputs from two sources by way of lines 126 and 128 and steps through one source completely for each step of the other source, producing an output on line 130 for each step. Similarly, the comparator 122 is a conventional circuit which receives data corresponding to specified index code pairs, determines whether the two inputs are identical and, if so, transfers the data to buffer 124. The selector logic 90 may be a conventional multiplexing unit which sequentially selects one of a multiplicity of inputs for transfer to a single output which is then supplied to the buffers 92 and 96.
The method of resolving ambiguities in the typing of symbolic graphical characters such as Chinese ideograms by the use of the system described with respect to the preceding ~ figures is illustrated diagrammatically in Figs. 7A, 7B and 7C
:

. .

~149~63 which represent a flow chart for the circuitry of Figs. 6A
and 6B. As indicated in block 150, the first step in the process is for the typist to enter into the system by means of either the keyboard 10 or the keyboard 11 one or two coded identifiers selected in accordance with the four-corner stroke configuration of the character or characters to be typed, or selected in accordance with the phonetic spelling of such character or characters, or selected in accordance with a combination of these, i.e., with some characters being selected phonetically and others by their shape. The two modes are interchangeable, not exclusive, so that if desired each charac-ter of a two-syllable word can be selected differently. Upon entry of this information by the typist, the system calls up the index codes and pair lists for the first identifier, as indicated in block 152, and determines whether there is a second identifier, as indicated in block 154. If there is no second identifier, the identifier count is set to one, as indicated in block 156, and the process proceeds with the selection of all of the index codes for the first identifier, as indicated by blocks 158, 160, 162 and 164. If a second identifier code is entered, the system first registers that fact and then calls up the index codes for the second identi-fier, as indiGated in block 166, before proceeding.
When there is a second identifier, the first index code for the first identifier is selected, as indicated in block 158, and the-system then se}ects-the first--index code for the second identifier, as indicated in block 168, rather than immediately proceeding to select all of the remaining index codes for the first identifier. Upon selection of the first index code for both the first and second identifiers, the pair :
.

, ~149~63 is transferred t~ the pick list selection buffer 76 as indicated in block 170 and 172. This process is the function of the matching network 120 of Fig. 6A.
The next step is to compare this pick list entry with each of the pair listings for the first identifier, in accordance with block 174. ThiS is the function of the comparator 122 in Fig. 6A. If the selected pair corresponds with one ofthe permissible pairs in the pair listing, thereby indicating that this pair might be the one that is desired by the typist, this pair is transferred to the significant pair storage buffer (referred to as the "hit list"), as indicated in block 176. Thereafter, the next index code for the second identifier is selected, as indicated by block 178, it is matched with the first index code for the first identifier, and this new pair is placed in the pïck list buffer 76 for comparison with the pair listings, as before. This process continues until all of the index codes for the second identifier have been paired with the first index code for the first identifier.
When as indicated by block 170, no additional index codes are available for the second identifier, the second index code for the~first identifier is selected in accordance with block 164 and that second index code is compared with the index codes for the second identifier in accordance with blocks 168, 170, 172, 174, 176 and 178. Thereafter, block 164 selects the next index code for the first identifier and the process is repeated until all of the index codes for the first identifier have been matched with all of the index codes for the second identifier, all of the matched pairs have been compared to the pair listings for the first identifier, and ! ~ ` ` - ' ' i 1~4~963 all significant pairs have been stored in the significant pair storage buffer 124.
It will be seen that if only one identifier has been entered into the system (n=l), then all of the index codes for the first identifier are entered in the pick list buffer 76. Similarly, if (n-2), all of the possible pairs of index codes for the first and second identifiers are entered in the pick list 76 and further, these are compared with the permissible pair listings for the first identifier and any matchups (or hits) are stored in the significant pair storage buffer 124. The~system is then ready to proceed to the selection process, which results in the final selection of the desired character or characters in accordance with the procedures of Fig. 7B.
Considering first the situation where only a single identifier has been entered, the first step in-the selection process is to scan the pick list buffer 76 to determine whether a single index code has been selected, as indicated by block 180 (Fig. 7B). I so, that index code i8 transferred to the text and display buffers 92 and 96, in accordance with block 182 (Fig. 7C), for visual inspection by the typist and the process is complete, as indicated by block 184. In this case, the stroke configuration identifier entered by the typist will have correctly identified a single character which is the one desired by the typist, and that character can then be printed or stored, as desired.
If there is not a single selection in the pick list buffer 76, the steps of blocks 186, 188 and 190 are followed.
In this case, the first entry in the pick list is selected and displayed for visual inspection by the typist and if the typist i~4~963 .
accepts that first entry, it is transferred to the text and display buffers 92 and 96 in accordance with block 182.
If, however, the first entry is not accepted, the remaining entries are displayed, and if the typist accepts one of these, the accepted entry is transferred to the text and display buffers. Again, if none of the entries are accepted by the typist, there is no transfer of data to the text and display buffers, and the process is completed.
If no entries show up in the pick list 76, indicating that the identifiers failed to call up a corresponding character index code, there is nothing to be displayed and the process is complete, as indicated by block 192.
Where the typist has entered two identifiers, the selection process of Fig. 7C is followed. The first step in this process is indicated by block 194, wherein the significant pair storage buffer (124 in F g. 6A) is scanned to determine whether there is only a single entry. If 80, the matching and comparing procedures carried out by the matching network 120 and the comparator 122 have successfully and automatically resolved any ambiguities in the typing process, and this single entry can then be transferred to the text and display buffers 92 and 96 indicated in block 182, thereby completing the typing of those two characters.
If more than one pair of index codes is found in the pair storage buffer 124, as indicated by block 196, the first pair is selected and presented to the typist for visual inspection, as indicated in block 198. If that first pair is accepted, it is transferred to the text and display buffers 92 and 96 in accordance with block 182. If that first pair is not accepted, however, the remaining pairs from the pair storage ,~
.~ ~
. .

11~9S6;3 buffer are presented for inspection, and if the typist accepts one of those later pairs, as indicated by block 200, the accepted pair is transferred. Again, if the typist does no accept any of these later pairs, the process is complete.
Finally, if inspection of the pair storage buffer 124 reveals no significant pairs stored therein by the comparator process, as indicated in block 202, the system operates to allow the typist to duplicate the process previously carried out by the comparator 122. Thus, in accordance with block 204, the first pair placed in the pick list buffer (76 in Fig. 6A) is selected and the typist determines whether to accept that first pair. If it is accepted, it is transferred to the text and display buffers 92 and 96. If it is not accepted,then in accordance with block 206, each of the following pairs in the pick list 76 are selected in turn and if the typist accepts one of those pairs, it is transferred to the text and display buffers. If none of these pairs is accepted, the character identification process is complete for the selected identifiers.
From the foregoing it will be seen that a new and unique procedure for identifying Chinese or like characters by selected stroke configuration and/or phonetic spelling is provided. Because of the recognltion that certain characters appear in pairs,the ambiguities otherwise inherent in the identification process can be elmininated or at least reduced in number so that if a manual selection of characters must be made, the number to be considered is greatly reduced. In this way, typing speed for ideographic characters is greatly enhanced over prior systems.

`` 11499~;3 The operation of the present system for a single Chinese character having a four digit identifier may be illustrated as follows:
If the word to be entered is "di", translated "land", keys 4411 on the keyboard 10 are depressed, since those keys carry shape configurations which most nearly resemble the four quadrant shapes of the character "di", as shown in Fig. 3.
As illustrated in Table I hereinabove,~the conventional Telegraph Code is used in the presently preferred embodiment of the invention as the index code for the specific Chinese characters, with each identifier number serving to call up all characters having the peripheral shape configurations represented by this particular keyboard entry. Thus, the identifier 4411 calls up from the system storage file the characters represented by the index (Telegraph) codes 966 and 5413 (See Table I), plus the pair listings for each, and these are stored in the first identifier storage buffer 62.
Because this example assumes that only a single character identifier is involved, the index codes 966 and 5413, but not the pair listings, are transferred to the "pick list"
selection buffer 76, and the character represented by the first index code 966 is displayed. This character is the word "di"
(as established by the Telegraph Code book, for example), which the typist accepts. Accordingly, the typist adds the index code 966 to the text buffer, and goes to the next character to be typed.

. ~4g963 The operation of the system in handling another single identifier representing, for example, the word "fang", translated "area", may be illustrated as follows:
From Figs. 2 and 3, it will be seen that the shape identifier code which represents the stroke configuration for "fang" is 955, only three code numbers being needed since the shape of the character is such that there is no peripheral stroke in the second quadrant. In the present system, it is not necessary to use a filler zero in the identifier, so that source of introduced ambiguity is avoided. As shown in Table II
above, the shape identifier code 955 calls up six characters which have similar peripheral configurations (see Figs. 4a-4f), which characters are represented by the index codes 5148, 2455, 1593, 7559, 794 and 1579, taken from the Telegraph Code book. These index codes, acco~mpanied by their pair listings, are transferred to the buffer 62, and the index codes only are then transferred to the pick list selection buffer 76, since pair listings are not re~uired for single character words.
The fact that six characters have been called up by a single shape identifier represents an ambiguity to be resolved. Disambiguation is accomplished by first displaying the character represented by the index code 5148, which is illustrated in Fig. 4a. If this is not the desired character (and it is not in the present example), it is rejected by the typist, and the selector logic then displays the five characters represented by the remaining five index codes in buffer 76. These are the characters of Figs. 4b-4f.

~g~1;3 If the typist decides that the first of these characters (Fig. 4b) is the desired one, the number "1" is indicated by the typist on the keyboard, and when the "print" button is pressed, the index code 2455 is stored in the text buffer 92.
Even though ambiguities are present in both Example 1 and Example 2 which are not automatically resolved, it will be seen that the present system has greatly reduced the number of characters displayed to the typist for manual selection, and the speed with which the desired character can be selected and typed is thereby greatly enhanced.

1149g63 The use of the pair listings in the automatic resolution of ambiguities may be illustrated as follows:
The character pair "di fang", translated "place"
is to be typed, using the system in the shape recognition mode. The typist first inspects the character "di", and enters the identifier 4411 on the keyboard 10, this coded identifier being selected by inspection and recognition of the peripheral stroke configurations. The typist recognizes that the next character is part of a Chinese two-syllable word, or compound word, so the delimeter "," is then entered by depressing key 12 on the keyboard, and the next character of the two-syllable word is inspected and its corresponding identifier 955 entered by the keyboard. The recognition of a Chinese compound requires that the typist be familiar with the Chinese language.
~ he index codes 966 and 5413 for the first character, together with their permissible pair listings (i.e., the listing of characters with which the first character may be paired to form a compound) are entered in buffer 62, and since there are two characters, the index codes for the second character, i.e., code numbers 5148, 2455, 1593, 7559, 794 and 1579, are entered into buffer 66. Since these index codes represent the second character of a word-phrase, their pair listings are not required, and thus are not entered in buffer 66.

~, , 1~L49963 The matching network then pairs the index codes, to provide the following list of possible pairings:

; 5413 1579 This listing of possible pairings is compared with each of the permissible pairs (See Table I) for the first character stored in the storage buffer 62, and all of the possible pairs which are found in the list of permissible pairings are transferred to the significant pair storage buf~er 124. In this case, it will be seen that the pair 966, 2455 is found in both places, and is stored in buffer 124. This is the only pair which appears in both lists.
The selector logic 90 determines that only a single pair is stored in buffer 124, and accordingly displays the characters represented by the index codes 966 and 2455;
namely "di fang", the desired characters. Thus, all ambigu-ities have been resolved automatically, and the codes 966 and 2456 are entered in the tex~ buffer 92.

114~g63 The operation of the system in the phonetic mode, using the pinyin system for identifying the characters to be typed, is essentially the same as in the shape recognition mode illustrated above. The only difference is that instead of using keyboard lO to enter a shape identifier code, the keyboard ll is used to enterthe phonetic (pinyin) spelling of the character or characters to be typed, and the phonetic spelling provides the required identifier codes. The identifier codes then operate in the same manner as described above to call up all of the corresponding characters, and the index codes of the called-up characters are transferred to buffers 62 and 66. Thereafter, the matching network 120 pairs the index codes, and disambiguation proceeds as described above.
Although keyboards 10 and ll can be used separately and a system can be produced in accordance with the invention having only one keyboard, numerous advantages may be derived from providing the two in parallel. With such an arrangement, the two keyboards can be interchangeably used without resorting to any sort of shift mechanism, and the system will operate as described above. Thus, for example, the word "di fang" can be identified in any of the following ways:
Shape recognition 4411, 955 Pinyin : di , fang Shape + pinyin 4411, fang Pinyin + shape di , 955 In the use of the present system, entry of any one of the above sets of identifiers would result in a display of the characters shown in Fig. 2.
Although the system and method of the invention have been described in terms of block diagram circuitry illustrating ~14~9g~3 the structure and function of data processing circuitry capable of carrying out the concepts of the system, it will be understood that in a preferred embodiment of the invention, the process may be carried out in a general purpose data processer appropriately programmed to follow the procedures described above. An example of a program listing which is capable of carrying out such a procedure in the PDP-11/40 general purpose computer is set out in Appendix A. Although this program listing represents the currently used procedure for enabling operation of novel keyboard apparatus and in-structing such general purpose computer in carrying out the invention, it will be apparent that special purpose circuitry may be constructed in accordance with the foregoing descrip-tion to carry out the described method equally well. Numer-ous variations and modifications may be made in the illus-trated system and in the program listing, such as adapting the sy~tem for use with symbolic languages other than Chinese, or permitting the use of the National Phonetic Alphabet (Zhuyin Fuhao), kana ~for identification of kanji) or any of a number of other syllabaries or alphabets. If desired, the illustrated system and program can be revised to provide for the use of an occasional 5-stroke identifier for common, often-used words that would otherwise have to be disambigu-ated every time they occurred. These and other variations may be made by those of skill in the art, without departing from the true spirit and scope of the invention as set forth in the following claims.

Claims (44)

The embodiments of the invention in which an exclusive property or privilege is claimed are defined as follows:
1. A method of producing ideographic text material utilizing a keyboard having a plurality of keys carrying indicia corresponding to graphic characters to be produced, comprising storing in a memory graphic char-acters having features similar to those of characters to be produced, each stored character having an identifier code based on such features, selecting one or more keys in a sequence dependent upon selected features of characters to be produced to construct an identifier code for each desired character, calling up from said memory all stored characters having the constructed identifier code, tempor-arily storing said called-up characters, determining if an ambiguity exists between the number of characters desired and the number of characters called up by said identifier code and placed in temporary storage, resolving any ambigu-ities, and transferring the desired character to a text storage means.
2. The method of claim 1 wherein the indicia on said keys correspond to shape recognition features typical of selected portions of graphic characters to be produced, and the step of selecting one or more keys pro-ducing for each desired character an identifier code cor-responding to specified stroke configurations of the character.
3. The method of claim 1 wherein the indicia on said keys correspond to a phonetic alphabet, the step of selecting a plurality of keys in sequence comprising spelling the phonetic pronunciation of each desired charac-ter, and said phonetic spelling comprising the identifier code for such character.
4. The method of claim 1 wherein the step of resolving ambiguities comprises displaying sequentially each of the characters called up by said identifier code, and manually selecting the desired character from those displayed.
5. The method of claim 2 wherein the step of selecting one or more keys for each desired character comprises selecting one key for each quadrant of a graphic character where a characteristic stroke configuration appears, the single key carrying the indicium which most closely identifies the shape of that stroke configuration, and the selection of between one and four single keys in said sequence combining to produce the identifier code for the character.

6. A method of producing ideographic text material utilizing a keyboard having a plurality of keys each representing an indicium corresponding to graphic characters to be produced, comprising selecting one or more keys in sequence to produce a first identifier for a first desired character, selecting one or more keys in sequence to produce a second identifier for a second desired
6. (concluded) character of a compound word, calling up from a character memory all the characters which correspond to said first identifier, calling up from said character memory a per-missible pair list for each character corresponding to said first identifier, calling up from said character memory all the characters which correspond to said second identifier, matching each of the characters corresponding to said first identifier with each of the characters corresponding to said second identifier to produce a list of possible character pairs, determining whether an ambiguity exists between said possible pair list and said permissible pair list, and resolving any ambiguity.
7. The method of claim 6 wherein the step of determining whether an ambiguity exists comprises comparing said permissible pair list with said possible pair list to determine whether more than one character pair appears in both of said lists.
8. The method of claim 7 wherein the step of determining whether an ambiguity exists further comprises manually selecting a desired character pair when more than one pair appears in both of said lists.

9. A method of typing symbolic language text material utilizing a keyboard having a plurality of keyboard indicia corresponding to a like number of configurations typical of graphic characters used in such symbolic lang-uage, comprising selecting up to four keyboard indicia
9. (concluded) approximating actual stroke configurations appearing sequentially around the peripheral quadrants of a character to be typed to produce a shape identifier code for the character, calling up from a character memory all characters which correspond to the shape identifier code produced by said keyboard, and which have peripheral stroke configurations similar to or the same as, and in the same sequence as, the character to be typed, storing in a selection buffer the characters called up by the identifier code, resolving any ambiguities which may exist in selecting the desired charac-ter from the characters stored in said selection buffer by transferring to a display buffer one after another the characters stored in said selection buffer to determine in each instance if it is the character to be typed, selecting from the displayed characters a desired character, and transferring the selected character to a text storage means.
10. The method of claim 9 further including the step of transferring the character stored in the selection buffer directly to the text storage means when no ambiguity exists in the selection buffer.
11. The method of claim 10 wherein the step of selecting from the displayed characters a desired character includes manually producing by the use of the keybaord an indicator for the desired character whereby the indicated character is transferred to the text storage means.
12. The method of claim 11 further including the step of printing the character stored in said text storage means to produce the symbolic language text selected by a typist.
13. The method of claim 12 wherein the symbolic language is Chinese.
14. The method of claim 12 wherein the step of selecting keyboard indicia includes selecting, for each quadrant of a graphic character where a characteristic stroke configuration appears, the single indicium which most closely identifies that stroke configuration, and between one and four single indicia are combined to provide the identifier code for the character.

15. A method of typing symbolic language text material utilizing a keyboard having a plurality of keys corresponding to a like number of stroke configurations typically used at the extremities of ideogrammatic language characters, comprising selecting up to four keyboard indicia corresponding to stroke configurations appearing at the periphery of a first character of a compound word to be typed to produce a first identifier for the word, selecting up to four keyboard indicia corresponding to stroke config-urations appearing at the periphery of a second character of said compound word to produce a second identifier for the word, calling up from a character memory all the characters which correspond to said first identifier, calling up from said character memory a permissible pair listing for each
15. (concluded) character corresponding to said first identifier, storing said characters corresponding to said first identifier and said pair listings therefor in a first storage buffer, calling up from said character memory all the characters which correspond to said second identifier, storing said characters corresponding to said second identifier in a second storage buffer, matching each of said characters in said first storage buffer with each of said characters in said second storage buffer to produce a list of possible character pairs, storing said list of possible character pairs in a selection buffer, comparing each of said possible pairs from said selection buffer with each of the permissible pairs listed in said first storage buffer, storing in a significant pair storage means all pairs which are found in both said possible pair list and said permissible pair list, determining the number of character pairs stored in said significant pair storage means to determine whether an ambiguity exists, and resolving any ambiguities by manually selecting one of the pairs in said significant pair storage means.
16. The method of claim 15 further including transferring the character pair in said significant pair storage means directly to a text buffer means when no am-biguity exists in said significant pair storage means and the desired compound word is automatically typed.

17. The method of claim 16 wherein the step of resolving any ambiguities includes transferring to a display buffer a first character pair stored in said significant
17. (concluded) pair storage means to determine if it is the character pair to be typed, thereafter transferring to the display buffer in sequence the remaining character pairs stored in said significant pair storage means, selecting from the displayed character pairs a desired character pair, and transferring the selected character pair to a text storage means.
18. m e method of claim 17 wherein the step of selecting a desired character pair from the displayed character pairs includes manually producing by use of the keyboard an indicator for the desired character pair.
19. The method of claim 18 further including the step of printing the character pair stored in said text storage means to produce the symbolic language text material selected by the typist.
20. The method of claim 18 wherein the step of selecting, for each quadrant of each ideogrammatic character to be typed in which a characteristic stroke configuration appears, the single keyboard indicium which most closely identifies that stroke configuration, and between one and four indicia are combined to provide the identifier for each character.
21. The method of claim 20 wherein the symbolic language is Chinese.

22. An electronic system for identifying and resolving ambiguities in the selection of single character or two-character symbolic language words, comprising a keyboard having a plurality of key indicia corresponding to selected features of graphic characters and adapted to produce an identifier representing a character to be typed, file means containing a first list of characters and a second list of permitted character pairings, said characters and pairings being listed in said file by index codes selectable by specified identifiers, whereby a selected identifier will call up the index codes and pairings of all characters having that identifier, first storage means for receiving the index codes and permitted pairings for the identifier of a first character to be typed, second storage means for receiving the index codes for the identifier of a second character in a two-character word to be typed, a matching network for matching the index codes stored in said first storage means with the index codes in said second storage means to produce a list of possible character pairs for a two-character word, selection storage means, means for connecting said selection storage means either to said first storage means to receive and store only the index codes in said first storage means for a single character or to said matching network to receive said list of possible pairs for a two-character word, a comparator connected to said selection storage means for comparing said list of permitted character pairings with said list of possible pairs, significant pair storage means to receive and store character pairs appearing in both said list of permitted pairings and said list of possible pairs, and selector
22. (concluded) means connected either to said selection storage means to resolve single character ambiguities or to said significant pair storage means to resolve two-character word ambiguities.
23. The apparatus of claim 22 further including means responsive to the number of characters in a symbolic language word to control the connection between said first and second storage means, said matching network, and said selection storage means.
24. The apparatus of claim 22 wherein said selector means includes means to selectively display the symbolic language characters corresponding to index codes stored in said selection storage means, and text file means to receive and store the single character word to be typed.
25. The apparatus of claim 22 wherein said selector means includes means to selectively display the graphic characters corresponding to the index code pairs stored in said significant pair storage means, and text file means to receive and store the character pair representing the two-character word to be typed.
26. The apparatus of claim 24 wherein said graphic characters are ideographic characters.
27. The apparatus of claim 25 wherein said graphic characters are Chinese language characters.
28. The apparatus of claim 22 wherein said selected features of graphic characters are peripheral stroke con-figurations thereof.
29. The apparatus of claim 22 wherein said selected features of graphic characters are the phonetic spellings of said characters.

30. An electronic system for typing symbolic language text material through identification of selected features thereof, wherein different graphic characters for said language may have similar identifying features, com-prising first storage means for receiving and storing a graphic character list and a permitted character pairing list for each graphic character, each said graphic character having an index code selectable by at least one specified identifier code, manually operable selector means corres-ponding to selected identifying features of graphic charac-ters, said selector means being operable to produce an identifier code representing identified features of the character or characters to be typed, means responsive to each said identifier code to call up and match the index codes and the corresponding pairing lists of all graphic characters having the specified identifier code, selection storage means connected to said first storage means for selecting index codes of a desired character or characters, means for displaying and comparing the graphic character or characters selected by said identifier code, significant storage means to receive and store characters appearing in both lists, and means for resolving ambiguities in the selection of said character or characters which appear in
30. (concluded) both lists whereby only the desired character or characters to be typed remains.
31. The system of claim 30 wherein said manually operable selector means comprises a keyboard wherein each key carries a different graphic stroke configuration approxi-mating actual stroke configurations appearing at the periphery of graphic characters to be typed.
32. The system of claim 30 wherein said identifying features are shape identifiers approximating peripheral stroke configurations of the character to be typed.
33. The system of claim 30 wherein said identifying features are the phonetic English language equivalent of the character to be typed.
34. The system of claim 33 wherein said manually operable selector means comprises a keyboard having keys carrying alphabetical indicia for producing an identifier code corresponding to the phonetic spelling of the character to be typed.

35. The system of claim 30 wherein said symbolic language incorporates single words represented by two char-acters, said system further including second storage means for receiving and storing the index codes and corresponding pairings list for the first character of said two-character word, and third storage means for receiving and storing the index codes of the second character of said two-character
35. (concluded) word, wherein said means for resolving ambiguities comprises matching means for comparing said index codes in said third storage means with said pairings list in said second storage means to produce a list of possible character pairs for a two-character word having the identifying features selected by said selector means, and wherein said display means dis-plays said list of possible character pairs.

36. A method of typing symbolic language text material through identification of selected features thereof, wherein different graphic characters for said language may have similar identifying features, comprising storing a graphic character list and a permitted character pairing list for each graphic character to be used in said text material, each said graphic character having an index code selectable by at least one specified identifier code, generating a first identifier code by utilizing manually operable means having indicia corresponding to selected identifying features of a first graphic character, calling up from said storage means all graphic characters and permitted pairing lists which correspond to said first identifier code, generating a second identifier code by utilizing manually operable means having indicia corresponding to selected identifying features of a second graphic character when a second character is com-bined with said first character in said symbolic language to form a compound, calling up from said storage means all graphic characters which correspond to said second identifier code, matching the characters corresponding to said first identifier code with the characters corresponding to said second identifier code to produce a list of possible
36. (concluded) character pairs, determining if an ambiguity exists between the possible pair list and the permitted pairing list, and disambiguating said called-up characters to identify the character or compound to be typed.
37. The method of claim 36, wherein the steps of generating identifier codes comprise selecting, by means of a keyboard, indicia corresponding to the phonetic spelling of a character to be typed.
38. The method of claim 37 wherein said symbolic language is Chinese and wherein said phonetic spelling comprises pinyin.
39. The method of claim 36 wherein the steps of generating identifier codes comprise selecting, by means of a keyboard, indicia corresponding to graphic stroke configurations at the periphery of a character to be typed.
40. The method of claim 39 wherein said keyboard-selected indicia comprise shape identifiers typifying actual stroke configurations found at the periphery of graphic char-acters to be typed.
41. The method of claim 36 wherein the steps of generating identifier codes comprise selecting, by means of a keyboard, first indicia corresponding to graphic stroke configurations at the periphery of a character to be typed or second indicia corresponding to the phonetic spelling of a character to be typed.
42. The method of claim 36 wherein the step of disambiguating said called-up characters comprises, for a single-character word in said symbolic language, sequentially displaying said called-up characters in a predetermined order, and selecting from said displayed characters the character to be typed.
43. The method of claim 42 wherein the step of disambiguating said called-up characters comprises, for a compound word in said symbolic language, matching each of said called-up characters corresponding to said first iden-tifier code with each of said called-up characters corres-ponding to said second identifier code to produce a list of possible character pairs; and comparing each of said possible character pairs with said permitted pairing lists to identify significant character pairs which appear on both said pos-sible character pairs list and said permitted pairing lists.
44. The method of claim 43 wherein the step of disambiguating said called-up characters further comprises displaying said significant character pairs and selecting one of said significant pairs.

Inputs:
Terminal input line (accessed vis PARSE) Chiuese character identifier data base (accessed via READAT
Outputs:
List of telegraph codes of chosen Chinese characters (returned in TCDS) Number of telegraph codes so returned (returned in PNIDN) Error code (0 => success; -1 => failure) (returned as function result) FUNCTION PICK(TCDS, PNIDN) IMPLICT INTEGER (A-Z) INTEGER PICKS(2, 64), RITS(10), TCDS(1) LOGICAL*1 IDENT(22) COMMON / 10PAR / RFPAR(7, 3), BLIST(3, 4), CHIDN
COMMON / LEX / LEXPTR, LEXBUF(41), MSCBUF(41), CURSOR(10), 1 CPFBUF(1024) COMMON / BTREE / KEYMAX, KEYMID, KEYBUF, KEYPTR, LEVEL, LBLK(5), 1 LPTR(5), SBUF(256), 4) COMMON / IDATA / BPTR, TCBUF(200) COMMON / DISP / NCPL, NTBL, NLAB, NLQB, TDBLEN, TBDSTR, TBDEND.
1 TBSTRT, ABSTRT, TISTRT, QBSTRT, CSIZE, CSPACE, XPOS(3), 1 YPOS(3) COMMON / EDPAR / TBPTR, TBEND, TBLEN, ABPTR, ABLEN, QBLEN, 1 TBUF(1024), ABUF(128), QBUF(32), MODE
COMMON / IDATA / NKDATA, KNEXT(2), KNEXTB, KROOT, KNUM, KNUMD, 1 KDB(5), KDLM(5), KDLA(5), KTTL(32) INITIALIZE # OF IDENTIFIERS. DATA POINTER, FUNCTION RESULT

NIDN = 0 DPTR = 1 PICK = -1 GET NEXT IDENTIFIER
CALL PARSE(IDENT, CODE) EOL OK
COTO (36, 20), CODE
GOT ONE: ERROR IF TOO MANY. READ THE DATA FOR THIS IDENTIFIER
INTO 'TCBUF'. ERROR IF IDENTIFIER NOT FOUND.
IF (NIDM ,EQ. MXIDN)GOTO 23 IF (READAT(IDENT) ,LT. 0) GOTO 13 NIDN = NIDN + 1 CHECH FOR FORMAT CONTROL IDENTIFIER
IF (IDENT(1) ,EQ. '.') GOTO200 NO MORE IDENTIFIERS: PERFORM DISAMBIGUATION.
INIT CHARACTER POINTER, HIT POINTER, BUFFER END POINTERS, IDENTIFIER
# 1 DATA POINTER.
CPTR = 0 HPTR = 0 END1 = TCBUF(1) + 1 END2 = END1 + TCBUF(END1) PTR1 = 8 LOOP TO STEP THROUGH ALL POSSIBLE TC'S FOR FIRST IDENTIFIER.
IF (PTRI .GE. END1) GOTO 110 NWD1 = TCBUF(PTR1) PSTRT = PTR1 + 2 PEND = PTR1 + NWD1 -1 62 TC1 = TCBUF(PTR1 +1) IF (NIDN .CT. 1) GOTO 50 ONLY 1 IDENTIFIER WAS ENTERED; NO POSSIBILITY FOR DISAMBIGUATION
EXISTS: RECORD TC AS A POSSIBILITY.
IF (CPTR .EQ. MXPICK) GOTO 33 CPTR = CPTR + 1 PICKS (1, CPTR) = TC1 MORE THAN ONE IDENTIFIER WAS ENTERED: RECORD POSSIBLE PAIRS.
PTR2 = END1 + 7 IF (PTR2 .CE. END2) GOTO 100 NWD2 = TCBUF(PTR2) TC2 = TCBUF(PTR2 + 1) IF (CPTR .EQ. MXPICK) GOTO 33 CPTR = CPTR + 1 PICKS(1, CPTR) = TC1 PICKS(2, CPTR) = TC2 IF (PSTRT .CT. PEND) GOTO 90 THIS TC HAS PAIRINGS; DISAMBIGUATION IS POSSIBLE: SEARCH FOR HITS.
DO 70 1 = PSTRT, PEND
IF (TCBUF(1) .EQ. TC2) GOTO 80 CONTINUE

GOT A HIT: RECORD THE PAIR

HPTR = HPTR + 1 HITS(HPTR) = CPTR
PTR2 = PTR2 + NWB2 PTR1 = PTR1 + NWD1 ARRAY PICKS(2, CPTR) CONTAINS THE TELEGRAPH CODES OF ALL POSSIBLE
COMBINATIONS OF CHARACTERS SATISFYING THE ONE OR TWO IDENTIFIERS
ENTERED. ARRAY HITS'HPTR) CONTAINS POINTERS TO THE PAIRS WHICH WERE
GRAMMATICALLY INDICATED.
NPOS = CPTR
NHITS = BPTR
IF EXACTLY ONE POSSIBILITY, THEN DONE.
IF (NPOS .NE. 1) GOTO 120 NC = 1 IF NO HITS:
TRY FIRST POSSIBILITY
IF (NHITS .NE. 0) GOTO 140 NC = QUERY(PICKS, 0, 1, NIDN) IF (NC .CT. 0) GOTO 160 THAT'S NOT IT: ELIMINATE IT & TRY THE REST
PICKS(1, 1) = 0 NC = QUERY(ICKS, 0, NPOS, NIDN) IF (NC .?T. 0) GOTO 999 GOT A HIT:
DONE IF ONLY ONE
IF (NHITS .NE. 1) GOTO150 NC = HITS(1) TRY FIRST POSSIBLE HIT
NC = QUERY(PICKS, HITS, 1, NIDN) IF (NC .GT. 0) GOTO 160 THAT'S NOT IT; ELIMANATE IT & TRY THE REST

PICKS(1, HITS(1)) = 0 NC = QUERY(PICKS, HITS, NHITS, NIDN) IF (NC .LT. 0) GOTO 999 FORMAT CONTROL IDENTIFIER: GET ARGUMENT IF ANY.
ARC = 1 1DF,FAULT = 1 CALL PARSE(IDENT, CODE) GOTO (220, 210), CODE
ARC = VAL(IDENT) IF ((ARC .AND. "177400) .NE. 0) GOTO 53 ERROR IF NON-UNIQUE TO OR TC OUT OF RANGE.

IF (TCBUF(1) .NE. 9 .OR. TCDUF .NE. 2) GOTO 43 TCI = TCBUF(9) - 10100 IF ((TCI .AND. "177700) .NE. 0) GOTO 43 CREATE SPECIAL PSEUDO TC. FORMAT: 01FFFFFFAAAAAAAA
WHERE F IS FORMAT CONTROL FUNCTION CODE (TC - 10100) AND A IS ARGUMENT.
PICKS(1, 1) = "40000 + TCI * "400 + ARG
NC = 1 RETURN THE PROPER TELEGRAPH CODE(S) & NUMBER THEREOF; SET SUCCESS FLAG
DO 170 1 = 1, NIDN
TCDS(1) = PICKS(1, NC) CONTINUE
PNIDN = NIDN
PICK = 0 RETURN
ERRORS
IDENTIFIER NOT FOUND: BEEP HIM SO THAT HE WILL LOOK UP AND
SEE THE MESSAGE.
IF (ITTOUR(7) ,LT, 0) GOTO 13 CALL SCOPY('Identifier not found', MSCBUF) CALL SCOPY('Too many identifiers', MSCBUF) CALL SCOPY('Too many possibilities', MSCBUF) CALL SCOPO('Bad format control data', MSCBUF) CALL SCOPY('Format control argument out of range', MSCBUF) END
CA000363994A 1979-11-06 1980-11-05 Electronic keyboard system and method for reproducing selected symbolic language characters Expired CA1149963A (en)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US9186279A 1979-11-06 1979-11-06
US091,862 1979-11-06
US188,030 1980-09-26
US06/188,030 US4679951A (en) 1979-11-06 1980-09-26 Electronic keyboard system and method for reproducing selected symbolic language characters

Publications (1)

Publication Number Publication Date
CA1149963A true CA1149963A (en) 1983-07-12

Family

ID=26784411

Family Applications (1)

Application Number Title Priority Date Filing Date
CA000363994A Expired CA1149963A (en) 1979-11-06 1980-11-05 Electronic keyboard system and method for reproducing selected symbolic language characters

Country Status (8)

Country Link
US (1) US4679951A (en)
EP (1) EP0028533B1 (en)
KR (1) KR840002409B1 (en)
CA (1) CA1149963A (en)
DE (1) DE3071123D1 (en)
GB (1) GB2062916B (en)
HK (1) HK76684A (en)
SG (1) SG35884G (en)

Families Citing this family (64)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE3373372D1 (en) * 1982-02-25 1987-10-08 James E Bock Interactive chinese typewriter
US4500872A (en) * 1982-03-18 1985-02-19 Dai-E Systems, Inc. Method for encoding Chinese characters
DE3214362A1 (en) * 1982-04-20 1983-10-20 Olympia Werke Ag CIRCUIT ARRANGEMENT IN WRITING OR SIMILAR MACHINES WITH A LARGE CHARACTER OF CHARACTERS
GB2128787A (en) * 1982-10-20 1984-05-02 Ejgil Otto Kaj Griese A method of printing or otherwise mechanically producing composite characters, such as Chinese characters
US4674066A (en) * 1983-02-18 1987-06-16 Houghton Mifflin Company Textual database system using skeletonization and phonetic replacement to retrieve words matching or similar to query words
US4771401A (en) * 1983-02-18 1988-09-13 Houghton Mifflin Company Apparatus and method for linguistic expression processing
US4580241A (en) * 1983-02-18 1986-04-01 Houghton Mifflin Company Graphic word spelling correction using automated dictionary comparisons with phonetic skeletons
US4544276A (en) * 1983-03-21 1985-10-01 Cornell Research Foundation, Inc. Method and apparatus for typing Japanese text using multiple systems
GB2161004A (en) * 1984-04-12 1986-01-02 Li Jin Kai System for encoding characters
US4783758A (en) * 1985-02-05 1988-11-08 Houghton Mifflin Company Automated word substitution using numerical rankings of structural disparity between misspelled words & candidate substitution words
JPS61217871A (en) * 1985-03-25 1986-09-27 Toshiba Corp Translation processor
CN1003890B (en) * 1985-04-01 1989-04-12 安子介 An zijie's character shape coding method and keyboard for computer
JP2848593B2 (en) * 1985-05-07 1999-01-20 株式会社東芝 Translation processing method
US5131766A (en) * 1985-12-26 1992-07-21 Wong Kam Fu Method for encoding chinese alphabetic characters
US4951202A (en) * 1986-05-19 1990-08-21 Yan Miin J Oriental language processing system
US4829472A (en) * 1986-10-20 1989-05-09 Microlytics, Inc. Spelling check module
US5109352A (en) * 1988-08-09 1992-04-28 Dell Robert B O System for encoding a collection of ideographic characters
WO1990002992A1 (en) * 1988-09-05 1990-03-22 Ronald Howard Thomas Symbol definition apparatus
US5047932A (en) * 1988-12-29 1991-09-10 Talent Laboratory, Inc. Method for coding the input of Chinese characters from a keyboard according to the first phonetic symbols and tones thereof
US5448474A (en) * 1993-03-03 1995-09-05 International Business Machines Corporation Method for isolation of Chinese words from connected Chinese text
US5410306A (en) * 1993-10-27 1995-04-25 Ye; Liana X. Chinese phrasal stepcode
US6903723B1 (en) 1995-03-27 2005-06-07 Donald K. Forest Data entry method and apparatus
US6160536A (en) * 1995-03-27 2000-12-12 Forest; Donald K. Dwell time indication method and apparatus
US6005549A (en) * 1995-07-24 1999-12-21 Forest; Donald K. User interface method and apparatus
US5999895A (en) * 1995-07-24 1999-12-07 Forest; Donald K. Sound operated menu method and apparatus
US5778361A (en) * 1995-09-29 1998-07-07 Microsoft Corporation Method and system for fast indexing and searching of text in compound-word languages
US8938688B2 (en) 1998-12-04 2015-01-20 Nuance Communications, Inc. Contextual prediction of user words and user actions
US7712053B2 (en) 1998-12-04 2010-05-04 Tegic Communications, Inc. Explicit character filtering of ambiguous text entry
USRE43082E1 (en) 1998-12-10 2012-01-10 Eatoni Ergonomics, Inc. Touch-typable devices based on ambiguous codes and methods to design such devices
US20030006956A1 (en) * 1999-05-24 2003-01-09 Charles Yimin Wu Data entry device recording input in two dimensions
HK1023263A2 (en) * 1999-07-28 2000-07-28 Qcode Information Technology Ltd Chinese character input method and device
EP1226653A4 (en) * 1999-10-21 2006-10-04 Hee-Sung Chung Method for generating characters and/or symbols and the information and communication service method thereby
US20100122164A1 (en) * 1999-12-03 2010-05-13 Tegic Communications, Inc. Contextual prediction of user words and user actions
JP2001166868A (en) * 1999-12-08 2001-06-22 Matsushita Electric Ind Co Ltd Method and device for inputting chinese pin-yin by numeric key pad
US7107204B1 (en) * 2000-04-24 2006-09-12 Microsoft Corporation Computer-aided writing system and method with cross-language writing wizard
US6692170B2 (en) 2001-02-21 2004-02-17 Eli Abir Method and apparatus for text input
US20030030573A1 (en) * 2001-04-09 2003-02-13 Ure Michael J. Morphology-based text entry system
GB0115822D0 (en) * 2001-06-28 2001-08-22 Koninkl Philips Electronics Nv Data input device
US7761175B2 (en) 2001-09-27 2010-07-20 Eatoni Ergonomics, Inc. Method and apparatus for discoverable input of symbols on a reduced keypad
US7174288B2 (en) * 2002-05-08 2007-02-06 Microsoft Corporation Multi-modal entry of ideogrammatic languages
US8583440B2 (en) * 2002-06-20 2013-11-12 Tegic Communications, Inc. Apparatus and method for providing visual indication of character ambiguity during text entry
US7395203B2 (en) * 2003-07-30 2008-07-01 Tegic Communications, Inc. System and method for disambiguating phonetic input
US20050027534A1 (en) * 2003-07-30 2005-02-03 Meurs Pim Van Phonetic and stroke input methods of Chinese characters and phrases
US8200865B2 (en) * 2003-09-11 2012-06-12 Eatoni Ergonomics, Inc. Efficient method and apparatus for text entry based on trigger sequences
US7359850B2 (en) * 2003-09-26 2008-04-15 Chai David T Spelling and encoding method for ideographic symbols
US7636083B2 (en) * 2004-02-20 2009-12-22 Tegic Communications, Inc. Method and apparatus for text input in various languages
US8095364B2 (en) 2004-06-02 2012-01-10 Tegic Communications, Inc. Multimodal disambiguation of speech recognition
US20080138135A1 (en) * 2005-01-27 2008-06-12 Howard Andrew Gutowitz Typability Optimized Ambiguous Keyboards With Reduced Distortion
US7525534B2 (en) 2005-03-14 2009-04-28 Palm, Inc. Small form-factor keypad for mobile computing devices
US7511700B2 (en) 2005-03-14 2009-03-31 Palm, Inc. Device and technique for assigning different inputs to keys on a keypad
US9142369B2 (en) 2005-03-14 2015-09-22 Qualcomm Incorporated Stack assembly for implementing keypads on mobile computing devices
US7623118B2 (en) 2005-03-14 2009-11-24 Palm, Inc. Actuation mechanism for use with keyboards on mobile computing devices
US7366984B2 (en) * 2005-07-29 2008-04-29 Microsoft Corporation Phonetic searching using multiple readings
US7294802B2 (en) 2005-08-13 2007-11-13 Palm, Inc. Lighting and usability features for key structures and keypads on computing devices
US7275836B2 (en) 2005-08-13 2007-10-02 Palm, Inc. Lighting and usability features for key structures and keypads on computing devices
US7698128B2 (en) * 2006-01-13 2010-04-13 Research In Motion Limited Handheld electronic device and method for disambiguation of compound text input and that employs N-gram data to limit generation of low-probability compound language solutions
US7259339B1 (en) 2006-09-08 2007-08-21 Palm, Inc. Enhanced key structure with combined keycap for a mobile computing device
US8989822B2 (en) 2006-09-08 2015-03-24 Qualcomm Incorporated Keypad assembly for use on a contoured surface of a mobile computing device
US20090048837A1 (en) * 2007-08-14 2009-02-19 Ling Ju Su Phonetic tone mark system and method thereof
US8350728B2 (en) 2010-04-23 2013-01-08 Hewlett-Packard Development Company, L.P. Keyboard with integrated and numeric keypad
TWI525606B (en) * 2014-06-05 2016-03-11 和碩聯合科技股份有限公司 Information supply method and system and word string supply system
US9886433B2 (en) * 2015-10-13 2018-02-06 Lenovo (Singapore) Pte. Ltd. Detecting logograms using multiple inputs
GB2572386B (en) * 2018-03-28 2021-05-19 Canon Europa Nv An image processing system and an image processing method
TWD201178S (en) * 2018-11-14 2019-12-01 東隆五金工業股份有限公司 handle

Family Cites Families (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US1204326A (en) * 1915-02-08 1916-11-07 Underwood Typewriter Co Type-writing machine.
US1600494A (en) * 1924-12-04 1926-09-21 Underwood Typewriter Co Typewriting machine
US1687939A (en) * 1927-05-19 1928-10-16 Remington Typewriter Co Typewriting machine
US2471807A (en) * 1945-08-02 1949-05-31 Yen Tisheng Typewriter for writing the chinese language
US2613795A (en) * 1946-04-17 1952-10-14 Mergenthaler Linotype Gmbh Chinese typewriter
US3325786A (en) * 1964-06-02 1967-06-13 Rca Corp Machine for composing ideographs
US3541511A (en) * 1966-10-31 1970-11-17 Tokyo Shibaura Electric Co Apparatus for recognising a pattern
US3665450A (en) * 1968-07-02 1972-05-23 Leo Stanger Method and means for encoding and decoding ideographic characters
US3631956A (en) * 1969-02-27 1972-01-04 Hyon Kyu Choi Multiple language typewriter with logogram capability
US3651461A (en) * 1970-04-17 1972-03-21 Recognition Equipment Inc Center referenced character identification
US3809204A (en) * 1971-12-27 1974-05-07 Yamura Shinkoseisakusho Kk Keyboard system for chinese character teleprinter, chinese character typewriter, monotype etc.
US3809203A (en) * 1972-01-31 1974-05-07 Yamura Shinkoseisakusho Kk Chinese character (kanji) teleprinter or a chinese character (kanji) punching typewriter or similar apparatus
US3820644A (en) * 1972-02-10 1974-06-28 Chan H Yeh System for the electronic data processing of chinese characters
US3950734A (en) * 1973-08-16 1976-04-13 Li Tzu Hung Language processing system
JPS547416B2 (en) * 1973-09-25 1979-04-06
JPS5440176B2 (en) * 1973-11-05 1979-12-01
JPS5537786B2 (en) * 1973-11-08 1980-09-30
AU503345B2 (en) * 1975-07-08 1979-08-30 M Macaulay Electronic communication terminal
JPS5215235A (en) * 1975-07-26 1977-02-04 Fujitsu Ltd Character recognition unit
US4096934A (en) * 1975-10-15 1978-06-27 Philip George Kirmser Method and apparatus for reproducing desired ideographs
US4079482A (en) * 1976-05-27 1978-03-21 Yeh Chan H Electronic data processing of Chinese characters
IT1071811B (en) * 1976-11-03 1985-04-10 Olivetti & Co Spa DEVICE FOR DISPLAYING OR PRINTING TEXTS IN CHARACTERS OF AN ALPHABET OF THE ARABIC LANGUAGE GROUP
US4193119A (en) * 1977-03-25 1980-03-11 Xerox Corporation Apparatus for assisting in the transposition of foreign language text
US4144405A (en) * 1977-08-05 1979-03-13 Shuichi Wakamatsu Character writing system
GB2033633B (en) * 1978-10-03 1982-05-19 Pok Fun Ng Ideographic coding

Also Published As

Publication number Publication date
GB2062916B (en) 1984-02-08
KR840002409B1 (en) 1984-12-27
SG35884G (en) 1985-03-08
EP0028533A3 (en) 1982-12-29
EP0028533B1 (en) 1985-09-25
US4679951A (en) 1987-07-14
EP0028533A2 (en) 1981-05-13
DE3071123D1 (en) 1985-10-31
GB2062916A (en) 1981-05-28
HK76684A (en) 1984-10-19

Similar Documents

Publication Publication Date Title
CA1149963A (en) Electronic keyboard system and method for reproducing selected symbolic language characters
US4379288A (en) Means for encoding ideographic characters
EP0089468B1 (en) Abbreviated typing with special form display
US4498143A (en) Method of and apparatus for forming ideograms
US5187480A (en) Symbol definition apparatus
US5109352A (en) System for encoding a collection of ideographic characters
US4505602A (en) Method for encoding ideographic characters
US7420543B2 (en) User-friendly Brahmi-derived Hindi keyboard
US4602878A (en) Ideographic word processor
US4698758A (en) Method of selecting and reproducing language characters
US4096934A (en) Method and apparatus for reproducing desired ideographs
US4868913A (en) System of encoding chinese characters according to their patterns and accompanying keyboard for electronic computer
JPS61502495A (en) Cryptographic analysis device
US5378068A (en) Word processor for generating Chinese characters
EP0087871B1 (en) Interactive chinese typewriter
KR860001012B1 (en) Ideographic coder
GB2076572A (en) Ideographic characters encoding
Lu Computers and Chinese writing systems
CA1172335A (en) Means for encoding ideographic characters
DeFrancis How efficient is the Chinese writing system?
JPS5852784A (en) Handwriting typewriter
KR910007745B1 (en) Method for selecting flat characters
Morita Japanese character input: its state and problems
JPH06223221A (en) Character recognizing device
Kanai et al. An OCR-oriented Overview of Ideographic Writing Systems

Legal Events

Date Code Title Description
MKEX Expiry