KR20000053095A - Method for converting non-phonetic characters into surrogate words for inputting into a computer - Google Patents

Abstract

PURPOSE: A method for converting nonphonetic characters representing vocabulary in languages into surrogate words for inputting into a computer is provided for incorporating the voice recognizing and generating technology into computers processing information in the oriental languages. CONSTITUTION: A method for converting non-phonetic characters representing vocabulary in languages into surrogate words for inputting into a computer includes the steps of alphabetizing a pictographic/ideographic radical of each character according to its pronunciation in a respective language, with the resulting spelling then being used as a prefix for a newly created surrogate word; alphabetizing a phonetic radical according to its pronunciation in the respective language, with the resulting spelling then being used as a suffix for the newly created surrogate word; and combining the prefix and suffix together and separate them with a separate mark such as a hyphen, thus creating the surrogate word for each specific character used in the written form of the respective language.

Description

How to convert non-voice characters to substitute words for input to a computer {METHOD FOR CONVERTING NON-PHONETIC CHARACTERS INTO SURROGATE WORDS FOR INPUTTING INTO A COMPUTER}

Chinese nonspoken characters were derived from paintings to express themselves by ancient Chinese thousands of years ago. These letters have changed over time from the paintings of ancient times to the uniform squares of today. Koreans and Japanese applied and incorporated Chinese into their language, even though they could not pronounce or use all letters in the same way that the Chinese did. Most of the letters used by the people of both countries have the same or similar meanings as they did in Chinese. Today, most letters are made up of two parts. In other words, one generally defines the meaning in which this part is quoted as a descriptive letter, and the other defines the pronunciation generally quoted as a phonetic root. In Chinese, the pronunciation of a letter is a syllable, which means one note for each letter.

A ideograph is a letter or symbol that can be part of a letter that infers the meaning of the letter by reasoning. Pure ideograms are rare. However, the pure letters could be found in many letters that do not have phonetic roots and instead have two or more glyphs combined to infer meaning understandable by the reader. The pronunciation of these letters had to be remembered because there was no phonetic root in these letters. When a ideograph is used as the root of a letter, it is not pronounced. The following is an example of a ideogram.

(1) 明 consists of sun, day, moon, month, and therefore it means brightness. (2) 艶 consists of abundance, richness, color, and color, and therefore means that it is noticeably beautiful. (3) The preference consists of son, 子, daughter, 女, and therefore means good. (4) 細 consists of silk, 絲, and small square rice fields, 田, and therefore means small and thin. (5) 林 consists of two trees, 木, and therefore means forest.

Shape letters are letters or symbols that are part of a letter that are approximately similar to the object of the described letter. Shape letters are more common than ideograms because Chinese characters evolved from pictures. When a glyph is used as part of a character, it is not pronounced. For example, 새 for birds, 馬 for horses, and 木 for forests and trees.

The shape letter not only has the meaning of the character that it is part of the document, but also indicates the meaning by showing the physical similarity of the object of the described character. This makes text easy to recognize and understand.

The root is part of the letter. There are usually two kinds of roots in letters. One defines the meaning and the other the pronunciation of the letter. The former is known as a figure or ideogram that depends on the shape or what it represents. When it does not resemble something and has meaning derived from other uses or from inference, it is called a ideogram. Table characters are not pronounced when they are pronounced and are silenced. Another kind of root is known as a phonetic root with actual or rough pronunciation of the character and is thus pronounced.

Occasionally, the letters (1) 嫁, from 稼 to 家, (2) 飄, 漂, Can be used as a root, such as These kinds of roots are most commonly used as voice roots. Very often, the root can be used as a letter such as 女, 子, 木.

Another unique feature in colloquial Chinese is that there are four ways to pronounce a given voice, namely four accents. There are about 1,544 combinations of pronunciation and intonation in Chinese. This compares with 13,200 commonly used characters. Theoretically speaking, each pronunciation / inspiration combination represents about 8 to 9 letters. Indeed, many pronunciation / intonation combinations are not used properly or at all. Moreover, Chinese people seem to abuse some of the combinations such as ji, qi and xi. This inconsistent use results in the problem that some combination represents more than 50 characters. Applicants call this phenomenon transient, which has the problem that it is very difficult for Oriental languages (including Chinese, Japanese, Korean and Indian) to computerize in their original form.

For example, with the same application / intonation combination of ji There are 99 Chinese characters. with the same pronunciation / intonation combination of qi There are 69 Chinese characters. with the same pronunciation and intonation combination of xi There are 67 Chinese characters.

At present, Asian languages such as Chinese, Japanese, Korean and Indo have used thousands of characters in contact with the 26 alphabets of English, and therefore computerization of such oriental languages is a real problem. Obviously, it is absolutely impossible to have a typewriter keyboard with thousands of keys. Therefore, entering Asian characters into a computer or word processor is a very difficult task.

In general, there are two systems of computer input of Oriental languages: the "shape" system and the "speech" system. The "shape" system, such as the "CHANGJEI" or "DA YI" input system for China, represents a number of shape symbols depending on the shape of the root of the letter, and each combination of shape symbols represents a single letter. The drawback of the "shape" system is that it is really difficult to learn and use. The user must study a special way of distributing each letter to a given shape symbol and memorize thousands of shape symbols representing different characters. Although configuration systems allow users to accurately enter special characters into a computer or word processor, only a few skilled practitioners, such as specialized and trained professional typists, can use these "geometry" systems. The average person cannot enter even one character by using the "shape" system. In addition, the learning process of the "shape" system is complex enough that most business people cannot take enough time to memorize all the input codes of the "shape" system. In other words, the "shape" system is designed for people whose careers are only computer data typists. Moreover, the "shape" system inputs and stores each character by two bytes. However, during electronic transmission such as E-mail, the transmission unit is only a single byte, so that any information or data input by the "shape" scheme is not possible via E-mail via the Internet. In other words, Asians whose text language is not phonetic characters such as English have no opportunity to enjoy the convenience of E-mail and the Internet.

As shown in FIG. 1, a "speech" system, such as "PIN YIN" or "ZHUYIN" input system for China, allows a user to use Chinese consonants and vowels or zhuyin zimu. Typing the Latin alphabet appropriate for presentation allows the computer to enter the pronunciation of the letter. Basically, pin yin is a Chinese pronunciation for spelling. The term here implies "spelling in the Latin alphabet." The Chinese Pinyin System is a draft plan of the Chinese language voice spelling proclaimed by the Chinese Character Reform Commission in February 1956. These alphabets are listed along the note sign in FIG. Zhuyin includes 36 Chinese characters with very few strokes selected by the Chinese Board of Education in the spring of 1913 to represent the consonants and vowels of the Chinese language. Zhuyin is also commonly used in Taiwan to teach the pronunciation of Chinese characters. However, in mainland China, the Chinese Pinyin system replaces the Zhuyin code. See FIGS. 1 and 4.

As mentioned above, in Oriental languages, it is quite common for many different letters to have the same pronunciation. That is, a single set of Chinese Pinyin or Zhuyin code may represent a number of different characters. Therefore, after a set of Chinese Pinyin or Zhuyin codes are keyed in, the "PIN YIN" or "ZHUYIN ZIMU" scheme will provide many characters for the user to select the correct character from it. For example, the pinyin of "及" is "ji". Therefore, when the user key-in the letter "及" meaning "and", the user can key-in the letters j and i. However, sharing the same pronunciation / intonation combination of ji, There are 99 Chinese characters. The user has to find the correct letter "及" again from the 99 homonyms displayed on the computer screen. Obviously, both the "PIN YIN" and "ZHUYIN ZIMU" systems are too cumbersome and impractical. Moreover, for the above reasons, neither the "PIN YIN" nor the "ZHUYIN ZIMU" schemes are suitable for sending via e-mail.

Currently, the most efficient and widely used tool for transmitting information is e-mail. Large amounts of data and information can be sent directly to the world. People can send or get unlimited information and knowledge directly via e-mail. However, countries and people who speak Oriental languages have not found any input method suitable for E-mail. This unresolved situation can be very disruptive to cultural and commercial development between Asia and Western societies.

Moreover, for thousands of years, Chinese culture has produced so many idioms and proverbs that are quoted daily by millions of people throughout East Asia and other places where Chinese, Japanese and Korean languages are spoken. It would be beneficial for computer users to regularly process one of these languages in order to have a fast and accurate means to input such frequently quoted phrases and sentences into the computer.

Existing methods for inputting commonly used phrases and sentences written in Chinese or Kanji characters include the following steps; In other words

(1) marking Chinese or Kanji characters with alphabets according to the pronunciation of each language, and

(2) Type the first alphabet of spelling of the phrase of each Chinese or Kanji character to form an acronym on the keyboard of a computer with software capable of interpreting acronyms and to display the corresponding Chinese characters. It consists of steps.

This method works well when the pronunciation of the phrase is unique, but in real life, it contains many phrases, especially four or fewer letters with the same pronunciation. To compensate for the majority of homonyms, software engineers design their programs so that they can display Chinese text at the bottom of the typist screen to choose what they want. If no phrase or phrase is desired, the typist can call up the next phrase or phrase until the desired one is found by hitting the arrow key down. This search or selection process can make existing methods cumbersome, time consuming and sometimes fail.

Thus, the learning and memorization of Chinese or Kanji characters is inefficient so that even the fourth grade students in China or Taiwan cannot express themselves clearly in Chinese characters. This is highly criticized for the "complexity" of Chinese characters, and the public has accepted this theory for thousands of years. This situation can be dramatically improved with visual, auditory or multimedia tools to facilitate the learning process and to reinforce what has already been learned.

The present invention relates to non-spoken characters in oriental languages such as Chinese, Japanese, Korean, Indo, and the like, and more particularly, to a conversion method for generating a new surrogate word to accurately represent non-spoken characters used in a character oriental language. In this conversion method, the surrogate word is a word generated in the English style or its own alphabet in the present invention to represent non-speech characters used in Chinese, Japanese, and Korean. Thus, non-voice characters can easily be entered into a computer through an English style or their own alphabetic keyboard, mouse, or other voice input method. Moreover, these new surrogate words can be stored on a computer and transmitted correctly by e-mail (e-mail).

1 is a chart for explaining the Pinyin alphabet and the Zhuyin sign.

2 is a chart for Katagaka, Hiragana and their English notation.

3 is a chart for Korean and their English notation.

4-1 through 4-11 are charts illustrating spelled surrogate prefixes for 214 p / i roots and each p / i root in Chinese, with surrogate prefixes of various systems in written pronunciation, habitual pronunciation, and computer. It can be obtained by the outline special keys (in Pinyin alphabet and the main phonetic sign) for input, and some outline option keys for computer input.

5 is a chart illustrating a number of Chinese characters having the same pronunciation of ji, each letter accurately represented by a unique surrogate word achieved by the three step switching method of the present invention.

6 is a chart illustrating five steps used to convert Chinese characters into surrogate words of English alphabets and main phone numbers according to the present invention.

7 is a chart illustrating the five steps used to convert Japanese characters into English alphabets and alternative words of Katakana and Hiragana in accordance with the present invention.

8 is a chart illustrating five steps used to convert Korean characters into English alphabets and surrogate words in accordance with the present invention.

9 is a chart illustrating changes in the alphabet used in the Pinyin system in accordance with the present invention.

10 is a chart illustrating the steps used to convert a Chinese phrase into a substitute phrase for an English alphabet in accordance with the present invention.

FIG. 11 is a chart illustrating the steps used to convert a Chinese phrase into a substitute phrase for a main note in accordance with the present invention.

12 is a chart illustrating the steps used to convert a phrase of a Chinese character used by a Japanese phrase into an alternate phrase of the English alphabet, Hiragana and Katakana in accordance with the present invention.

13 is a chart illustrating the steps used to convert a phrase of a Chinese character used by a Korean phrase into an English alphabet and a substitute phrase of Korean according to the present invention.

14 is a chart illustrating how shape / target roots can be described visually.

It is a main object of the present invention to provide a method for specially converting non-speech characters representing vocabulary in a language into alternative words for input into a computer. These newly formed alternative words are unique for non-speech characters used in character oriental languages such as Chinese, Japanese, Korean, and Indic, and can accurately represent non-speech characters, thus making it easier to enter information in these languages into a computer. .

Another object of the present invention is to specifically convert non-speech characters representing a vocabulary in a language into a substitute word for input to a computer, where the newly generated surrogate word is adapted to be transmitted via e-mail without any loss of information. To provide a way.

Another object of the present invention is to provide a method for specially converting non-speech characters representing a vocabulary in a language into a substitute word for inputting to a computer, which makes it possible to integrate speech recognition and generation techniques into computer processing information in an Oriental language. To provide.

Another object of the present invention is in the general method of training to understand the individual pronunciation of each word by means of a first prefix, followed by an indicator if applicable followed by a separator mark (hyphen), followed by a suffix, and possibly a marker. The present invention provides a method of specially converting non-speech characters representing a vocabulary in a language into alternative words for input into a computer, which can be constructed using a sound card and software. Of course, for the purposes of the above, the opposite combination may also be used until the hyphen or * is first, followed by the suffix, and the hyphen or asterisk (*) and then the ear prefix.

Another object of the present invention is a vocabulary in a language, in which a speech generating system having the same sound card and software capable of accurately pronouncing the suffix of the surrogate word can be read by a computer for the user to edit and print. It is to provide a method for specially converting a non-speech character that represents a substitute word for input to the computer. Thus, the user does not need the effort and time to check per document character for possible typing errors. This function can help those who can speak each non-speech language but can't write or read through the conversion method of the present invention to examine the document input to the computer.

It is yet another object of the present invention to provide a method for specially converting non-speech characters representing a vocabulary from a language into a substitute word for inputting to a computer, which allows western and eastern people to easily and accurately enter an Oriental language without any complicated learning process. To provide.

It is yet another object of the present invention to provide a method for specially converting non-speech characters representing a vocabulary in a language into alternative words for inputting into a computer, which facilitates computer input of phrases and sentences.

Another method of the present invention is a substitute word for inputting a non-voic character representing a vocabulary in a language to a computer, which is used to teach speaking, writing, and reading of a language having a non-speech character form using the theory and logic of the present invention. To provide a special way of switching.

It is still another object of the present invention to use a computer to generate non-vocabular characters that represent vocabulary in a language, using the shape / significant root as a prefix of a surrogate word that can make a way to help children memorize Chinese or Kanji characters. It is to provide a special method of converting into a substitute word for input to the.

Therefore, a method of specially converting non-speech characters representing a vocabulary in a language into alternative words for input into a computer includes the following steps, namely

(a) marking the shape / representative root of each letter in alphabetical order according to the pronunciation of each language, whereby the spelling formed is used as a prefix of a newly generated surrogate word;

(b) writing letters in alphabetical order according to the pronunciation of each language, whereby the spelling formed is used as a spelled prefix for the newly generated surrogate word; And

(c) combining the prefix and the suffix together to form a substitute word for a special “character” used in the form of a character of each language.

In order to distinguish the prefix from the suffix in the surrogate word in order to avoid any confusion to the user, step (c) is performed by a separate mark separating the prefix and the suffix with a separator mark such as a hyphen or a space inserted between the prefix and the suffix of the surrogate word. It further comprises a step.

For Chinese characters with accents, in the new surrogate word of China, the accent of the pronunciation of the prefix and the suffix is indicated by the selected consonant as an indicator.

For enhancement / capital letters with the same pronunciation and intonation, the last alphabet of spelling for a special shape / capital letter is repeated one, two or three times, and the repeated alphabet distinguishes between not representing the pronunciation of the root and not. In the same way as the extra alphabet.

When a new surrogate word is pronounced, the prefix is treated like a figure or ideogram that appears silent. Like the phonetic roots that appear, the suffix sounds. If the pronunciation of the Chinese prefix is unique, the indicator for intonation is exempt. Because the suffix sounds, the requirement for accuracy requires that the indicator for accent appear with the suffix at all times unless the intonation is the first of four.

Chinese, Japanese and Korean character forms derived from China, and Indian languages are made up of non-voice characters. The present invention provides a method for converting non-voice text into speech components by using existing or newly generated phonetic symbols. Phonetic symbols are visual signs that represent phonetic components, consonants, and vowels. They can be Latin or English alphabets and main alphabets, such as Katakana, Hiragana, Korean, etc. Phonetic symbols can be generated by specifying a set of signs to represent consonants, vowels, and intonations of a language.

The object of the conversion method of the present invention is to enable computerization of these languages. The phonetic symbols may be English alphabets, alphabets, katakana, hiragana, Hangul or Korean alphabets such as newly created signs or symbols. Each non-speech character is converted into a unique, newly spelled “substitute word” by the conversion method disclosed herein. The newly spelled alternative words can accurately represent the characters used in each language. See FIGS. 1, 2 and 3 for these phonetic symbols and FIGS. 6, 7 and 8 for spelled surrogate words consisting of these phonetic symbols. These three charts as shown in Figures 6,7 and 8 can be seen as a summary of the conversion method.

Generally speaking, each non-speech character, such as each typical Chinese character, defines the meaning or meaning of the character (quoted as "p / i root" in the following description) and the pronunciation or rough pronunciation of the character. It is made up of voice roots. There is only a 214 p / i root. In practice, the 214 p / i root can be correctly encoded by different 214 sets of codes to represent the corresponding p / i root. In Fig. 4, in fact, each p / i root has a special pronunciation, for example, the Chinese letters "西" pronounced as xi and "支" pronounced as zhi. That is, the substitute words "xi" and "zhi" represent the p / i roots "西" and "支", respectively.

It is even more possible to assign thousands of sets of codes as surrogate words to fully represent all non-voice characters of the Oriental language, for example Chinese. However, when done with the "shape" typography ("CHANGJEI" or "DA YI" for Chinese, mentioned in the context of the present invention), it is almost impossible for a normal, non-career user to memorize thousands of dissimilar codes. . In fact, before a person learns how to write, he learns how to speak. That is, learn how to pronounce letters in a sentence. Thus, pronunciation-induced alphabetization is one of the most familiar and logical ways to form letters. English uses a combination of 26 different alphabets to form all words in a language. Most Chinese characters provide a phonetic root as their main component.

Even in Chinese, Japanese, or Korean, homonyms are common in pronunciation of letters and roots. When two or more letters or roots share the same pronunciation or the same combination of pronunciation and intonation, they are called homonyms.

According to the invention, the letter is divided into two roots. Roots are represented alphabetically with prefixes and suffixes to form alternative words representing certain characters. However, as mentioned in the background of the present invention, most non-speech letters are homonyms that share the same pronunciation. The present invention provides a conversion method for generating a new surrogate word to accurately represent non-speech characters used in a character oriental language. This switching method completely solves the problem of homonyms, whereby non-speech characters are sequentially keyed into correspondingly generated surrogate words for the characters, thereby enabling the computer to operate using a conventional alphabetic keyboard, mouse or other non-speech input method. Can be easily entered in.

In Chinese, the most common phonetic systems of pronunciation for spelling are Pinyin, Zhuyin, and Yuyiin. Pinyin is a Chinese pronunciation of spelling. The term here implies "spelling with the Latin alphabet". Zhuyin contains 36 Chinese characters, each with a few strokes. They were chosen to represent consonants and vowels in the Chinese language, as shown in FIG. Music is the use of Pinyin for Cantonese dialect.

In Japanese, the most common phonetic system of pronunciation for spelling is hiragana and katakana, as shown in FIG. In the present invention, hiragana, which is treated as if it is a plurality, is a group of special Chinese characters applied by Japanese as consonants and vowels to define the pronunciation of a vocabulary derived from Japanese. Hiragana wrote a draft of Chinese characters. They are in the form of the Japanese alphabet. Katakana, which is treated as a plural in the present invention, is a group of special Chinese characters applied by Japanese as consonants and vowels to define the vocabulary derived from foreigners and the pronunciation of Chinese characters. Katakana resembles the shape of a printed character. In fact, Katakana is the Japanese alphabet.

Following Korean, as shown in Fig. 3, Korean is a symbol representing Korean consonants and vowels. They are actually quoted alphabetically by Korean people.

To convert non-speech characters representing the vocabulary of a language into alternative words for input into a computer, the following method is used.

Step 1. According to the pronunciation of each language, the shape / target root of each letter is written in alphabetical letters, and the spelling formed thereby is used as a prefix for the newly generated surrogate word.

For example, if an English alphabet is used, the following example illustrates how to p / i root of letters by spelling them according to their pronunciation in Chinese, Japanese, and Korean, respectively.

A. Chinese: 1. mu for 木 2. ma for 馬 3. nino for 4. 4. shui for water 5. xin for heart

B. Japanese: 1. ki for 木 2. uma for 馬 3. tori for 4. 4. sui or mizu for 水 5. sakana or uo for 魚

C. Korean: 1. mool or soo for 水 2. nahmooh or muk for 木 3. kim for 金 4. soon or soo for 手

Of course, it is worth mentioning that p / i roots can be expressed in many ways. One way is to assign a unique number to each p / i root. A total of 214 numbers for 214 p / i roots can be used instead of spelling. Another method is to use a combination key on the computer keyboard to indicate the number assigned to the root. For example, pressing one or both or both of Ctrl, Alt, and Shift and pressing any of the three popup keys can easily have 214 key combinations to represent all 214 p / i roots. Applicants believe that the phonetic representation is most familiar to the user of all methods because the majority of roots can be easily pronounced or spelled. No effort is needed to memorize numbers or keys.

Step 2. According to the pronunciation in each language, the phonetic root of each letter is represented by the alphabet, or when the letter does not have a phonetic root or when the phonetic root does not represent the actual pronunciation of the letter, the pronunciation of the letter is represented by the alphabet. The spelling thus formed is used as a suffix for the newly generated surrogate word.

For example, when the English alphabet is used, the following example illustrates how to voice the phonetic roots of letters by spelling according to the pronunciation of Chinese, Japanese, and Korean.

A. Chinese: 1. As in ya and 鴨, for ya ya, 牙 is the phonetic root of the letter 鴨 and 鴨 pronounces 牙 (ie ya). Also, 甲 is the phonetic root of the letter 이고 and 鴨 pronounces 甲 (ie ya). 2. mei for 美, 每, 眉, and 같이 as in 妹 3. qi for 奇 as in 騎

B. Japanese: 1. for 檢, 驗, and ken as in 涓 and ken ken 2. tsuru for 鶴 and 3. 3. As in, As in 圭, as in 貴 about kai.

C. Korean: 1. 巷 as in 港, 江 as in 江, 亢 as in 亢, and 岡 as in 2. 2. 兆 as in 兆, and 와 as in to .

Step 3. The prefixes and suffixes are combined together to produce a newly spelled surrogate word for each special "character" used in the character form of each language.

In order to input a substitute word representing non-vocabulary into the computer, the force tool bar is programmed to reside on the screen of the computer. The input tool bar contains two separate input windows, one input window is a prefix input window for keying into the alphabetized spelling of the surrogate word's prefix, and the other input window is an alphabetic spelling of the surrogate word's suffix. Suffix input window for key input. By entering the prefix and suffix of the substitute word into the prefix input window and the suffix input window, respectively, the substitute word is input to the computer for the characters that appear.

In order to distinguish the prefix from the suffix in the surrogate word to avoid any confusion to the user, the step 3 further includes a specific step of separating the prefix and the suffix by a separator such as a hyphen or an asterisk (*) inserted between the prefix and the suffix. do.

For example,

A. Chinese

1. mu-mei (letter 梅 pronunciation mei) for 梅, where p / i root is 木 pronunciation mu and voice root is 每 pronunciation mei.

2. niao-ya (letter 를 pronounces ya) for 鴉, where p / i root is the pronunciation of niao and voice root is the pronunciation of ya.

3. ma-qi (letter 발음 pronounces qi) for 騎, where p / i root is 馬 pronunciation ma and voice root is 奇 pronunciation qi.

B. Japanese: 1. ki-ken for 2. 2. uma-ken for 3. 3. sui-ken for 4. 4. tori-ken for 5. 5. kusa-tsuru for 6. 6. tori for 鶴-tsuru 7. About ki-kai 8. About sakana-kai 9. About su sui-kai

C. Korean: 1. mool-kang against 江 2. soo-kang against 3. 3. kim-kang against 4. 4. nahmooh-to against 6. 6. mool-to against 淘

By processing the above steps 1 to 3, a unique new spelled surrogate word is generated to accurately represent the special character. Alternative words generally include a prefix and a suffix combined by a separator, where the prefix is the spelling of the pronunciation of the p / i root of the letter and the suffix of the pronunciation of the phonetic root of the letter. When the user spells a substitute word, the user speaks a letter. That is, the Chinese, Japanese, or Korean people can easily and easily distinguish the surrogate word generated by the above steps of the present invention, even when writing the character.

However, if the special character entered is itself a p / i root such as 衣, 一, 言, 人, 土, 大, 口, 女, 力, etc., the user immediately enters the correct character after entering the prefix and the separator mark. You'll get it and you don't need to key in the suffix. In some cases, separation marks may be omitted.

From a Chinese point of view, even if a substitute word cannot be seen as the Chinese character of an octopus, it is 100% derived from the Chinese character. According to the three step transition process of the present invention, approximately 95% Chinese characters are correctly represented by the corresponding unique substitute word. In other words, when a user inputs a substitute word formed in three steps into a computer or word processor, a specific Chinese character is obtained correctly. Therefore, this conversion method significantly increases the input accuracy and input speed of Chinese characters. Moreover, because surrogate words are composed of alphabets and can accurately represent individual characters, non-phonetic characters such as Chinese, Japanese, and Korean can be used via e-mail without any confusion and loss of information. To be sent.

In general, many Chinese characters have the same pronunciation, for example the pronunciation yi has about 99 homonym characters. An important issue is that non-voice characters are difficult or impossible to process with a computer. As shown in Fig. 5, a list of Chinese homonym characters is shown, all of which pronounce ji. According to the present invention, the spelling of the pronunciation ji of the homonym phonetic letter as shown in FIG. 5 is converted into a suffix of a substitute word. Non-negative characters do not have the same characters, for example, because they have a common feature that each character has a different appearance, this characteristic is an important distinguishing factor of non-voice characters. In particular, even if two letters are pronounced the same, they have different p / i roots or are recorded differently as homologous roots. In other words, although they may be pronounced identically with the same p / i root, they have a finitely different shape, and as a result they will not be understood by the reader. Because of this, some people may frown that non-speech characters are visually inferior. The secret of classifying homonyms in visually inferior written languages is to make them appear different. Therefore, according to the present invention, the pronunciation of the p / i root of each homonym letter or the assigned alphabet or number code is used as the prefix of the surrogate word. The combination of individual marks, prefixes, and roots constitutes the entire spelled surrogate word that uniquely represents a character. As shown in Fig. 5, each homonym word character has a corresponding unique spelling substitution word, and thus a specific character can be obtained by inputting this substitution word into a computer or word processor.

Basically, the third step of the conversion method of the present invention can be accurately input into a computer by typing a unique surrogate word corresponding to about 50% of Chinese characters and 10 to 50% of Japanese and Korean characters. Of course, since many homonym characters are reduced to several characters, the user can simply select the required character from the display on the computer screen. The present invention has already shortened the selection time considerably to reduce the working time. The present invention provides two additional steps in addition to the three basic steps to form a unique surrogate word capable of expressing the remaining homonym characters 100% accurately. In other words, by going through all five steps of the present invention there will be no chance that any two characters will have the same surrogate word.

With respect to Chinese with accents, for a new surrogate word in Chinese, the pronunciation accents of prefixes and suffixes are represented by consonants selected as indicators. Therefore, the first additional step is performed before step 3 as already described. In a first additional step, for a newly spelled surrogate word for Chinese characters, the pronunciation accent of the prefix and suffix will be represented by consonants located at the end of the spelling. The first accent has no indicator. The second accent is the second Chinese consonant "p" for the Chinese pinyin alphabet and "for the zhuyin zimu". The third intonation is represented by the third consonant "m" for the Chinese Pinyin alphabet and " The fourth intonation is the fourth consonant "f" for the Chinese pinyin alphabet and the " Is indicated by ".

For example:

In Chinese, 1 About shi; 2 Against ship; 3 For shim; 4 About shif.

Therefore, for example Chinese characters About, its only substitute word is shui-mei. Here, its p / i root is 水 pronounced shui and the phonetic root is pronounced mei (Also pronounced as mei )to be.

It should be noted that in the Beijing Mandarin dialect, which is a recognized everyday Chinese conversation, consonants never appear after vowels except n or r according to the rules mentioned in the Chinese Pinyin system. Therefore, it is easy for the reader or typist to recognize three consonants (p, m, f) as indicators of intonation. It should be noted that the first additional step does not apply to Japanese and Korean, since such language does not have an accent in the form of everyday conversation. Basically, by performing the above four steps, approximately 98% of Chinese characters can be accurately represented by mapping them to specific surrogate words.

Since Chinese characters have very few hieroglyphic or ideographic characters with the same pronunciation and intonation, there are some extreme examples as shown in FIG. 6, where four homonym Chinese characters with the same pronunciation of shi are shown. . The second additional step is performed after step three. In a second additional step, a marker is added after the last alphabet of the surrogate word to represent the hieroglyphic or ideographic character, which is the next homonym that appears second in the index of the hieroglyph / table of the Chinese dictionary. The marker can be any key on the keyboard. However, for efficiency and accuracy, these markers should be the final alphabet of spelling. In other words, the repetition of the final alphabet of spelling distinguishes hieroglyphic or ideographic characters that are homonym. For a hieroglyphic or ideographic character of the homonym that appears second on the computer screen index (bar selection) or in a standard dictionary, it will be repeated once and twice.

However, a number (1, 2, 3, 4, 5, ...) or a "home key" (a, s, d, f, g, h, j, k, l, etc.), or some other such as a marker Symbols can be used. The home key is a key provided on the keyboard of a computer on which a typist's finger is typically placed to represent the numbers 1-10.

For example:

A. Chinese: 1. y for 一; 2. for yy; 3. About yyy; 4. yyyy for 依 or

1. "1" for 一; 2. "2" for 乙; 3. For "3"; 4. "4" or 依

1. "a" for one; 2. "s" for "; 3. For "d"; 4. "f" for 依.

B. Japanese: 1. About 木 ki; 2. About kii.

C. Korean: sin against 城; 2. sinn for 身; 3. sinnn for 辛; 4. sinnnn for 辰.

The repeated alphabets will only be treated as extra alphabets, or markers, to distinguish the roots of homologous thesaurus and they will not have any meaning in the pronunciation of the roots. The same procedure already mentioned will apply to homonym characters with the same prefix in the order in which they appear in the dictionary.

Examples as shown in FIGS. 6 to 8:

A. Chinese (as shown in Figure 6): 1. Yan-shif for; 2. About yan-shiff.

3. Yan-shifff for; 4. Yan-shiffff or about

One. Yan-shi1 for; 2. About yan-shi2.

3. For yan-shi3; 4. For yan-shi4 (or 1. For yan-shia; 2. About yan-shis. 3. Yan-shid for; 4. About yan-shif)

B. Japanese (as shown in FIG. 7): 1. For ki-ko; 2. About ki-koo; 3. About ki-kooo; 4. About ki-koooo.

C. Korean (as shown in FIG. 8): 1. muk-ki for ;; 2. muk-kii for 枝; 3. For muk-kiii; 4. About muk-kiiii.

When a new surrogate word is pronounced, the prefixes will be treated like hieroglyphs or ideograms which represent their silence. Like the phonetic roots they represent, the suffixes are pronounced. If the pronunciation of a Chinese prefix is unique, the indicator for its intonation is exempted. Since the suffix is pronounced, the request for accuracy indicates that the indicator for intonation can always be provided as a suffix except when the intonation is in the first of four.

Reference is now made to FIGS. 6 through 8 which summarize the overall conversion process for the four extreme example letters, which can explain all five steps related to the present invention. 6 shows four Chinese characters as an example. 7 shows four Japanese characters as an example. 8 shows four Korean characters as an example. The charts of FIGS. 6-8 share the same format, each with five rows and at least eight columns. Starting from the left, line 1 includes five steps of the transition or description of the line to the right. The four rows to the right contain the four characters mentioned in the example above, one for each column, and the transition causes them to go through the columns. Column 1 is filled by the four letters of their original form with pronunciations marked by the English style alphabet. Column 2 contains the roots derived from each letter. Column 3 shows the spelling and all the roots for each. This column actually details the effects of steps 1 and 2. Column 4 describes the effect of step 3, which applies only to Chinese. Column 5 is a description in column 2 showing how step 4 affects the characters. Column 6 is a comment in each row that implements Rule 2, demonstrating how Step 5 completes the transition process. Column 7 shows the final result of the method by themselves without any explanation. Doing so allows the reader to see the uniqueness of the newly spelled surrogate word or code for characters that clearly share the same prefix, pronunciation, and intonation. Column 8 shows the surrogate word experimentally spelled with the proper alphabet. Since Japanese have two sets of unique alphabets, namely Katakana and Hiragana, there is an extra row in FIG. Column 8 is filled in by code written in Katakana. Code written in hiragana is placed in column 9. There is also extra heat in FIG. 8. Applicant only wants to use the extra columns to spell Hangul code consisting of straight horizontal lines like English. At the bottom of each chart, the rules described below are listed for suggestive purposes.

According to the invention, the switching method further has two rules for pronouncing the created substitute word.

1. When pronouncing a spelled surrogate word invented, the prefix becomes silent (like the hieroglyphs or ideograms they represent). The suffixes are pronounced like the phonetic roots they represent.

2. If the prefix's pronunciation is unique, the indicator for its intonation can be deleted. Because suffixes are pronounced, the requirement for accuracy specifies that the indicators for their intonation are always provided except when the intonation is in the first one of four.

As disclosed in step 3 of the present invention, the prefix comes first, followed by the individual marks (individual marks can be hyphens, as in the Latin alphabet, but the hyphens can be used if the unique alphabet is used to spell substitute words. Can be replaced by another symbol, such as), followed by a suffix. However, steps 1 and 3 already described can be reversed. That is, the suffix precedes the prefix. Therefore, the surrogate word will consist of a "suffix-prefix". This alternative mode will also be useful as long as the computer expresses this situation. For example, the only surrogate word of a particular Chinese character 績 is "ji-xi" according to the second embodiment (in the first embodiment, the surrogate word of 이다 is "xi-ji"). Since the surrogate words formed from the first and second embodiments are composed of the same alphabet, both of them can be used to accurately represent the same characters. In addition, the user can pre-program the computer with a "switching key" so that the user will always be free to switch the computer to accommodate the first and second embodiments.

In fact, the second embodiment may be better in certain cases. When a particular user feels that the hieroglyphic / table character root is difficult to pronounce, it becomes difficult to type. Instead of searching the dictionary for the pronunciation of rare and difficult roots, the user only needs to type in the suffix. The computer may display homonym characters for the user to select. This can be done, for example, by typing * followed by a suffix only in the case of a hyphen or the native alphabet. If the user suddenly recalls the spelling of a prefix, for example the pronunciation spelling of the p / i root, he may type the prefix after the hyphen (or * if a unique alphabet is used). Since this inversion combination is unique like the "standard" combination described in step 4 of the first embodiment, he can still get exactly the character he wants. Similarly, homonym characters will be displayed allowing the user to select the desired character. Instead of numbering the homonym, the alphabet of the "home key" can be used to indicate the order of the homonym. The user can select the required character by typing with any key, such as "a" for the first, "s" for the second, and "d" for the third. This is just a software design problem.

Moreover, these five combinations and two rules, including the inverted combinations already described, allow Chinese, Japanese, Korean, and Indians to use computers like Americans and provide easy-to-use speech recognition / generation techniques. . The speech recognition computer initially uses a prefix, then an indicator if appropriate, then a marker if appropriate, then an individual mark (hyphen or *), then a suffix, then an indicator if appropriate, and a sequence of markers if appropriate. It can be manufactured using sound cards and software, such as the usual way to train people to understand the pronunciation of a word. Of course, the inverted combination already disclosed can also be used for this purpose as long as the hyphen or * is pronounced first, then the suffix, then the hyphen or *, then the suffix.

The conversion method disclosed in the present invention allows people who can speak a non-speech language but who cannot use it to input characters on a computer and print an essay written in that language. Another prominent feature of the present invention is the same sound card and software that can pronounce the suffix exactly by using a voice-generating computer, which allows the computer to read a document for the user to edit and print, resulting in a user with a possible typing error. You don't have to waste time and energy to scan and check document text versus text in preparation. This feature can also help those who can speak non-speech languages but cannot write or read to check their documents as they enter the computer through the conversion method of the present invention.

The following are some of the cautions the applicant wishes to further disclose.

The English-style alphabets used to form surrogate words that accurately represent the written Chinese characters are some of the variations used in the Chinese Chinese Pinyin system. This change is intended to eliminate some exceptions to the Chinese Pinyin system, making it much easier to use. See FIG. 1 for the Chinese Pinyin alphabet and FIG. 9 for the change. If a main note is used to spell a newly created surrogate word, the prefix and suffix should be separated by an asterisk instead of a hyphen.

The alphabets used to form surrogate words to accurately represent the written Japanese characters are those proposed by the Roman hepburn system, commonly accepted by the Japanese to translate the Japanese into phonetic alphabets. If a new surrogate word is spelled into Katakana or Hiragana, the hyphen must also be replaced with an asterisk.

The alphabets used to form surrogate words that accurately represent the characters used in the recorded Korean are those commonly accepted by Koreans in translating Korean into phonetically English-style alphabets. In addition, an asterisk is used instead of a hyphen when the native alphabet is used to spell substitute words for characters used in Korean.

To distinguish between English and the surrogate words created for these languages, non-English spelling can be italized as in this application case.

The order of Chinese consonants follows the Chinese Pinyin system, as follows: B, P, M, F, D, T, L, N, G, K, H, J, Q, X, ZH, CH, SH, R, Z, C, S.

It is possible to simplify the prefix after the population becomes very similar to them. In its simplified form, the consonant, the first alphabet or the final alphabet of the prefix should be sufficient to represent most of the prefix. With speech recognition technology, no simplification is necessary.

In this description, examples of surrogate words spelled phonetically with native alphabets for Chinese, Japanese, and Korean are examples of the inventive concept. The actual spelling for the same letter using the native alphabet or the English style alphabet may differ from that used in this description. Moreover, some kind of sign can always be formed to replace the current phonetic symbol. However, the five steps and two rules disclosed herein should be used to efficiently form the only new surrogate word that accurately represents a character.

Newly spelled surrogate words, made in English style or indigenous alphabets, may resemble letters in a way that both types are composed of root, hieroglyphic or ideographic and phonetic letters. Such substitute words differ from the above characters in at least two ways. First, the roots for the newly spelled surrogate words are phonetic, while the roots of the letters, in particular the glyphs of the hieroglyphs / tables, are not. Second, the created and spelled surrogate words are more uniform in that the hieroglyphic / table character root always occupies the left portion of the surrogate word as a prefix and the phonetic root always occupies the right portion of the surrogate word as a suffix. On the other hand, the hieroglyphs of the hieroglyphs / table of the character may occupy the left, right, top or bottom of the character. The similarity makes a new substitute word more familiar to the user, and the difference makes a new substitute word logical and more scientific in terms of phonology. As a result, learning such surrogate words is as easy as that. In essence, a user can simply type a substitute word representing a particular non-voice character through a keyboard to accurately enter that particular non-voice character into a computer. According to the switching method for converting a non-voice character into a substitute word of the present invention, a user can simply input a predetermined character into a computer by a manual input method performed after performing the conversion method.

The manual input method includes the following steps.

(1) typing the prefix of the surrogate word formed by the switching method;

(2) typing the prefix indicator, if applicable;

(3) typing a prefix marker, if applicable;

(4) typing individual marks of surrogate words, if applicable;

(5) typing the suffix of the surrogate word;

(6) typing an indicator of the suffix if applicable; And

(7) Type the suffix's marker, if applicable.

In addition, the user can also simply enter.

After performing the switching method as already disclosed, a predetermined character can be simply input to a computer equipped with a speech recognition system by an input dictation input. The dictation input method includes the following steps.

(1) pronouncing the prefix of the surrogate word formed by the switching method;

(2) pronounce the prefix marker, if possible;

(3) pronunciation of individual marks of surrogate words;

(4) pronounce the suffix of the surrogate word;

(5) pronounce the suffix's marker if possible.

Referring to FIGS. 10 to 13, the surrogate word causes a unique set of codes (USC) to have phrases or sentences of multiple syllable vocabulary sets, written Chinese or Kanji characters used in Chinese, Japanese, and Korean. It can be input in a simplified way using substitutes or sentences.

The unique code set (USC) is an alphabetic group consisting of acronyms, labels, and markers for accurately representing phrases or sentences, wherein the acronyms simplifies the suffixes of a plurality of surrogate words representing multiple Chinese characters in a given phrase or sentence. The label is referred to as a simplification of the prefix of a number of surrogate words representing a number of Chinese characters in a given phrase or sentence. In addition, the marker is a repetition of the acronyms or the last alphabet of the label.

The only substitute phrase or sentence consisting of a number of non-voice characters can be obtained by the following steps.

(a) displaying, in alphabetic form, the non-voice character of the phrase according to the pronunciation of the non-voice character to form a spelled prefix for the surrogate word of the non-voice character; And

(b) grouping the selected alphabet of each prefix of each non-voic character of the phrase to select the first or final alphabet from each prefix of each non-voic character of the phrase and form the acronyms of the phrase.

In general, non-voice characters are pronounced by pronunciation of phonetic roots of non-voice characters. For most Chinese phrases or sentences having four or more characters, certain phrases or sentences can be obtained by simply inputting the acronyms of the substitutes or sentences obtained by the above two steps into a computer. If still some homonym phrases or sentences can occur, an additional step can be taken to repeat the final alphabet of the acronyms as markers.

For phrases or sentences with four or more Chinese characters, a simple repetition of the final alphabet of acronyms as markers is suitable to separate the acronyms of homonyms from each other because the acronyms of longer homographs or sentences This is because it is less common than a phrase consisting of four or fewer characters.

For phrases using four or fewer Chinese characters, the following additional steps are taken:

(c) the hieroglyphic / table character of the phrase according to the simplification of the pronunciation of the glyph root of the hieroglyphic / table character or to form the spelled suffix of the non-negative character of the non-negative character. Displaying the root in alphabet;

(d) grouping the first or last alphabet of suffixes of non-negative letters to form a label for a substitute; And

(e) combining the acronyms and labels together to form a unique surrogate, as shown in column 6 of FIGS. 10-13.

By inputting a substitute into the computer, the exact phrase or sentence of the letter can generally be obtained. However, to prevent misunderstanding of acronyms and labels in substitutes, acronyms can be entered as upper alphabets and labels can be entered as lower alphabets if acronyms and labels are pronounced by English style alphabets according to the Chinese Pinyin system. Of course, you can also enter acronyms as lower alphabets and labels as upper alphabets.

If such a substitute is still inadequate to form a unique code set representing a particular phrase or sentence, the next step proceeds until a unique code set (USC) is formed.

(f) repeating the final alphabet of the label as a marker.

Basically, the acronyms and labels can also be pronounced by major notes, hiragana, katakana or Hangul. According to the invention, the acronym is entered before the label. It is also possible to put a label in front of an acronym, and then repeat the final alphabet of the acronym as a marker.

Optionally, step (e) may be replaced by step (e ') of placing the alphabet of the label in front of the alphabet of the acronyms or step (e ") of placing the alphabet of the acronyms in front of the label alphabet. For example, if, as already mentioned, the acronym "ABCDE" and the label "stuvw" are used instead of forming a substitute, such as "ABCDEstuvw" or "STUVWabcde", the alternative substitute is this way: "SaTbUcVdWe" or "AsBtCuDvEw" It can be formed as.

With the software based on the invention, all the phrases jointly used in Chinese, Japanese and Korean can be generated exactly on the screen and the English words are now processed. For the newly formed plain phrases or sentences, the typists can each form a new and unique substitute for them. Moreover, using general speech recognition software that allows a computer to understand the pronunciation of the alphabet, the substitute may be input verbally. When the computer announces that the phrase entry will begin, the user can start reading a unique code set (substituted phrase), including the case of the alphabet, to enter the phrase. The computer can then convert the voice into Chinese characters.

There may be other modified ways of forming the order of the acronyms already disclosed. This may be based on any alphabet of a prefix or suffix of any letter in a phrase or sentence. Here are some examples.

1.in alphabetical order:

A. First alphabet of a prefix of a first Chinese character of a phrase or sentence; or

B. The final alphabet of a prefix of a first Chinese character in a phrase or sentence: or

C. First alphabet of the prefix of the last Chinese character of a phrase or sentence; or

D. Last alphabet of prefix of last Chinese character of phrase or sentence; or

E. The last alphabet of the suffix of the first Chinese character of a phrase or sentence; or

F. The last alphabet of the suffix of the last Chinese character of a phrase or sentence.

2. The English alphabetical order of all of the above and the already mentioned acronyms can be used and the Latin style alphabet can be used to form the USC.

3. The above sequence may be used for this purpose, either the number of strokes of one of the roots contained within a character or the number of strokes of any character of a phrase or sentence, for example the following strokes.

A. First Chinese or Kanji character of a phrase or sentence; or

B. the last Chinese character of a phrase or sentence; or

C. Pictographs / hieroglyphs of the first character of the phrase or sentence; or

D. Hieroglyphic / table character root of the last character of a phrase or sentence; or

E. Phonetic roots of first Chinese characters in phrases or sentences; or

F. Phonetic root of the last Chinese character of a phrase or sentence.

In addition, the label may in fact be the prefix of any letter in the phrase or any alphabet of the suffix, one of which may be used as the label.

A. First alphabet of the prefix of the first letter of a phrase or sentence; or

B. The last alphabet of a prefix of the first letter of a phrase or sentence; or

C. First alphabet of the suffix of the first letter of a phrase or sentence; or

D. The last alphabet of the suffix of the first letter of the phrase or sentence; or

E. First alphabet of prefix of last character of phrase or sentence; or

F. Last alphabet of prefix of last character of phrase or sentence; or

G. First alphabet of the suffix of the last character of a phrase or sentence; or

H. Last alphabet of prefix of last character of phrase or sentence.

The label can also be the power of any character or its stroke in its root of a phrase or sentence.

Preferred labels are made in the regular form of the first letter of the prefix because they follow the training of the typist's thinking. Also, the label will always be the lower alphabet and the acronym itself will always be the upper alphabet. This arrangement can prevent confusion on computers as well as some people. Since the spelling of letters is always a lower alphabet, the "shift" key on the keyboard will serve as a signal to the computer when the user starts typing a phrase or sentence.

Indeed, the theory of substitutes may be applied to any language that is burdened by a particular dialect of homonym, such as Indian.

Again, certain phrases or sentences of non-speech characters may also be input to the computer by a manual input method that proceeds after executing a conversion method for converting a plurality of non-speech characters of a phrase of a language into a substitute as already disclosed. .

The manual input method includes the following steps:

(1) typing a substitute phrase or sentence formed by the conversion method; And

(2) If possible, typing a marker on a substitute phrase or sentence.

In addition, if the computer is equipped with a speech recognition system, the user can also simply input a predetermined phrase or sentence into the computer by the dictation input method which proceeds after executing the switching method as already disclosed. The dictation input method includes the following steps.

(1) if possible, pronunciation of a substitute phrase or sentence formed by the conversion method from alphabet to alphabet including the case of the alphabet; And

(2) pronouncing markers in substitute phrases or sentences, if possible.

The substitute word and substitute phrase (unique code set (USC)) are Chinese characters via e-mail via the Internet or other similar medium as long as the receiving party has the same copy of the software equipped to interpret the corresponding word and USC. Can be used to transmit a document comprising a. In fact, a document created without the benefit of a substitute word or USC is well compatible with Internet protocols because the Internet requires only two bytes to represent each and every character, while the Internet recognizes only one byte (in fact, 7 bits) at the same time. It doesn't work. That is, due to the enormous number of Chinese characters, one byte is insufficient to represent all characters because the maximum number of bytes that can be represented is 256 covering all the English alphabets, marks and numbers. To accommodate thousands of Chinese characters, two bytes are required to form a number that can have more than four digits. This restriction makes this kind of document inconsistent with the Internet protocol. Documents with this incompatibility are "scrambled" unrecognizable after passing through the Internet. However, if the contents of such documents are sent via e-mail in the form of substitute words or alternative phrases (USC), they are completely their destinations because the Internet protocol will treat them as words that are entirely Internet compatible. Will arrive.

Based on the method of converting non-spoken characters into surrogate words as disclosed above, the use of hieroglyphic / table character roots as prefixes of surrogate words can establish a useful way for children to easily remember Chinese or Kanji characters. . Since every character has a glyph / table character or consists solely of a glyph or ideographic root (many glyph / table character roots themselves are letters), the glyph / table character root is very Plays an important part. When recalling the glyphs of the hieroglyphs / table of the letters, the meaning or shape of the letters can be understood. It is an important feature of Chinese or Kanji characters. Moreover, visual images are the easiest to remember.

In other words, the glyphs of all hieroglyphs / tables can be shown by a visual picture that is easier and more familiar to the user to remember. For example, as shown in Fig. 14, an item pronounced "mu" and having the meaning of a phonetic word of "eye" can be shown by the eye glyph;木, pronounced "mu" and meaning the phonetic word of "tree", can be illustrated by a picture of a green tree; The body, pronounced "shen" and having the meaning of "body" in the phonetic word, can be illustrated by a picture of the human body; The letter "pronounced" and having the meaning of "bone" in the phonetic word can be illustrated by a picture of the bone.

Thus, since each glyph / table character root has a unique meaning, the spelling of the meaning of each glyph / table character root can also be used as the spelling indicated by the alphabet of the prefix of the surrogate word. For example, "eye" for the 目, "tree" for 木, "body" for 身, "bone" for 骨. Thus, for example, alternative words for Chinese characters are as follows.

眠 (meaning "sleeping") means "snow-mian", nets (meaning "root") means "tree-gen", (Means "lie down") means "body-tang", (Meaning "femur") is "bone-bi".

Optionally, it is possible to specify and program with 214 different pictures and color icons representing 214 roots to the computer, thus allowing the user to click the computer's mouse to precisely click on the required icon to enter the prefix of the surrogate word. Can be used.

These designated picture icons have an additional function that assists the user or student in remembering the glyphs of the hieroglyphs / tables. In order to remind the user of the spelling of the glyphs of the glyphs / tables, the pronunciation spelling of each glyph of the glyphs may be further described after the representational picture icon.

Therefore, the storage method can be added as a basic step of the already disclosed switching method, which includes the following steps.

(a) assigning a unique code to represent the pictograph / hieroglyphic root of a non-spoken character of a language, wherein the unique code is used as a prefix for a substitute word;

(b) displaying, in alphabetic form, the non-voice characters of the individual language according to the pronunciation of the non-voice characters to form a spelled suffix for the surrogate word;

(c) combining the prefix with the suffix to form a surrogate word representing non-speech characters of the individual language.

The storage method includes the following steps added after step (c).

(d1) showing the meaning of the surrogate word by a visual picture representing the meaning of the hieroglyphic / table character root represented by the prefix;

(d2) showing the meaning of the non-voice by the corresponding semantic visual picture;

(d3) Combination of character meaning visible pictures and prefix visible pictures.

In essence, one can use an active visual device such as a videotape explaining how the visual picture is translated into certain Chinese characters and then to hieroglyphs and color codes. This will leave the p / i root firmly in the student's mind.

When the student understands each p / i root, the letters belonging to each p / i root can be shown in the following manner.

1. A video will be used to show the action of the verb description.

2. A still picture will be used to show the subject of the noun description.

We will use 火 and huo as an example.

First of all, the video shows people sitting around the fire burning orange-red. The burning fire will be shown close up. The next video will show a firework roaring to form the noise mimicking the 'huo' pronunciation and dancing to form the shape of the letter 'fire', meaning orange-red. The calligrapher shows you how to flatten the edges that require attention in the picture and make it look like 'fire', meaning its same color. You will see how the right half of the letter shrinks so that the letter can be used as the same orange hieroglyphic root.

A video showing a woman cooking with a Chinese cooking pot on an orange-red fire and creating a noise mimicking 'chao' with an iron spatula is a character with an orange-red hieroglyph root 'fire'. Can be seen together (pronounced chao in Chinese). , , , Other characters such as can be made in the same way, leaving an orange-red p / i root.

For roots that cannot be represented efficiently by color alone, the stroke of this type of root can be made "hollow" to outline the stroke with black ink but leave the remaining margins. Next, a small but visually identifiable colored object picture represented by the root can be used to fill the blank space. Of course, these pictures could be still pictures used to describe roots. For example, 骨, gu (bone) can only be shown in outline filled with a small picture of the bone. A partial list of roots and a method of describing them is shown in FIG. 1. This list is intended to show what can be done to make the root easier to recognize and remember.

The remaining roots can be described in the same way if they involve tangible objects. Intangible roots can be outlined to have "blank space" at the beginning of the stroke. Its pronunciation in the native alphabet can be put in the blank space.

In the figure, there is a column referred to as the "exemplary method". In this column, the word "picture" means the already mentioned 'picture of small but visually identifiable color'. When no color is mentioned, the unique color of the object in relation to the root will be used.

Although the above examples are all pronounced in Chinese, they can certainly be applied to any other language, such as Japanese and Korean. Everything it takes is replaced by the pronunciation of the Chinese pronunciation, for example Japanese or Korean.

Claims (358)

In the method for converting non-voic characters into substitute words for input to a computer, (a) assigning a single code to represent the shape / target root of a non-speech character of the language, wherein the single code is used as a prefix for a substitute word; (b) marking non-speech characters of each language in alphabetical form according to the non-spoken characters to form a spelled suffix for the surrogate word; And (c) combining the prefix and the suffix together to form a surrogate word representing the non-speech character of each language. 2. The method of claim 1, wherein in step (a), the single code of the prefix of the surrogate word is a numeric code. 2. The method of claim 1, wherein in step (a), the single code of prefix of the surrogate word is an alphabetic spelling of a spoken word having the meaning of the shape / target root. The method of claim 1, wherein in step (a), the single code of the prefix of the surrogate word is an alphabetic spelling of the pronunciation of the shape / target root. 2. The method of claim 1, wherein in step (a), the single code of prefix of the surrogate word is a simplified form of alphabetic spelling of the pronunciation of the shape / target root. 6. The method of claim 5, wherein the simplified form of prefix of the surrogate word is a consonant of the pronunciation of the shape / target root. 6. The method of claim 5, wherein the simplified form of the prefix of the surrogate word is the first alphabet of alphabetic spelling of the pronunciation of the shape / target root. 6. The method of claim 5, wherein the simplified form of the prefix of the surrogate word is the last alphabet of alphabetic spelling of the pronunciation of the shape / target root. 2. The method of claim 1, wherein in step (b), the characters of each language are represented in alphabetical order according to the pronunciation of the phonetic root of the characters to form a suffix of the surrogate word. 10. A method according to claim 4, 5 or 9, wherein the shape / target roots and phonetic roots are represented alphabetically in accordance with Latin pronunciation. 10. The method of claim 4, 5, or 9, wherein the shape / target root and phonetic root are represented in alphabetical order according to the English alphabet pronunciation for the Chinese Pinyin system. 10. The method according to claim 4, 5 or 9, wherein the shape / target root and phonetic root are represented by alphabets according to their own pronunciation of the alphabet. 13. The method of claim 12, wherein the shape / target root and phonetic root are represented in alphabetical order according to the pronunciation of the main phonetic sign for the Chinese main phonetic system. 13. The method of claim 12, wherein the shape / target root and phonetic root are represented in alphabetical order according to the pronunciation of the Japanese hiragana system. The method of claim 12, wherein the shape / target root and phonetic root are represented in alphabetical order according to the pronunciation of the Japanese Katakana system. The method of claim 12, wherein the shape / representative root and the phonetic root are represented in alphabetical form according to a pronunciation of a Korean Hangul system. 2. The method of claim 1, further comprising the step (c) of indicating the intonation of the suffix with a predetermined consonant as an indicator placed at the end of the spelling of the suffix. 10. The method according to claim 4, 5 or 9, further comprising, prior to the step (c), an indication placed at the end of the spelling of the prefix and the suffix to indicate the intonation of the prefix and the suffix with a predetermined consonant, respectively. Characterized in that the method. 19. The method of claim 18 wherein the first accent of the prefix and suffix is devoid of indicators, the second accent of the prefix and suffix is defined by a second consonant, and the third accent of the prefix and suffix is defined by a third consonant And the fourth accent of the prefix and the suffix is defined by a fourth consonant. 20. The system of claim 19, wherein the second accent of the prefix and suffix is defined by "p" as the second consonant and the third accent of the prefix and suffix is defined by "m" as the third consonant. Wherein the fourth accent of the prefix and suffix is defined by "f" as the fourth consonant. 20. The method of claim 19, wherein the second accent of the prefix and suffix is as the second consonant. Defined by ", the third accent of the prefix and suffix is defined as the third consonant" Defined by ", the fourth accent of the prefix and suffix is defined as the fourth consonant" Characterized by ". 2. The method of claim 1, further comprising, after step (c), adding at least one marker after the last alphabet of the prefix of the syllable-substituted surrogate word and the last alphabet of the suffix to distinguish homonyms. How to. 23. The method of claim 22, wherein the marker of the prefix is a repeated alphabet of the last alphabet of the prefix and the marker of the suffix is a repeated alphabet of the last alphabet of the suffix. 18. The method of claim 17, further comprising, after step (c), adding at least one marker after the last alphabet of the prefix of the spelled surrogate word and the last alphabet of the suffix to distinguish homonyms. How to. 25. The method of claim 24, wherein the marker of the prefix is a repeated alphabet of the last alphabet of the prefix and the marker of the suffix is a repeated alphabet of the last alphabet of the suffix. 19. The method of claim 18, further comprising, after step (c), adding at least one marker after the last alphabet of the prefix of the spelled surrogate word and the last alphabet of the suffix to distinguish homologous words. How to. 27. The method of claim 26, wherein the marker of the prefix is a repeated alphabet of the last alphabet of the prefix and the marker of the suffix is a repeated alphabet of the last alphabet of the suffix. 20. The method of claim 19, further comprising, after step (c), adding at least one marker after the last alphabet of the prefix of the spelled surrogate word and the last alphabet of the suffix to distinguish homonyms. How to. 29. The method of claim 28, wherein the marker of the prefix is a repeated alphabet of the last alphabet of the prefix and the marker of the suffix is a repeated alphabet of the last alphabet of the suffix. The method according to claim 1, 2, 3, 4, 5, 6, 7, 8, 9, 17, 22, 23, 24 or 25, wherein the step (c ), Separating the prefix and the suffix by a separating mark. 31. The method of claim 30, wherein in step (c), said separator mark is a hyphen mark. 31. The method of claim 30, wherein in step (c), said separation mark is a space mark. 31. The method of claim 30, wherein in step (c), said separation mark is an asterisk mark. 11. The method of claim 10, further comprising the step (c) of separating the prefix and suffix into a separating mark. 35. The method of claim 34, wherein in step (c), the separator mark is a hyphen mark. 35. The method of claim 34, wherein in step (c), said separation mark is a space mark. 35. The method of claim 34, wherein in step (c), said separation mark is an asterisk mark. 12. The method of claim 11, further comprising the step (c) of separating the prefix and suffix into a separating mark. 39. The method of claim 38, wherein in step (c), said separator mark is a hyphen mark. 39. The method of claim 38, wherein in step (c), said separation mark is a space mark. The method of claim 38, wherein in step (c), said separation mark is an asterisk mark. 13. The method of claim 12, further comprising the step (c) of separating the prefix and suffix into separate marks. 43. The method of claim 42, wherein in step (c), said separator mark is a hyphen mark. 43. The method of claim 42, wherein in step (c), said separation mark is a space mark. 43. The method of claim 42, wherein in step (c), said separation mark is an asterisk mark. 19. The method of claim 18, further comprising the step (c) of separating the prefix and suffix into separate marks. 47. The method of claim 46, wherein in step (c), said separator mark is a hyphen mark. 47. The method of claim 46, wherein in step (c), said separation mark is a space mark. 47. The method of claim 46, wherein in step (c), said separation mark is an asterisk mark. 20. The method of claim 19, further comprising the step (c) of separating the prefix and the suffix into separate marks. 51. The method of claim 50, wherein in step (c), said separator mark is a hyphen mark. 51. The method of claim 50, wherein in step (c), said separation mark is a space mark. 51. The method of claim 50, wherein in step (c), said separation mark is an asterisk mark. 21. The method of claim 20, further comprising separating the prefix and suffix into a separator mark in step (c). 55. The method of claim 54, wherein in step (c), said separator mark is a hyphen mark. 55. The method of claim 54, wherein in step (c), said separation mark is a space mark. 55. The method of claim 54, wherein in step (c), said separation mark is an asterisk mark. 22. The method of claim 21, further comprising the step (c) of separating the prefix and suffix into separate marks. 59. The method of claim 58, wherein in step (c), said separator mark is a hyphen mark. 59. The method of claim 58, wherein in step (c), said separation mark is a space mark. 59. The method of claim 58, wherein in step (c), said separation mark is an asterisk mark. 27. The method of claim 26, further comprising the step (c) of separating the prefix and suffix into separate marks. 63. The method of claim 62, wherein in step (c), said separator mark is a hyphen mark. 63. The method of claim 62, wherein in step (c), said separation mark is a space mark. 63. The method of claim 62, wherein in step (c), said separation mark is an asterisk mark. 28. The method of claim 27, further comprising the step (c) of separating the prefix and the suffix into separate marks. 67. The method of claim 66, wherein in step (c), said separator mark is a hyphen mark. 67. The method of claim 66, wherein in step (c), said separation mark is a space mark. 67. The method of claim 66, wherein in step (c), said separation mark is an asterisk mark. 29. The method of claim 28, further comprising the step (c) of separating the prefix and suffix into separate marks. 71. The method of claim 70, wherein in step (c), said separator mark is a hyphen mark. 71. The method of claim 70, wherein in step (c), said separation mark is a space mark. 71. The method of claim 70, wherein in step (c), said separation mark is an asterisk mark. 30. The method of claim 29, further comprising separating the prefix and suffix into a separator mark in step (c). 75. The method of claim 74, wherein in step (c), said separator mark is a hyphen mark. 75. The method of claim 74, wherein in step (c), said separation mark is a space mark. 75. The method of claim 74, wherein in step (c), said separation mark is an asterisk mark. The method of claim 1, wherein after step (c), (d1) describing the prefix of the surrogate word by means of a visual picture representing the meaning of the shape / target root represented by the prefix; (d2) explaining the meaning of the non-voice by means of the corresponding semantic visual picture; And (d3) further comprising combining a character meaning visual picture and a prefix visual picture. 2. The method of claim 1, wherein each surrogate word is input to the computer by inputting the spelling of the prefix and the spelling of the suffix into the computer. 10. The method of claim 1, 2, 3, 4, 5, 6, 7, 8, or 9, after step (c), (1) typing the prefix of the surrogate word into a computer. And (2) an input step for inputting the non-spoken character into the computer, comprising typing the suffix of the surrogate word into the computer. 19. The method of claim 18, wherein after step (c): (1) typing the prefix of the surrogate word to the computer, (2) typing the indicator of the prefix to the computer, and (3) the suffix of the surrogate word And typing (4) the indicator of the suffix into the computer. 20. The method of claim 19, wherein after step (c): (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, and (3) the suffix of the surrogate word And typing (4) the indicator of the suffix into the computer. 21. The method of claim 20, wherein after step (c): (1) typing the prefix of the surrogate word on a computer, (2) typing the indicator of the prefix on the computer, (3) the suffix of the surrogate word And typing (4) the indicator of the suffix into the computer. 22. The method of claim 21, wherein after step (c): (1) typing the prefix of the surrogate word to the computer, (2) typing the indicator of the prefix to the computer, and (3) the suffix of the surrogate word And typing (4) the indicator of the suffix into the computer. 26. The method of claim 22, 23, 24, or 25, after adding the marker after the last alphabet of the prefix of the spelled surrogate word and the last alphabet of a suffix, (1) prefixing the surrogate word with Typing in a computer, (2) typing an indicator of the prefix on the computer, (3) typing a marker of the prefix on the computer, (4) typing a suffix of the surrogate word on the computer, (5) typing the indicator of the suffix into a computer, and (6) typing the non-spoken character into the computer, comprising typing the marker of the suffix into the computer. How to feature. 27. The method of claim 26, wherein after the second additional step: (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, and (3) marking the marker of the prefix Typing on the computer, (4) typing a suffix of the surrogate word on the computer, (5) typing an indicator of the suffix on the computer, and (6) typing a marker on the suffix on the computer. And further comprising an input step for inputting the non-vocabulary text into a computer. 28. The method of claim 27, wherein after the second additional step: (1) typing the prefix of the surrogate word into a computer, (2) typing the indicator of the prefix into a computer, and (3) marking the marker of the prefix Typing on the computer, (4) typing a suffix of the surrogate word on the computer, (5) typing an indicator of the suffix on the computer, and (6) typing a marker on the suffix on the computer. And further comprising an input step for inputting the non-vocabulary text into a computer. 29. The method of claim 28, wherein after the second additional step: (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, and (3) marking the marker of the prefix Typing on the computer, (4) typing a suffix of the surrogate word on the computer, (5) typing an indicator of the suffix on the computer, and (6) typing a marker on the suffix on the computer. And further comprising an input step for inputting the non-vocabulary text into a computer. 30. The method of claim 29, wherein after the second additional step: (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, and (3) marking the marker of the prefix Typing on the computer, (4) typing a suffix of the surrogate word on the computer, (5) typing an indicator of the suffix on the computer, and (6) typing a marker on the suffix on the computer. And further comprising an input step for inputting the non-vocabulary text into a computer. 31. The method of claim 30, after the second additional step: (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, (3) marking the marker of the prefix Typing on the computer, (4) typing a separator of the surrogate word on the computer, (5) typing a suffix of the surrogate word on the computer, (6) typing an indicator of the suffix on the computer And (7) inputting the non-speech text into the computer, comprising typing the marker of the suffix into the computer. 32. The method of claim 31, after the second additional step: (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, and (3) marking the marker of the prefix Typing on the computer, (4) typing a separator of the surrogate word on the computer, (5) typing a suffix of the surrogate word on the computer, (6) typing an indicator of the suffix on the computer And (7) inputting the non-speech text into the computer, comprising typing the marker of the suffix into the computer. 33. The method of claim 32, after the second additional step: (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, (3) marking the marker of the prefix Typing on the computer, (4) typing a separator of the surrogate word on the computer, (5) typing a suffix of the surrogate word on the computer, (6) typing an indicator of the suffix on the computer And (7) inputting the non-speech text into the computer, comprising typing the marker of the suffix into the computer. 34. The method of claim 33, after the second additional step: (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, and (3) marking the marker of the prefix Typing on the computer, (4) typing a separator of the surrogate word on the computer, (5) typing a suffix of the surrogate word on the computer, (6) typing an indicator of the suffix on the computer And (7) inputting the non-speech text into the computer, comprising typing the marker of the suffix into the computer. 10. The method of claim 1, 2, 3, 4, 5, 6, 7, 8, or 9, wherein after step (c), (1) the prefix of the surrogate word is Pronounced with a speech recognition system, and (2) an input step for inputting the non-speech text into the computer, the method comprising the steps of: pronounce the suffix of the substitute word into the speech recognition system of the computer. How to. 26. The method of claim 22, 23, 24, or 25, after adding the marker after the last alphabet of the prefix of the spelled surrogate word and the last alphabet of a suffix, (1) prefixing the surrogate word with Pronunciation in a computer speech recognition system, (2) pronunciation of the prefix marker with a computer speech recognition system, (3) pronunciation of the surrogate word suffix with a speech recognition system of the computer, and ( And 4) an input step for inputting the non-speech text into the computer, the method comprising pronounced the marker of the suffix into the speech recognition system of the computer. 27. The method of claim 26, further comprising, after the second additional step: (1) pronounce the prefix of the surrogate word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the suffix of the surrogate word with the speech recognition system of the computer, and (4) pronouncing the marker of the suffix with the speech recognition system of the computer. The method further comprises an input step for inputting. 28. The method of claim 27, further comprising, after the second additional step: (1) pronounce the prefix of the surrogate word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the suffix of the surrogate word with the speech recognition system of the computer, and (4) pronouncing the marker of the suffix with the speech recognition system of the computer. The method further comprises an input step for inputting. 29. The method of claim 28, further comprising, after the second additional step: (1) pronounce the prefix of the surrogate word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the suffix of the surrogate word with the speech recognition system of the computer, and (4) pronouncing the marker of the suffix with the speech recognition system of the computer. The method further comprises an input step for inputting. 30. The method of claim 29, further comprising, after the second additional step: (1) pronounce the prefix of the surrogate word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the suffix of the surrogate word with the speech recognition system of the computer, and (4) pronouncing the marker of the suffix with the speech recognition system of the computer. The method further comprises an input step for inputting. 31. The method of claim 30, further comprising, after the second additional step: (1) pronounce the prefix of the surrogate word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the separation mark of the substitute word with the speech recognition system of the computer, (4) pronouncing the suffix of the substitute word with the speech recognition system of the computer, and (5) the marker of the suffix And inputting the non-speech text into the computer, the method comprising the step of pronunciation into a speech recognition system of the computer. 32. The method of claim 31, further comprising, after the second additional step: (1) pronounce the prefix of the surrogate word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the separation mark of the substitute word with the speech recognition system of the computer, (4) pronouncing the suffix of the substitute word with the speech recognition system of the computer, and (5) the marker of the suffix And inputting the non-speech text into the computer, the method comprising the step of pronunciation into a speech recognition system of the computer. 33. The method of claim 32, further comprising, after the second additional step: (1) pronounce the prefix of the surrogate word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the separation mark of the substitute word with the speech recognition system of the computer, (4) pronouncing the suffix of the substitute word with the speech recognition system of the computer, and (5) the marker of the suffix And inputting the non-speech text into the computer, the method comprising the step of pronunciation into a speech recognition system of the computer. 34. The method of claim 33, further comprising, after the second additional step: (1) pronounce the prefix of the surrogate word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the separation mark of the substitute word with the speech recognition system of the computer, (4) pronouncing the suffix of the substitute word with the speech recognition system of the computer, and (5) the marker of the suffix And inputting the non-speech text into the computer, the method comprising the step of pronunciation into a speech recognition system of the computer. In the method for converting non-voic characters into substitute words for input to a computer, (a) marking the non-speech characters of the language in alphabetical order according to the pronunciation of the non-spoken characters to form a spelled prefix of the surrogate word; (b) assigning a unique code to represent the shape / target root of the non-spoken character of each language; And (c) combining the prefix and the suffix together to form a surrogate word representing the character of each language. 107. The method of claim 104, wherein in step (b), the unique code of the suffix of the surrogate word is a numeric code. 107. The method of claim 104, wherein in step (b), the unique code of the suffix of the surrogate word is an alphabetic spelling of a spoken word that represents the meaning of the shape / target root. 107. The method of claim 104, wherein in step (b), the unique code of the suffix of the surrogate word is an alphabetic spelling of the pronunciation of the shape / target root. 107. The method of claim 104, wherein in step (b), the unique code of the suffix of the surrogate word is a simplified form of alphabetic spelling of the pronunciation of the shape / target root. 109. The method of claim 108, wherein the simplified form of the suffix of the surrogate word is a consonant of alphabetic spelling of the pronunciation of the shape / target root. 109. The method of claim 108, wherein the simplified form of the suffix of the surrogate word is the first alphabet of alphabetic spelling of the pronunciation of the shape / target root. 109. The method of claim 108, wherein the simplified form of the suffix of the surrogate word is the last alphabet of alphabetic spelling of the pronunciation of the shape / target root. 107. The method of claim 104, wherein in step (a), the characters of each language are represented alphabetically according to pronunciation of phonetic roots of the characters to form a suffix of the surrogate word. 109. The method of claim 107, 108, or 112, wherein the shape / target root and the phonetic root are represented alphabetically according to Latin pronunciation. 109. The method of claim 107, 108, or 112, wherein the shape / target root and the phonetic root are represented in alphabetical order according to the English alphabet pronunciation for a pinyin system. 109. The method of claim 107, 108, or 112, wherein the shape / target root and the phonetic root are represented in alphabetical form according to their alphabetic pronunciation. 118. The method of claim 115, wherein the shape / target root and the phonetic root are represented alphabetically according to a phonetic phonetic pronunciation that conforms to the Chinese main phonetic system. 118. The method of claim 115, wherein the shape / target root and the phonetic root are represented in alphabetical form according to a pronunciation that conforms to the Japanese hiragana system. 118. The method of claim 115, wherein the shape / target root and the phonetic root are represented in alphabetical order according to a pronunciation in Japanese Katakana system. 118. The method of claim 115, wherein the shape / representative root and the phonetic root are represented in alphabetical form in accordance with the pronunciation of a Korean Hangul system. 107. The method of claim 104, further comprising, before step (c), a first additional step of indicating an accent of the suffix with a predetermined consonant as an indicator located at the end of the spelling of the suffix. 112. The method of claim 107, 108, or 112, further comprising, prior to step (c), a first additional step of indicating an accent of the prefix and the suffix with a predetermined consonant as an indicator located at the end of the spelling of the suffix, respectively. Method comprising a. 126. The method of claim 121, wherein the first accent of the prefix and suffix appears without an indicator, the second accent of the prefix and suffix is defined by a second consonant, and the third accent of the prefix and suffix is defined by a third consonant And a fourth accent of the prefix and the suffix is defined by a fourth consonant. 123. The method of claim 122, wherein the second accent of the prefix and suffix is defined by "p" as the second consonant, and the third accent of the prefix and suffix is defined by "m" as the third consonant, said prefix And the fourth accent of the and suffixes is defined by "f" as the fourth consonant. 124. The method of claim 122, wherein the second accent of the prefix and suffix is as a second consonant. Defined by ", the third accent of the prefix and suffix is defined as the third consonant" Is defined by "the fourth accent of the prefix and suffix as the fourth consonant" Characterized by ". 107. The method of claim 104, further comprising, after step (c), adding at least one marker after the last alphabet of the prefix and the last alphabet of the suffix to distinguish homologous words. How to feature. 126. The method of claim 125, wherein the marker of the prefix is a repeated alphabet of the last alphabet of the prefix and the marker of the suffix is a repeated alphabet of the last alphabet of the suffix. 126. The method of claim 120, further comprising, after step (c), adding at least one marker after the last alphabet of the prefix and the last alphabet of the suffix to distinguish homologous words. How to feature. 127. The method of claim 127, wherein the marker of the prefix is a repeated alphabet of the last alphabet of the prefix and the marker of the suffix is a repeated alphabet of the last alphabet of the suffix. 124. The method of claim 121, further comprising, after step (c), adding at least one marker after the last alphabet of the prefix and the last alphabet of the suffix to distinguish homologous words. How to feature. 129. The method of claim 129, wherein the marker of the prefix is a repeated alphabet of the last alphabet of the prefix and the marker of the suffix is a repeated alphabet of the last alphabet of the suffix. 124. The method of claim 122, further comprising, after step (c), adding at least one marker after the last alphabet of the prefix and the last alphabet of the suffix to distinguish homologous words. How to feature. 134. The method of claim 131, wherein the marker of the prefix is a repeated alphabet of the last alphabet of the prefix and the marker of the suffix is a repeated alphabet of the last alphabet of the suffix. 109, 105, 106, 107, 108, 109, 110, 111, 112, 120, 125, 126, 127, or 128, the step (c) ), Further comprising separating the prefix and the suffix into a separator mark. 134. The method of claim 133, wherein in step (c), the separator mark is a hyphen mark. 134. The method of claim 133, wherein in step (c), the separator mark is a space mark. 134. The method of claim 133, wherein in step (c), the separation mark is an asterisk mark. 117. The method of claim 113, further comprising the step (c) of separating the prefix and suffix into separate marks. 137. The method of claim 137, wherein in step (c), the separator mark is a hyphen mark. 137. The method of claim 137, wherein in step (c), the separator mark is a space mark. 137. The method of claim 137, wherein in step (c), the separator mark is an asterisk mark. 117. The method of claim 114, further comprising the step (c) of separating the prefix and the weed yarn into separate marks. 145. The method of claim 141, wherein in step (c), the separator mark is a hyphen mark. 143. The method of claim 141, wherein in step (c), the separator mark is a space mark. 145. The method of claim 141, wherein in step (c), the separator mark is an asterisk mark. 116. The method of claim 115, further comprising the step (c) of separating the prefix and the suffix into separate marks. 145. The method of claim 145, wherein in step (c), the separator mark is a hyphen mark. 145. The method of claim 145, wherein in step (c), the separator mark is a space mark. 145. The method of claim 145, wherein in step (c), the separator mark is an asterisk mark. 124. The method of claim 121, further comprising the step (c) of separating the prefix and the suffix into separate marks. 149. The method of claim 149, wherein in step (c), the separator mark is a hyphen mark. 149. The method of claim 149, wherein in step (c), the separator mark is a space mark. 149. The method of claim 149, wherein in step (c), the separator mark is an asterisk mark. 124. The method of claim 122, further comprising the step (c) of separating the prefix and suffix into separate marks. 153. The method of claim 153, wherein in step (c), the separator mark is a hyphen mark. 154. The method of claim 154, wherein in step (c), the separator mark is a space mark. 154. The method of claim 154, wherein in step (c), the separator mark is an asterisk mark. 126. The method of claim 123, further comprising the step (c) of separating the prefix and the suffix into separate marks. 158. The method of claim 157, wherein in step (c), the separator mark is a hyphen mark. 158. The method of claim 157, wherein in step (c), the separator mark is a space mark. 158. The method of claim 157, wherein in step (c), the separator mark is an asterisk mark. 124. The method of claim 124, further comprising the step (c) of separating the prefix and the suffix into separate marks. 162. The method of claim 161, wherein in step (c), the separator mark is a hyphen mark. 161. The method of claim 161, wherein in step (c), the separator mark is a space mark. 161. The method of claim 161, wherein in step (c), the separator mark is an asterisk mark. 129. The method of claim 129, further comprising the step of separating the prefix and suffix into separate marks in step (c). 167. The method of claim 165, wherein in step (c), the separator mark is a hyphen mark. 167. The method of claim 165, wherein in step (c), the separator mark is a space mark. 167. The method of claim 165, wherein in step (c), the separator mark is an asterisk mark. 131. The method of claim 130, further comprising the step (c) of separating the prefix and suffix into separate marks. 171. The method of claim 169, wherein in step (c), the separator mark is a hyphen mark. 171. The method of claim 169, wherein in step (c), the separator mark is a space mark. 171. The method of claim 169, wherein in step (c), said separator mark is an asterisk mark. 134. The method of claim 131, further comprising the step of separating the prefix and suffix into separate marks in step (c). 172. The method of claim 173, wherein in step (c), said separator mark is a hyphen mark. 175. The method of claim 173, wherein in step (c), the separator mark is a space mark. 174. The method of claim 173, wherein in step (c), said separator mark is an asterisk mark. 134. The method of claim 132, further comprising the step (c) of separating the prefix and suffix into separate marks. 179. The method of claim 177, wherein in step (c), the separator mark is a hyphen mark. 179. The method of claim 177, wherein in step (c), the separator mark is a space mark. 181. The method of claim 177, wherein in step (c), the separator mark is an asterisk mark. 107. The method of claim 104, wherein after step (c): (d1) describing the prefix of the surrogate word by means of a visual picture representing the meaning of the shape / target root represented by the prefix; (d2) explaining the meaning of the non-voice by means of the corresponding semantic visual picture; And (d3) further comprising combining a character meaning visual picture and a prefix visual picture. 108. The method of claim 104, 105, 106, 107, 108, 109, 110, 111, or 112, after step (c), (1) typing the prefix of the surrogate word into a computer. And (2) an input step for inputting the non-spoken character into the computer, comprising typing the suffix of the surrogate word into the computer. 126. The method of claim 121, wherein after step (c): (1) typing the prefix of the surrogate word to the computer, (2) typing the indicator of the prefix to the computer, and (3) the suffix of the surrogate word And typing (4) the indicator of the suffix into the computer. 123. The method of claim 122, wherein after step (c): (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, and (3) the suffix of the surrogate word And typing (4) the indicator of the suffix into the computer. 126. The method of claim 123, wherein after step (c): (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, and (3) the suffix of the surrogate word And typing (4) the indicator of the suffix into the computer. 124. The method of claim 124, wherein after step (c): (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, and (3) the suffix of the surrogate word And typing (4) the indicator of the suffix into the computer. 129. The method of any of claims 125, 126, 127, or 128, after adding the marker after the last letter of the prefix of the spelled surrogate word and the last letter of a suffix, (1) prefixing the substitute word Typing in a computer, (2) typing an indicator of the prefix on the computer, (3) typing a marker of the prefix on the computer, (4) typing a suffix of the surrogate word on the computer, (5) typing the indicator of the suffix into a computer, and (6) typing the non-spoken character into the computer, comprising typing the marker of the suffix into the computer. How to feature. 129. The method of claim 129, wherein after the second additional step: (1) typing the prefix of the surrogate word into a computer, (2) typing the indicator of the prefix into a computer, and (3) marking the marker of the prefix Typing on the computer, (4) typing a suffix of the surrogate word on the computer, (5) typing an indicator of the suffix on the computer, and (6) typing a marker on the suffix on the computer. And further comprising an input step for inputting the non-vocabulary text into a computer. 131. The method of claim 130, wherein after the second additional step: (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, (3) marking the marker of the prefix Typing on the computer, (4) typing a suffix of the surrogate word on the computer, (5) typing an indicator of the suffix on the computer, and (6) typing a marker on the suffix on the computer. And further comprising an input step for inputting the non-vocabulary text into a computer. 145. The method of claim 131, wherein after the second additional step: (1) typing the prefix of the surrogate word into a computer, (2) typing the indicator of the prefix into a computer, and (3) marking the marker of the prefix Typing on the computer, (4) typing a suffix of the surrogate word on the computer, (5) typing an indicator of the suffix on the computer, and (6) typing a marker on the suffix on the computer. And further comprising an input step for inputting the non-vocabulary text into a computer. 134. The method of claim 132, after the second additional step: (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, and (3) marking the marker of the prefix Typing on the computer, (4) typing a suffix of the surrogate word on the computer, (5) typing an indicator of the suffix on the computer, and (6) typing a marker on the suffix on the computer. And further comprising an input step for inputting the non-vocabulary text into a computer. 134. The method of claim 133, after the second additional step: (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, and (3) marking the marker of the prefix Typing on the computer, (4) typing a separator of the surrogate word on the computer, (5) typing a suffix of the surrogate word on the computer, (6) typing an indicator of the suffix on the computer And (7) inputting the non-speech text into the computer, comprising typing the marker of the suffix into the computer. 134. The method of claim 134, wherein after the second additional step: (1) typing the prefix of the surrogate word into a computer, (2) typing the indicator of the prefix into a computer, and (3) marking the marker of the prefix Typing on the computer, (4) typing a separator of the surrogate word on the computer, (5) typing a suffix of the surrogate word on the computer, (6) typing an indicator of the suffix on the computer And (7) inputting the non-speech text into the computer, comprising typing the marker of the suffix into the computer. 137. The method of claim 135, wherein after the second additional step: (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, (3) marking the marker of the prefix Typing on the computer, (4) typing a separator of the surrogate word on the computer, (5) typing a suffix of the surrogate word on the computer, (6) typing an indicator of the suffix on the computer And (7) inputting the non-speech text into the computer, comprising typing the marker of the suffix into the computer. 137. The method of claim 136, after the second additional step: (1) typing the prefix of the surrogate word to a computer, (2) typing the indicator of the prefix to the computer, and (3) marking the marker of the prefix Typing on the computer, (4) typing a separator of the surrogate word on the computer, (5) typing a suffix of the surrogate word on the computer, (6) typing an indicator of the suffix on the computer And (7) inputting the non-speech text into the computer, comprising typing the marker of the suffix into the computer. 108. The method of claim 104, 105, 106, 107, 108, 109, 110, 111, or 112, after step (c), (1) the prefix of the surrogate word is Pronounced with a speech recognition system, and (2) an input step for inputting the non-speech text into the computer, the method comprising the steps of: pronounce the suffix of the substitute word into the speech recognition system of the computer. How to. 129. The method of any of claims 125, 126, 127, or 128, after adding the marker after the last letter of the prefix of the spelled surrogate word and the last letter of a suffix, (1) prefixing the substitute word Pronunciation in a computer speech recognition system, (2) pronunciation of the prefix marker with a computer speech recognition system, (3) pronunciation of the surrogate word suffix with a speech recognition system of the computer, and ( And 4) an input step for inputting the non-speech text into the computer, the method comprising pronounced the marker of the suffix into the speech recognition system of the computer. 129. The method of claim 129, further comprising, after the second additional step: (1) pronounce the prefix of the surrogate word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the suffix of the surrogate word with the speech recognition system of the computer, and (4) pronouncing the marker of the suffix with the speech recognition system of the computer. The method further comprises an input step for inputting. 133. The method of claim 130, further comprising, after the second additional step: (1) pronounce the prefix of the surrogate word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the suffix of the surrogate word with the speech recognition system of the computer, and (4) pronouncing the marker of the suffix with the speech recognition system of the computer. The method further comprises an input step for inputting. 137. The method of claim 131, further comprising, after the second additional step: (1) pronounce the prefix of the surrogate word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the suffix of the surrogate word with the speech recognition system of the computer, and (4) pronouncing the marker of the suffix with the speech recognition system of the computer. The method further comprises an input step for inputting. 134. The method of claim 132, further comprising, after the second additional step: (1) pronounce the prefix of the surrogate word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the suffix of the surrogate word with the speech recognition system of the computer, and (4) pronouncing the marker of the suffix with the speech recognition system of the computer. The method further comprises an input step for inputting. 137. The method of claim 133, further comprising, after the second additional step: (1) pronounce the prefix of the substitute word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the separation mark of the substitute word with the speech recognition system of the computer, (4) pronouncing the suffix of the substitute word with the speech recognition system of the computer, and (5) the marker of the suffix And inputting the non-speech text into the computer, the method comprising the step of pronunciation into a speech recognition system of the computer. 137. The method of claim 134, further comprising, after the second additional step: (1) pronounce the prefix of the surrogate word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the separation mark of the substitute word with the speech recognition system of the computer, (4) pronouncing the suffix of the substitute word with the speech recognition system of the computer, and (5) the marker of the suffix And inputting the non-speech text into the computer, the method comprising the step of pronunciation into a speech recognition system of the computer. 137. The method of claim 135, wherein after the second additional step: (1) pronounce the prefix of the surrogate word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the separation mark of the substitute word with the speech recognition system of the computer, (4) pronouncing the suffix of the substitute word with the speech recognition system of the computer, and (5) the marker of the suffix And inputting the non-speech text into the computer, the method comprising the step of pronunciation into a speech recognition system of the computer. 137. The method of claim 136, further comprising, after the second additional step: (1) pronounce the prefix of the surrogate word with a speech recognition system of a computer, (2) pronounce the marker of the prefix with a speech recognition system of a computer, (3) pronouncing the separation mark of the substitute word with the speech recognition system of the computer, (4) pronouncing the suffix of the substitute word with the speech recognition system of the computer, and (5) the marker of the suffix And inputting the non-speech text into the computer, the method comprising the step of pronunciation into a speech recognition system of the computer. 107. The method of claim 104, wherein each of the surrogate words is input to the computer by inputting the spelling of the prefix and the spelling of the suffix into the computer. In the method of converting a plurality of non-speech characters of a phrase of a language into a substitute phrase for input to a computer, (a) marking the non-voice characters of the phrase in alphabetical order according to the pronunciation of the non-voice characters to form a spelled prefix for the surrogate word of each non-voice character; And (b) select a predetermined alphabet from the prefix of each non-voicing character of the phrase, Method comprising a. 213. The method of claim 207, wherein in step (b), the first alphabet is selected from the prefix of each non-voicing character of the phrase to form the acronyms of the alternative phrase. 214. The method of claim 207, wherein in step (b), the last alphabet is selected from the prefix of each non-voicing character of the phrase to form an acronym for the substitute phrase. 205. The method of claim 207, further comprising, after step (b), an additional step of repeating the last alphabet of the acronyms as markers. 209. The method of claim 208, further comprising, after step (b), an additional step of repeating the last alphabet of the acronyms as markers. 209. The method of claim 209, further comprising, after step (b), an additional step of repeating the last alphabet of the acronyms as markers. The method of claim 207, 208, or 209, wherein after step (b): (c) alphabetically representing the shape / representative root of each non-voice character of the phrase according to the pronunciation of the shape / representative root of each non-voice character to form a spelled suffix of each non-speech character of the phrase Doing; (d) grouping a plurality of selected alphabets of suffixes of non-phonic characters of the phrase to select a predetermined alphabet from each suffix of each non-speech character of the phrase and form a label of the substitute phrase; And (e) combining the acronyms and the label together to form the substitute phrase. 213. The method of claim 213, wherein in step (e), the acronym is placed in front of the label to form the substitute phrase. 214. The method of claim 214, wherein in step (e), the acronyms are in the upper case alphabet and the label is in the lower case alphabet when an English alphabet is used. 213. The method of claim 213, wherein in step (e), the label is placed in front of the acronyms to form the substitute phrase. 216. The method of claim 216, wherein when the English alphabet is used, the label is in the upper case alphabet and the acronyms are in the lower case alphabet. 213. The method of claim 213, wherein in step (e), each letter of the label is placed before each letter of the acronyms to form the substitute phrase. 218. The method of claim 218, wherein in step (e), when an English alphabet is used, the alphabet of the label is in the upper case alphabet and the two letter alphabet is in the lower case alphabet. 213. The method of claim 213, wherein in step (e), the alphabet of acronyms precedes each alphabet of the label to form the substitute phrase. 220. The method of claim 220, wherein when the English alphabet is used, the alphabet of the acronyms is in the upper case alphabet and the alphabet of the label is in the lower case alphabet. 213. The method of claim 213, wherein in step (e), a first alphabet is selected from each suffix of each non-voice character of the phrase to form a label of the substitute phrase. 215. The method of claim 214, wherein in step (d), a first alphabet is selected from the suffixes of each non-voicing character of the phrase to form a label of the substitute phrase. 216. The method of claim 216, wherein in step (d), a first alphabet is selected from the suffixes of each non-voicing character of the phrase to form a label of the substitution phrase. 219. The method of claim 218, wherein in step (d), a first alphabet is selected from the suffixes of each non-voicing character of the phrase to form a label of the substitution phrase. 220. The method of claim 220, wherein in step (d), a first alphabet is selected from the suffixes of each non-voicing character of the phrase to form a label of the substitute phrase. 213. The method of claim 213, wherein in step (d), the last alphabet is selected from the suffixes of each non-voicing character of the phrase to form a label of the substitute phrase. 214. The method of claim 214, wherein in step (d), the last alphabet is selected from the suffixes of each non-voicing character of the phrase to form a label of the substitute phrase. 216. The method of claim 216, wherein in step (d), the last alphabet is selected from the suffixes of each non-voicing character of the phrase to form a label of the substitute phrase. 218. The method of claim 218, wherein in step (d), the last alphabet is selected from the suffixes of each non-voicing character of the phrase to form a label of the substitute phrase. 220. The method of claim 220, wherein in step (d), a final alphabet is selected from the suffixes of each non-voicing character of the phrase to form a label of the substitute phrase. 213. The method of claim 213, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 214. The method of claim 214, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 216. The method of claim 216, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 218. The method of claim 218, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 220. The method of claim 220, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 225. The method of claim 222, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 235. The method of claim 223, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 224. The method of claim 224, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 225. The method of claim 225, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 226. The method of claim 226, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 227. The method of claim 227, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 228. The method of claim 228, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 302. The method of claim 229, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 234. The method of claim 230, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 231. The method of claim 231, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. The method of claim 207, 208, or 209, wherein after step (b): (c) writing, in alphabetic form, a simplified pronunciation of the shape / representative root of the non-negative character of the phrase to form a spelled suffix of the non-negative character of the phrase; (d) grouping the plurality of selected alphabets of suffixes of non-voiced letters of the phrase to select a predetermined alphabet from each suffix of the non-voiced letters of the phrase and form a label of the phrase; And (e) combining the acronyms and the labels together to form the substitute phrase. 247. The method of claim 247, wherein in step (e), the acronym is placed in front of the label to form the substitute phrase. 248. The method of claim 248, wherein when the English alphabet is used, the acronyms are in the upper case alphabet and the label is in the lower case alphabet. 247. The method of claim 247, wherein in step (e), the label is placed in front of the acronyms to form the substitute phrase. 252. The method of claim 250, wherein the acronyms are in the upper case alphabet and the label is in the lower case alphabet when an English alphabet is used. 247. The method of claim 247, wherein in step (e), each letter of the label is preceded by each letter of the acronyms to form the substitute phrase. 252. The method of claim 252, wherein when the English alphabet is used, the alphabet of the label is in the upper case alphabet and the acronym alphabet is in the lower case alphabet. 247. The method of claim 247, wherein in step (e), each letter of the acronyms is placed before each letter of the label to form the substitute phrase. 252. The method of claim 254, wherein when the English alphabet is used, the alphabet of the acronyms is in the upper case alphabet and the alphabet of the label is in the lower case alphabet. 247. The method of claim 247, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 248. The method of claim 248, further comprising, after step (e), an additional step (f) of repeating the last alphabet of the label as a marker. 252. The method of claim 250, further comprising, after step (e), repeating the final alphabet of the label as a marker (f). 252. The method of claim 252, further comprising, after step (e), repeating the final alphabet of the label as a marker (f). 252. The method of claim 254, further comprising, after step (e), repeating the final alphabet of the label as a marker (f). 209. The method of claim 207, 208 or 209, wherein the plurality of non-speech characters of the plurality of language phrases is input to the computer by typing the substitute phrase in alphabetical units. 209. The method of claim 207, 208 or 209, wherein the plurality of non-speech characters of the phrases of the plurality of languages are input to the computer by pronouncing the substitute phrases in alphabetical units with a voice recognition system of the computer. . 213. The method of claim 210, 211 or 212, wherein the plurality of non-speech characters of the plurality of phrases of the language is input to the computer by typing the substitute phrase and the marker in alphabetical units. 213. The method of claim 210, 211 or 212, wherein the plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases in alphabetical units with a voice recognition system of the computer. . 213. The method of claim 213, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 213. The method of claim 213, wherein a plurality of non-speech characters of the phrases of the plurality of languages are input to the computer by pronouncing the substitute phrases in a speech unit of the computer in alphabetical units. 214. The method of claim 214, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 214. The method of claim 214, wherein the plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases in alphabetical units with the computer's speech recognition system. 215. The method of claim 215, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 215. The method of claim 215, wherein a plurality of non-speech characters of the phrases of the plurality of languages are input to the computer by pronouncing the substitute phrases in a speech unit of the computer in alphabetical units. 216. The method of claim 216, wherein the plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 216. The method of claim 216, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases in alphabetical units with a voice recognition system of the computer. 222. The method of claim 217, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 218. The method of claim 217, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases in alphabetical units with a voice recognition system of the computer. 219. The method of claim 218, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 218. The method of claim 218, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases in a speech unit of the computer in alphabetical units. 222. The method of claim 217, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 219. The method of claim 219, wherein a plurality of non-speech characters of the phrases of the plurality of languages are input to the computer by pronouncing the substitute phrases in alphabetical units with a voice recognition system of the computer. 220. The method of claim 220, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by typing the substitute phrase in alphabetical units. 220. The method of claim 220, wherein the plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases in alphabetical units with a speech recognition system of the computer. 226. The method of claim 221, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 227. The method of claim 221, wherein a plurality of non-speech characters of the phrases of the plurality of languages are input to the computer by pronouncing the substitute phrases in alphabetical units by the computer's speech recognition system. 222. The method of claim 222, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 222. The method of claim 222, wherein the plurality of non-speech characters of the plurality of phrases of the language is input to the computer by pronouncing the substitute phrases in a speech unit of the computer in alphabetical units. 226. The method of claim 223, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by typing the substitute phrase in alphabetical units. 226. The method of claim 223, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases in alphabetical units with a voice recognition system of the computer. 224. The method of claim 224, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 224. The method of claim 224, wherein a plurality of non-speech characters of the phrases of the plurality of languages are input to the computer by pronouncing the substitute phrases in alphabetical units with a voice recognition system of the computer. 226. The method of claim 226, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 226. The method of claim 226, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases in alphabetical units with the computer's speech recognition system. 227. The method of claim 227, wherein a plurality of non-speech characters of the plurality of phrases of the language is input to the computer by typing the substitute phrase in alphabetical units. 227. The method of claim 227, wherein a plurality of non-speech characters of the phrases of the plurality of languages are input to the computer by pronouncing the substitute phrases in alphabetical units with the computer's speech recognition system. 228. The method of claim 228, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 228. The method of claim 228, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases in alphabetical units with a voice recognition system of the computer. 229. The method of claim 229, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 229. The method of claim 229, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases in alphabetical units with a voice recognition system of the computer. 234. The method of claim 230, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 234. The method of claim 230, wherein the plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases in alphabetical units with a voice recognition system of the computer. 231. The method of claim 231, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 231. The method of claim 231, wherein a plurality of non-speech characters of the phrases of the plurality of languages are input to the computer by pronouncing the substitute phrases in a speech unit of the computer in alphabetical units. 234. The method of claim 232, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrase and the marker in alphabetical units. 234. The method of claim 232, wherein the plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases and the markers in alphabetical units with a speech recognition system of the computer. 237. The method of claim 233, wherein the plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases and markers in alphabetical units. 237. The method of claim 233, wherein the plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrase and the marker in a speech recognition system of the computer in alphabetical units. 234. The method of claim 234, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrase and the marker in alphabetical units. 234. The method of claim 234, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases and the markers in alphabetical units with a voice recognition system of the computer. 235. The method of claim 235, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrase and the marker in alphabetical units. 236. The method of claim 235, wherein the plurality of non-speech characters of the plurality of phrases of the language is input to the computer by pronouncing the substitute phrase and the marker in a speech unit of the computer in alphabetical units. 236. The method of claim 236, wherein the plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases and markers in alphabetical units. 236. The method of claim 236, wherein the plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases and the markers in a speech recognition system of the computer in alphabetical units. 237. The method of claim 237, wherein the plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrase and the marker in alphabetical units. 237. The method of claim 237, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases and the markers in a computer-aided speech recognition system. 238. The method of claim 238, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrase and the marker in alphabetical units. 238. The method of claim 238, wherein the plurality of non-speech characters of the plurality of phrases of the language is input to the computer by pronouncing the substitute phrase and the marker in a speech recognition system of the computer in alphabetical units. 301. The method of claim 239, wherein the plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases and markers in alphabetical units. 301. The method of claim 239, wherein the plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrase and the marker in a speech recognition system of the computer in alphabetical units. 240. The method of claim 240, wherein the plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrase and the marker in alphabetical units. 245. The method of claim 240, wherein the plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrase and the marker in a speech recognition system of the computer in alphabetical units. 245. The method of claim 241, wherein the plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrase and the marker in alphabetical units. 245. The method of claim 241, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrase and the marker in a speech recognition system of the computer in alphabetical units. 245. The method of claim 242, wherein the plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases and markers in alphabetical units. 242. The method of claim 242, wherein the plurality of non-speech characters of the plurality of phrases of the language is input to the computer by pronouncing the substitute phrase and the marker in a speech recognition system of the computer in alphabetical units. 245. The method of claim 243, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrase and the marker in alphabetical units. 245. The method of claim 243, wherein the plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrase and the marker in a speech recognition system of the computer in alphabetical units. 245. The method of claim 244, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases and markers in alphabetical units. 245. The method of claim 244, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrase and the marker in a speech recognition system of the computer in alphabetical units. 245. The method of claim 245, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrase and the marker in alphabetical units. 245. The method of claim 245, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrase and the marker in alphabetical units by the computer's speech recognition system. 246. The method of claim 246, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrase and the marker in alphabetical units. 245. The method of claim 246, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrase and the marker in a speech recognition system of the computer in alphabetical units. 247. The method of claim 247, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 247. The method of claim 247, wherein a plurality of non-speech characters of the phrases of the plurality of languages are input to the computer by pronouncing the substitute phrases in alphabetical units with the computer's speech recognition system. 248. The method of claim 248, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 248. The method of claim 248, wherein a plurality of non-speech characters of the phrases of the plurality of languages are input to the computer by pronouncing the substitute phrases in alphabetical units with a speech recognition system of the computer. 251. The method of claim 249, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 251. The method of claim 249, wherein the plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases in a speech unit of the computer in alphabetical units. 252. The method of claim 250, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 252. The method of claim 250, wherein a plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases in alphabetical units with a speech recognition system of the computer. 251. The method of claim 251, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 251. The method of claim 251, wherein a plurality of non-speech characters of the phrases of the plurality of languages are input to the computer by pronouncing the substitute phrases in alphabetical units with the computer's speech recognition system. 252. The method of claim 252, wherein the plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 252. The method of claim 252, wherein a plurality of non-speech characters of the phrases of the plurality of languages are input to the computer by pronouncing the substitute phrases in alphabetical units with a voice recognition system of the computer. 252. The method of claim 253, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 265. The method of claim 253, wherein the plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrases in a speech unit of the computer in alphabetical units. 252. The method of claim 254, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 254. The method of claim 254, wherein the plurality of non-speech characters of the plurality of phrases of the language is input to the computer by pronouncing the substitute phrase and the marker in a computer-aided speech recognition system. 255. The method of claim 255, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases in alphabetical units. 255. The method of claim 255, wherein a plurality of non-speech characters of the phrases of the plurality of languages are input to the computer by pronouncing the substitute phrases in alphabetical units with a voice recognition system of the computer. 260. The method of claim 256, wherein the plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases and markers in alphabetical units. 260. The method of claim 256, wherein the plurality of non-speech characters of the plurality of phrases of the language are input to the computer by pronouncing the substitute phrase and the marker in a speech recognition system of the computer in alphabetical units. 265. The method of claim 257, wherein the plurality of non-speech characters of the plurality of language phrases is input to the computer by typing the substitute phrase and the marker in alphabetical units. 265. The method of claim 257, wherein the plurality of non-speech characters of the plurality of phrases of the language is input to the computer by pronouncing the substitute phrase and the marker in a speech recognition system of the computer in alphabetical units. 270. The method of claim 258, wherein the plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrase and the marker in alphabetical units. 270. The method of claim 258, wherein the plurality of non-speech characters of the plurality of phrases of the language is input to the computer by pronouncing the substitute phrases and the markers in a computer-aided speech recognition system. 270. The method of claim 259, wherein the plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrases and markers in alphabetical units. 270. The method of claim 259, wherein the plurality of non-speech characters of the plurality of phrases of the language is input to the computer by pronouncing the substitute phrases and the markers in a computer-aided speech recognition system. 260. The method of claim 260, wherein a plurality of non-speech characters of the plurality of language phrases are input to the computer by typing the substitute phrase and the marker in alphabetical units. 260. The method of claim 260, wherein a plurality of non-speech characters of the phrases of the plurality of languages are input to the computer by pronouncing the substitute phrases and the markers in alphabetical units with a voice recognition system of the computer.