METHOD FOR CONVERTING NON-PHONETIC CHARACTERS INTO SURROGATE WORDS FOR INPUTTING INTO A COMPUTER

PROCEDE DE TRANSCRIPTION DE CARACTERES NON PHONETIQUES EN MOTS DE SUBSTITUTION POUR LES ENTRER DANS UN ORDINATEUR

English Abstract

A method for specifically converting non-phonetic characters representing
vocabulary in languages into surrogate words for inputting into a computer
includes the steps of (a) 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; (b) 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 (c) 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. Such newly created
surrogate words are unique for and can precisely represent the non-phonetic
characters used in the written oriental languages such as Chinese, Japanese,
Korean language, and Indian language, thus facilitating the easy input of the
information in these languages into a computer either manually or orally.

French Abstract

L'invention concerne un procédé destiné à transcrire de manière spécifique des caractères non phonétiques représentant du vocabulaire dans certaines langues en mots de substitution, en vue de les introduire dans un ordinateur. Le procédé comprend les étapes consistant à (a) effectuer la translittération d'un radical pictographique ou idéographique de chaque caractère selon sa prononciation dans une langue respective, l'orthographe ainsi obtenue, étant ensuite utilisée comme un préfixe pour un mot de substitution nouvellement créé; (b) transcrire un radical phonétique selon sa prononciation dans une langue respective, l'orthographe ainsi obtenue étant ensuite utilisée comme un suffixe pour le mot de substitution nouvellement créé; et (c) combiner le préfixe et le suffixe, et les séparer à l'aide d'une marque de séparation tel qu'un trait d'union "-", afin de créer le mot de substitution pour chaque "caractère" spécifique de la langue respective utilisé sous sa forme écrite. Ces mots de substitution nouveaux sont uniques et peuvent représenter avec précision les caractères non phonétiques utilisés dans l'écriture de certaines langues orientales, telles que le chinois, le japonais, le coréen et les langues indiennes, facilitant ainsi l'entrée, manuelle ou orale, de l'information en ces langues dans un ordinateur.

Claims

What is Claimed is:
1. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, comprising the steps of:
(a) assigning a unique code to represent a pictographic/ideographic radical of
a non-phonetic
character of a language, wherein said unique code being used as a prefix for a
surrogate word;
(b) alphabetizing said non-phonetic character of said respective language
according to a
pronunciation of said non-phonetic character to form a spelled suffix for said
surrogate word; and
(c) combining said prefix and said suffix together to constitute said
surrogate word
representing said non-phonetic character of said respective language.
2. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 1, wherein, in step (a), said unique code of
said prefix of said surrogate
word is a numeral code.
3. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 1, wherein, in step (a), said unique code of
said prefix of said surrogate
word is an alphabetic spelling of a phonetic word having a meaning of said
pictographic/ideographic
radical.
4. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 1, wherein, in step (a), said unique code of
said prefix of said surrogate
word is an alphabetic spelling of a pronunciation of said
pictographic/ideographic radical.
5. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 1, wherein, in step (a), said unique code of
said prefix of said surrogate
word is an abbreviated form of an alphabetic spelling of a pronunciation of
said pictographic/ideographic
radical.
6. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 5, wherein said abbreviated form of said
prefix of said surrogate word is a
consonant of said pronunciation of said pictographic/ideographic radical.
7. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 5, wherein said abbreviated form of said
prefix of said surrogate word is a
first alphabet of said alphabetic spelling of said pronunciation of said
pictographic/ideographic radical.
8. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 5, wherein said abbreviated form of said
prefix of said surrogate word is a
last alphabet of said alphabetic spelling of said pronunciation of said
pictographic/ideographic radical.
9. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 1, wherein, in step (b), said character of
said respective language is
alphabetized according to a pronunciation of a phonetic radical of said
character to form said suffix of said
surrogate word.
23




10. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 4, 5 or 9, wherein said
pictographic/ideographic radical and said phonetic
radical are alphabetized according to a pronunciation with Latin alphabets.
11. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 4, 5 or 9, wherein said
pictographic/ideographic radical and said phonetic
radical are alphabetized according to a pronunciation with English-style
alphabets conforming to a Pinyin
system.
12. A method for convening non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 4, 5 or 9, wherein said
pictographic/ideographic radical and said phonetic
radical are alphabetized according to a pronunciation with native alphabets.
13. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 12, wherein said pictographic/ideographic
radical and said phonetic radical
are alphabetized according to a pronunciation with zhuyin zimu conforming to a
Chinese Zhuyin system.
14. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 12, wherein said pictographic/ideographic
radical and said phonetic radical
are alphabetized according to a pronunciation conforming to a Japanese
Hiragana system.
15. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 12, wherein said pictographic/ideographic
radical and said phonetic radical
are alphabetized according to a pronunciation conforming to a Japanese
Katagana system.
16. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 12, wherein said pictographic/ideographic
radical and said phonetic radical
are alphabetized according to a pronunciation conforming a Korean Hangul
system.
17. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 1, before said step (c), further comprising a
first additional step of
indicating an intonation of said suffix with a predetermined consonant as an
indicator placed at the end of
said spelling of said suffix.
18. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 4, 5 or 9, before said step (c), further
comprising a first additional step of
indicating an intonation of said prefix and said suffix respectively with a
predetermined consonant as an
indicator placed at the end of said spelling of said prefix and said suffix.
19. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 18, wherein a first intonation of said prefix
and said suffix bear no
indicator, a second intonation of said prefix and said suffix being denoted by
a second consonant, a third
intonation of said prefix and said suffix being denoted by a third consonant.
a fourth intonation of said
prefix and said suffix being denoted by a fourth consonant.
20. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 19, wherein said second intonation of said
prefix and said suffix is denoted
by a "p" as said second consonant, said third intonation of said prefix and
said suffix being denoted by a
24




"m " as said third consonant, and said fourth intonation of said prefix and
said suffix being denoted by a
"f ' as said fourth consonant.
21. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer. as recited in claim 19, wherein said second intonation of said
prefix and said suffix is denoted
by a "~" as said second consonant, said third intonation of said prefix and
said suffix being denoted by a
"~" as said third consonant, and said fourth intonation of said prefix and
said suffix being denoted by a
"~" as said fourth consonant.
22. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 1, after said step (c), further comprising an
additional step of adding at
least a marker after a last alphabet of said prefix and a last alphabet of
said suffix of said spelled surrogate
word respectively for distinguishing homonymous characters.
23. A method for convening non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 22, wherein said marker of said prefix is a
repeated alphabet of said last
alphabet of said prefix and said marker of said suffix is a repeated alphabet
of said last alphabet of said
suffix.
24. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 17, after said step (c), further comprising a
second additional step of
adding at least a marker after a last alphabet of said prefix and a last
alphabet of said suffix of said spelled
surrogate word respectively for distinguishing homonymous characters.
25. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 24, wherein said marker of said prefix is a
repeated alphabet of said last
alphabet of said prefix and said marker of said suffix is a repeated alphabet
of said last alphabet of said
suffix.
26. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 18, after said step (c), further comprising a
second additional step of
adding at least a marker after a last alphabet of said prefix and a last
alphabet of said suffix of said spelled
surrogate word respectively for distinguishing homonymous characters.
27. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 26, wherein said marker of said prefix is a
repeated alphabet of said last
alphabet of said prefix and said marker of said suffix is a repeated alphabet
of said last alphabet of said
suffix.
28. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 19, after said step (c), further comprising a
second additional step of
adding at least a marker after a last alphabet of said prefix and a last
alphabet of said suffix of said spelled
surrogate word respectively for distinguishing homonymous characters.
29. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 28, wherein said marker of said prefix is a
repeated alphabet of said last




alphabet of said prefix and said marker of said suffix is a repeated alphabet
of said last alphabet of said
suffix.
30. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 1, 2, 3, 4, 5, 6, 7, 8, 9, 17, 22, 23, 24, or
25, wherein, in step (c), further
comprising an additional step of separating said prefix and said suffix with a
separating mark,
31. A method for convening non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 30, wherein, in step (c), said separating mark
is a hyphen mark.
32. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 30, wherein, in step (c), said separating mark
is a space mark.
33. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 30, wherein, in step (c), said separating mark
is an asterisk mark.
34. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 10, wherein, in step (c), further comprising
an additional step of separating
said prefix and said suffix with a separating mark.
35. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 34, wherein, in step (c), said separating mark
is a hyphen mark.
36. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 34, wherein, in step (c), said separating mark
is a space mark.
37. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 34, wherein, in step (c), said separating mark
is an asterisk mark.
38. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 11, wherein, in step (c), further comprising
an additional step of separating
said prefix and said suffix with a separating mark.
39. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 38, wherein, in step (c), said separating mark
is a hyphen mark.
40. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 38, wherein, in step (c), said separating mark
is a space mark.
41. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 38, wherein, in step (c), said separating mark
is an asterisk mark.
42. A method for conversing non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 12, wherein, in step (c), further comprising
an additional step of separating
said prefix and said suffix with a separating mark.
43. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 42, wherein, in step (c), said separating mark
is a hyphen mark.
44. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 42, wherein, in step (c), said separating mark
is a space mark.
45. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 42, wherein, in step (c), said separating mark
is an asterisk mark.
26




46. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 18, wherein, in step (c), further comprising
an additional step of separating
said prefix and said suffix with a separating mark.
47. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 46, wherein, in step (c), said separating mark
is a hyphen mark.
48. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 46, wherein, in step (c), said separating mark
is a space mark.
49. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 46, wherein, in step (c), said separating mark
is an asterisk mark.
50. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 19, wherein. in step (c), further comprising
an additional step of separating
said prefix and said suffix with a separating mark.
51. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 50, wherein. in step (c), said separating mark
is a hyphen mark.
52. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 50, wherein, in step (c), said separating mark
is a space mark.
53. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 50, wherein, in step (c), said separating mark
is an asterisk mark.
54. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 20, wherein, in step (c), further comprising
an additional step of separating
said prefix and said suffix with a separating mark.
55. A method for convening non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 54, wherein, in step (c), said separating mark
is a hyphen mark.
56. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 54, wherein, in step (c), said separating mark
is a space mark.
57. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 54, wherein, in step (c), said separating mark
is an asterisk mark.
58. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 21, wherein, in step (c), further comprising
an additional step of separating
said prefix and said suffix with a separating mark.
59. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 58, wherein, in step (c), said separating mark
is a hyphen mark.
60. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 58, wherein, in step (c), said separating mark
is a space mark.
61. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 58, wherein, in step (c), said separating mark
is an asterisk mark.
27




62. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 26, wherein, in step (c), further comprising
an additional step of separating
said prefix and said suffix with a separating mark.
63. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 62. wherein, in step (c), said separating mark
is a hyphen mark.
64. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 62, wherein, in step (c), said separating mark
is a space mark.
65. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 62, wherein, in step (c), said separating mark
is an asterisk mark.
66. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 27, wherein, in step (c), further comprising
an additional step of separating
said prefix and said suffix with a separating mark.
67. A method for convening non-phonetic characters into surrogate words for
inputting into
a computer. as recited in claim 66. wherein, in step (c), said separating mark
is a hyphen mark.
68. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 66. wherein, in step (c), said separating mark
is a space mark.
69. A method for convening non-phonetic characters into surrogate words for
inputting into
a computer. as recited in claim 66, wherein, in step (c), said separating mark
is an asterisk mark.
70. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 28, wherein, in step (c), further comprising
an additional step of separating
said prefix and said suffix with a separating mark.
71. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 70, wherein, in step (c), said separating mark
is a hyphen mark.
72. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 70, wherein, in step (c), said separating mark
is a space mark.
73. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 70, wherein, in step (c), said separating mark
is an asterisk mark.
74. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 29, wherein. in step (c), further comprising
an additional step of separating
said prefix and said suffix with a separating mark.
75. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 74, wherein, in step (c), said separating mark
is a hyphen mark.
76. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 74, wherein, in step (c), said separating mark
is a space mark.
77. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 74, wherein, in step (c), said separating mark
is an asterisk mark.
78. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 1, in which, after step (c), further
comprising the steps of
28




(d1) illustrating the prefix of the surrogate word by a visual picture which
represents the
meaning of the pictographic/ideographic radical represented by the prefix;
(d2) illustrating the meaning of the non-phonetic by a corresponding meaning
visual picture;
and
(d3) combining the prefix visual picture with the character meaning visual
picture.
79. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 1, in which each of said surrogate words is
input into the computer by
inputting a spelling of said prefix and then a spelling of said suffix into
the computer.
80. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in 1, 2, 3, 4, 5, 6, 7, 8, or 9, after step (c),
further comprising an inputting method
for inputting said non-phonetic character into said computer, which comprises
the steps of: (1) typing said
prefix of said surrogate word into said computer; and (2) typing said suffix
of said surrogate word into
said computer.
81. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 18, after step (c), further comprising an
inputting method for inputting said
non-phonetic character into said computer, which comprises the steps of: (1)
typing said prefix of said
surrogate word into said computer; (2) typing said indicator of said prefix
into said computer; (3) typing
said suffix of said surrogate word into said computer; and (4) typing said
indicator of said suffix into said
computer.
82. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 19, after step (c), further comprising an
inputting method for inputting said
non-phonetic character into said computer, which comprises the steps of: ( 1 )
typing said prefix of said
surrogate word into said computer; (2) typing said indicator of said prefix
into said computer; (3) typing
said suffix of said surrogate word into said computer; and (4) typing said
indicator of said suffix into said
computer.
83. A method fox converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 20, after step (c), further comprising an
inputting method for inputting said
non-phonetic character into said computer, which comprises the steps of: (1)
typing said prefix of said
surrogate word into said computer; (2) typing said indicator of said prefix
into said computer; (3) typing
said suffix of said surrogate word into said computer; and (4) typing said
indicator of said suffix into said
computer.
84. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 21, after step (c), further comprising an
inputting method for inputting said
non-phonetic character into said computer, which comprises the steps of: (1)
typing said prefix of said
surrogate word into said computer; (2) typing said indicator of said prefix
into said computer; (3) typing
said suffix of said surrogate word into said computer; and (4) typing said
indicator of said suffix into said
computer.
29




85. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 22, 23, 24, or 25, after said additional step
of adding said marker after said
last alphabet of said prefix and said last alphabet of said suffix of said
spelled surrogate word respectively,
further comprising an inputting method for inputting said non-phonetic
character into said computer,
which comprises the steps of: (1) typing said prefix of said surrogate word
into said computer; (2) typing
said indicator of said prefix into said computer; (3) typing said marker of
said prefix into said computer;
(4) typing said suffix of said surrogate word into said computer; (5) typing
said indicator of said suffix
into said computer; and (6) typing said marker of said suffix into said
computer.
86. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 26, after said second additional step, further
comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4)
typing said suffix of said
surrogate word into said computer; (5) typing said indicator of said suffix
into said computer; and (6)
typing said marker of said suffix into said computer.
87. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 27, after said second additional step, further
comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4)
typing said suffix of said
surrogate word into said computer; (5) typing said indicator of said suffix
into said computer; and (6)
typing said marker of said suffix into said computer.
88. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 28, after said second additional step, further
comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4}
typing said suffix of said
surrogate word into said computer; (5) typing said indicator of said suffix
into said computer; and (6)
typing said marker of said suffix into said computer.
89. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 29, after said second additional step, further
comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4)
typing said suffix of said
surrogate word into said computer; (5) typing said indicator of said suffix
into said computer; and (6)
typing said marker of said suffix into said computer.
90. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 30, after said second additional step, further
comprising an inputting




method for inputting said non-phonetic character into said computer, which
comprises the steps of. (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4)
typing said separating mark of
said surrogate word into said computer; (5) typing said suffix of said
surrogate word into said computer
(6) typing said indicator of said suffix into said computer; and (7) typing
said marker of said suffix into
said computer.
91. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 31, after said second additional step, further
comprising an inputting
method for inputting said non-phonetic character into said computer) which
comprises the steps of: (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4)
typing said separating mark of
said surrogate word into said computer;(5) typing said suffix of said
surrogate word into said computer;
(6) typing said indicator of said suffix into said computer; and (7) typing
said marker of said suffix into
said computer.
92. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 32, after said second additional step, further
comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4)
typing said separating mark of
said surrogate word into said computer;(5) typing said suffix of said
surrogate word into said computer;
(6) typing said indicator of said suffix into said computer; and (7) typing
said marker of said suffix into
said computer.
93. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 33, after said second additional step, further
comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4)
typing said separating mark of
said surrogate word into said computer; (5) typing said suffix of said
surrogate word into said computer;
(6) typing said indicator of said suffix into said computer; and (7) typing
said marker of said suffix into
said computer.
94. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in 1, 2, 3, 4, 5, 6, 7, 8, or 9, after step (c),
further comprising an inputting method
for inputting said non-phonetic character into said computer, which comprises
the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; and (2)
pronouncing said suffix of said surrogate word into said voice recognizing
system of said computer.
95. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 22, 23, 24, or 25, after said additional step
of adding said marker after said
last alphabet of said prefix and said last alphabet of said suffix of said
spelled surrogate word respectively,
31




further comprising an inputting method for inputting said non-phonetic
character into said computer,
which comprises the steps of: (1) pronouncing said prefix of said surrogate
word into a voice recognizing
system of said computer; (2) pronouncing said marker of said prefix into said
voice recognizing system of
said computer; (3) pronouncing said suffix of said surrogate word into said
voice recognizing system of
said computer; and (4) pronouncing said marker of said suffix into said voice
recognizing system of said
computer.
96. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 26. after said second additional step, further
comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said suffix of said surrogate word into said voice recognizing
system of said computer; and
(4) pronouncing said marker of said suffix into said voice recognizing system
of said computer.
97. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 27, after said second additional step. further
comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said suffix of said surrogate word into said voice recognizing
system of said computer; and
(4) pronouncing said marker of said suffix into said voice recognizing system
of said computer.
98. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 28, after said second additional step, further
comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said suffix of said surrogate word into said voice recognizing
system of said computer; and
(4) pronouncing said marker of said suffix into said voice recognizing system
of said computer.
99. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 29, after said second additional step, further
comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said suffix of said surrogate word into said voice recognizing
system of said computer; and
(4) pronouncing said marker of said suffix into said voice recognizing system
of said computer.
100. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 30, after said second additional step, further
comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
32




pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said separating mark of said surrogate word into said voice
recognizing system of said
computer; (4) pronouncing said suffix of said surrogate word into said voice
recognizing system of said
computer; and (5) pronouncing said marker of said suffix into said voice
recognizing system of said
computer.
101. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer. as recited in claim 31, after said second additional step, further
comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said separating mark of said surrogate word into said voice
recognizing system of said
computer; (4) pronouncing said suffix of said surrogate word into said voice
recognizing system of said
computer: and (5) pronouncing said marker of said suffix into said voice
recognizing system of said
computer.
102. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 32, after said second additional step, further
comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said separating mark of said surrogate word into said voice
recognizing system of said
computer; (4) pronouncing said suffix of said surrogate word into said voice
recognizing system of said
computer; and (5) pronouncing said marker of said suffix into said voice
recognizing system of said
computer.
103. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 33, after said second additional step, further
comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said separating mark of said surrogate word into said voice
recognizing system of said
computer; (4) pronouncing said suffix of said surrogate word into said voice
recognizing system of said
computer; and (5) pronouncing said marker of said suffix into said voice
recognizing system of said
computer.
104. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, comprising the steps of:
(a) alphabetizing a non-phonetic character of a language according to a
pronunciation of
said non-phonetic character to form a spelled prefix of a surrogate word;
33




(b) assigning a unique code to represent a pictographic/ideographic radical of
said non-phonetic
character of said respective language, wherein said unique code being used as
a suffix for said
surrogate word; and
(c) combining said prefix and said suffix together to constitute said
surrogate word
representing said character of said respective language.
105. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 104, wherein, in step (b), said unique code of
said suffix of said surrogate
word is a numeral code.
106. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 104, wherein, in step (b), said unique code of
said suffix of said surrogate
word is an alphabetic spelling of a phonetic word having a meaning of said
pictographic/ideographic
radical.
107 A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 104, wherein, in step (b), said unique code of
said suffix of said surrogate
word is an alphabetic spelling of a pronunciation of said
pictographic/ideographic radical.
108. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 104, wherein, in step (b), said unique code of
said suffix of said surrogate
word is an abbreviated form of an alphabetic spelling of a pronunciation of
said pictographic/ideographic
radical.
109. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 108, wherein said abbreviated form of said
suffix of said surrogate word is
a consonant of said alphabetic spelling of said pronunciation of said
pictographic/ideographic radical.
110. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 108, wherein said abbreviated form of said
suffix of said surrogate word is
a first alphabet of said alphabetic spelling of said pronunciation of said
pictographic/ideographic radical.
111. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 108, wherein said abbreviated form of said
suffix of said surrogate word is
a last alphabet of said alphabetic spelling of said pronunciation of said
pictographic/ideographic radical.
112. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 104, wherein, in step (a), said character of
said respective language is
alphabetized according to a pronunciation of a phonetic radical of said
character to form said prefix of said
surrogate word.
113. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 107, 108 or 112, wherein said
pictographic/ideographic radical and said
phonetic radical are alphabetized according to a pronunciation with Latin
alphabets.
114. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 107, 108 or 112, wherein said
pictographic/ideographic radical and said
34




phonetic radical are alphabetized according to a pronunciation with English-
style alphabets conforming to
a Pinyin system.

115. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 107, 108 or 112, wherein said
pictographic/ideographic radical and said
phonetic radical are alphabetized according to a pronunciation with native
alphabets.

116. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 115, wherein said pictographic/ideographic
radical and said phonetic
radical are alphabetized according to a pronunciation with zhuyin zimu
conforming to a Chinese Zhuyin
system.

117. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 115, wherein said pictographic/ideographic
radical and said phonetic
radical are alphabetized according to a pronunciation conforming to a Japanese
Hiragana system.

118. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 115, wherein said pictographic/ideographic
radical and said phonetic
radical are alphabetized according to a pronunciation conforming to a Japanese
Katagana system.

119. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 115, wherein said pictographic/ideographic
radical and said phonetic
radical are alphabetized according to a pronunciation conforming to a Korean
Hangul system.

120. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 104, before said step (c), further comprising
a first additional step of
indicating an intonation of said suffix with a predetermined consonant as an
indicator placed at the end
said spelling of said suffix.

121. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 107, 108 or 112, before said step (c), further
comprising a first additional
step of indicating an intonation of said prefix and said suffix respectively
with a predetermined consonant
as an indicator placed at the end of said spelling of said prefix and said
suffix.

122. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 121, wherein a first intonation of said prefix
and said suffix bear no
indicator, a second intonation of said prefix and said suffix being denoted by
a second consonant, a third
intonation of said prefix and said suffix being denoted by a third consonant,
a fourth intonation of said
prefix and said suffix being denoted by a fourth consonant.

123. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 122, wherein said second intonation of said
prefix and said suffix is
denoted by a "p" as said second consonant, said third intonation of said
prefix and said suffix being
denoted by a "m" as said third consonant, and said fourth intonation of said
prefix and said suffix being
denoted by a "f" as said fourth consonant.

124. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 122, wherein said second intonation of said
prefix and said suffix is


35




denoted by a "~" as said second consonant, said third intonation of said
prefix and said suffix being
denoted by a "~" as said third consonant, and said fourth intonation of said
prefix and said suffix being
denoted by a "~" as said fourth consonant.

125. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 104, after said step (c), further comprising
an additional step of adding at
least a marker after a last alphabet of said prefix and a last alphabet of
said suffix of said spelled surrogate
word respectively for distinguishing homonymous characters.

126. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 125, wherein said marker of said prefix is a
repeated alphabet of said last
alphabet of said prefix and said marker of said suffix is a repeated alphabet
of said last alphabet of said
suffix.

127. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 120, after said step (c), further comprising a
second additional step of
adding at least a marker after a last alphabet of said prefix and a last
alphabet of said suffix of said spelled
surrogate word respectively for distinguishing homonymous characters.

128. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 127, wherein said marker of said prefix is a
repeated alphabet of said last
alphabet of said prefix and said marker of said suffix is a repeated alphabet
of said last alphabet of said
suffix.

129. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 121, after said step (c), further comprising a
second additional step of
adding at least a marker after a last alphabet of said prefix and a last
alphabet of said suffix of said spelled
surrogate word respectively for distinguishing homonymous characters.

130. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 129, wherein said marker of said prefix is a
repeated alphabet of said last
alphabet of said prefix and said marker of said suffix is a repeated alphabet
of said last alphabet of said
suffix.

131. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 122, after said step (c), further comprising a
second additional step of
adding at least a marker after a last alphabet of said prefix and a last
alphabet of said suffix of said spelled
surrogate word respectively for distinguishing homonymous characters.

132. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 131, wherein said marker of said prefix is a
repeated alphabet of said last
alphabet of said prefix and said marker of said suffix is a repeated alphabet
of said last alphabet of said
suffix.

133. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 104, 105, 106, 107, 108, 109, 110, 111, 112,
120, 125, 126, 127, or 128,


36




wherein, in step (c), further comprising an additional step of separating said
prefix and said suffix with a
separating mark.

134. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 133, wherein, in step (c), said separating
mark is a hyphen mark.

135. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 133, wherein, in step (c), said separating
mark is a space mark.

136. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 133, wherein, in step (c), said separating
mark is an asterisk mark.

137. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 113, wherein, in step (c), further comprising
an additional step of
separating said prefix and said suffix with a separating mark.

138. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 137, wherein, in step (c)) said separating
mark is a hyphen mark.

139. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 137, wherein, in step (c), said separating
mark is a space mark.

140. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 137, wherein, in step (c), said separating
mark is an asterisk mark.

141. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 114, wherein, in step (c), further comprising
an additional step of
separating said prefix and said suffix with a separating mark.

142. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 141, wherein, in step (c), said separating
mark is a hyphen mark.

143. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 141, wherein, in step (c), said separating
mark is a space mark.

144. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 141, wherein, in step (c), said separating
mark is an asterisk mark.

145. A method for converting non-phonetic characters into surrogate words far
inputting into
a computer, as recited in claim 115, wherein, in step (c), further comprising
an additional step of
separating said prefix and said suffix with a separating mark.

146. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 145, wherein, in step (c), said separating
mark is a hyphen mark.

147. A method for convening non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 145, wherein, in step (c), said separating
mark is a space mark.

148. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 145, wherein, in step (c), said separating
mark is an asterisk mark.

149. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 121, wherein, in step (c), further comprising
an additional step of
separating said prefix and said suffix with a separating mark.


37




150. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 149, wherein, in step (c), said separating
mark is a hyphen mark.

151. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 149, wherein, in step (c), said separating
mark is a space mark.

152. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 149, wherein, in step (c), said separating
mark is an asterisk mark.

153. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 122, wherein, in step (c), further comprising
an additional step of
separating said prefix and said suffix with a separating mark.

154. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 153, wherein, in step (c), said separating
mark is a hyphen mark.

155. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 153, wherein, in step (c), said separating
mark is a space mark.

156. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 153, wherein, in step (c), said separating
mark is an asterisk mark.

157. A method for convening non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 123, wherein, in step (c), further comprising
an additional step of
separating said prefix and said suffix with a separating mark.

158. A method for convening non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 157, wherein, in step (c), said separating
mark is a hyphen mark.

159. A method for convening non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 157, wherein. in step (c), said separating
mark is a space mark.

160. A method for convening non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 157, wherein, in step (c), said separating
mark is an asterisk mark.

161. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 124, wherein, in step (c), further comprising
an additional step of
separating said prefix and said suffix with a separating mark.

162. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 161, wherein, in step (c), said separating
mark is a hyphen mark.

163. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 161, wherein, in step (c), said separating
mark is a space mark.

164. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 161, wherein, in step (c), said separating
mark is an asterisk mark.

165. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 129, wherein, in step (c), further comprising
an additional step of
separating said prefix and said suffix with a separating mark.

166. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 165, wherein, in step (c), said separating
mark is a hyphen mark.


38




167. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 165, wherein, in step (c), said separating
mark is a space mark.

168. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 165, wherein, in step (c), said separating
mark is an asterisk mark.

169. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 130, wherein. in step (c), further comprising
an additional step of
separating said prefix and said suffix with a separating mark.

170. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 169, wherein, in step (c), said separating
mark is a hyphen mark.

171. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 169, wherein, in step (c), said separating
mark is a space mark.

172. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 169, wherein, in step (c), said separating
mark is an asterisk mark.

173. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer. as recited in claim 131, wherein, in step (c), further comprising
an additional step of
separating said prefix and said suffix with a separating mark.

174. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 173, wherein, in step (c), said separating
mark is a hyphen mark.

175. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 173, wherein, in step (c), said separating
mark is a space mark.

176. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim l73, wherein) in step (c), said separating
mark is an asterisk mark.

177. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 132, wherein, in step (c), further comprising
an additional step of
separating said prefix and said suffix with a separating mark.

178. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 177, wherein, in step (c), said separating
mark is a hyphen mark.

179. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 177, wherein, in step (c), said separating
mark is a space mark.

180. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 177, wherein, in step (c), said separating
mark is an asterisk mark.

181. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 104, in which, after step (c), further
comprising the steps of
(d1) illustrating the prefix of the surrogate word by a visual picture which
represents the
meaning of the pictographic/ideographic radical represented by the prefix;
(d2) illustrating the meaning of the non-phonetic by a corresponding meaning
visual picture;
and
(d3) combining the prefix visual picture with the character meaning visual
picture.


39




182. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in 104, 105, 106, 107, 108, 109, 110, 111, or 112,
after step (c), further comprising
an inputting method for inputting said non-phonetic character into said
computer, which comprises the
steps of: (1) typing said prefix of said surrogate word into said computer;
and (2) typing said suffix of
said surrogate word into said computer.

183. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 121, after step (c), further comprising an
inputting method for inputting
said non-phonetic character into said computer, which comprises the steps of:
(1) typing said prefix of
said surrogate word into said computer; (2) typing said indicator of said
prefix into said computer; (3)
typing said suffix of said surrogate word into said computer; and (4) typing
said indicator of said suffix
into said computer.

184. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 122, after step (c), further comprising an
inputting method for inputting
said non-phonetic character into said computer, which comprises the steps of:
(1) typing said prefix of
said surrogate word into said computer; (2) typing said indicator of said
prefix into said computer; (3)
typing said suffix of said surrogate word into said computer; and (4) typing
said indicator of said suffix
into said computer.

185. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 123, after step (c), further comprising an
inputting method for inputting
said non-phonetic character into said computer, which comprises the steps of:
(1) typing said prefix of
said surrogate word into said computer; (2) typing said indicator of said
prefix into said computer; (3)
typing said suffix of said surrogate word into said computer; and (4) typing
said indicator of said suffix
into said computer.

186. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 124, after step (c), further comprising an
inputting method for inputting
said non-phonetic character into said computer, which comprises the steps of:
(1) typing said prefix of
said surrogate word into said computer; (2) typing said indicator of said
prefix into said computer; (3)
typing said suffix of said surrogate word into said computer; and (4) typing
said indicator of said suffix
into said computer.

187. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 125, 126, 127, or 128, after said additional
step of adding said marker after
said last alphabet of said prefix and said last alphabet of said suffix of
said spelled surrogate word
respectively, further comprising an inputting method for inputting said non-
phonetic character into said
computer, which comprises the steps of: (1) typing said prefix of said
surrogate word into said computer;
(2) typing said indicator of said prefix into said computer; (3) typing said
marker of said prefix into said
computer; (4) typing said suffix of said surrogate word into said computer;
(5) typing said indicator of
said suffix into said computer; and (6) typing said marker of said suffix into
said computer.


40




188. A method for convening non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 129, after said second additional step,
further comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4)
typing said suffix of said
surrogate word into said computer; (5) typing said indicator of said suffix
into said computer; and (6)
typing said marker of said suffix into said computer.

189. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 130, after said second additional step,
further comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4)
typing said suffix of said
surrogate word into said computer; (5) typing said indicator of said suffix
into said computer; and (6)
typing said marker of said suffix into said computer.

190. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 131, after said second additional step,
further comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4)
typing said suffix of said
surrogate word into said computer; (5) typing said indicator of said suffix
into said computer; and (6)
typing said marker of said suffix into said computer.

191. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 132, after said second additional step,
further comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4)
typing said suffix of said
surrogate word into said computer; (5) typing said indicator of said suffix
into said computer: and (6)
typing said marker of said suffix into said computer.

192. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 133, after said second additional step,
further comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4)
typing said separating mark of
said surrogate word into said computer; (5) typing said suffix of said
surrogate word into said computer;
(6) typing said indicator of said suffix into said computer; and (7) typing
said marker of said suffix into
said computer.

193. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 134, after said second additional step,
further comprising an inputting


41



method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4)
typing said separating mark of
said surrogate word into said computer;(5) typing said suffix of said
surrogate word into said computer;
(6) typing said indicator of said suffix into said computer; and (7) typing
said marker of said suffix into
said computer.

194. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 135, after said second additional step,
further comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4)
typing said separating mark of
said surrogate word into said computer;(5) typing said suffix of said
surrogate word into said computer;
(6) typing said indicator of said suffix into said computer; and (7) typing
said marker of said suffix into
said computer.

195. A method for convening non-phonetic characters into surrogate words far
inputting into
a computer, as recited in claim 136, after said second additional step,
further comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
typing said prefix of said surrogate word into said computer; (2) typing said
indicator of said prefix into
said computer; (3) typing said marker of said prefix into said computer; (4)
typing said separating mark of
said surrogate word into said computer; (5) typing said suffix of said
surrogate word into said computer;
(6) typing said indicator of said suffix into said computer; and (7) typing
said marker of said suffix into
said computer.

196. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in 104, 105, 106, 107, 108, 109, 110, 111. or 112,
after step (c), further comprising
an inputting method for inputting said non-phonetic character into said
computer, which comprises the
steps of: (1) pronouncing said prefix of said surrogate word into a voice
recognizing system of said
computer; and (2) pronouncing said suffix of said surrogate word into said
voice recognizing system of
said computer.

197. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 125, 126, 127, or 128, after said additional
step of adding said marker after
said last alphabet of said prefix and said last alphabet of said suffix of
said spelled surrogate word
respectively, further comprising an inputting method for inputting said non-
phonetic character into said
computer, which comprises the steps of: (1) pronouncing said prefix of said
surrogate word into a voice
recognizing system of said computer; (2) pronouncing said marker of said
prefix into said voice
recognizing system of said computer; (3) pronouncing said suffix of said
surrogate word into said voice
recognizing system of said computer; and (4) pronouncing said marker of said
suffix into said voice
recognizing system of said computer.


42




198. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 129, after said second additional step,
further comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said suffix of said surrogate word into said voice recognizing
system of said computer; and
(4) pronouncing said marker of said suffix into said voice recognizing system
of said computer.

199. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer. as recited in claim 130, after said second additional step,
further comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said suffix of said surrogate word into said voice recognizing
system of said computer; and
(4) pronouncing said marker of said suffix into said voice recognizing system
of said computer.

200. A method for convening non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 131, after said second additional step,
further comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said suffix of said surrogate word into said voice recognizing
system of said computer; and
(4) pronouncing said marker of said suffix into said voice recognizing system
of said computer.

201. A method for converting non-phonetic characters into surrogate words far
inputting into
a computes, as recited in claim 132, after said second additional step,
further comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said suffix of said surrogate word into said voice recognizing
system of said computer; and
(4) pronouncing said marker of said suffix into said voice recognizing system
of said computer.

202. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 133, after said second additional step,
further comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said separating mark of said surrogate word into said voice
recognizing system of said
computer; (4) pronouncing said suffix of said surrogate word into said voice
recognizing system of said
computer; and (5) pronouncing said marker of said suffix into said voice
recognizing system of said
computer.


43




203. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 134, after said second additional step,
further comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said separating mark of said surrogate word into said voice
recognizing system of said
computer; (4) pronouncing said suffix of said surrogate word into said voice
recognizing system of said
computer; and (5) pronouncing said marker of said suffix into said voice
recognizing system of said
computer.

204. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 135, after said second additional step,
further comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said separating mark of said surrogate word into said voice
recognizing system of said
computer; (4) pronouncing said suffix of said surrogate word into said voice
recognizing system of said
computer; and (5) pronouncing said marker of said suffix into said voice
recognizing system of said
computer.

205. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 136, after said second additional step)
further comprising an inputting
method for inputting said non-phonetic character into said computer, which
comprises the steps of: (1)
pronouncing said prefix of said surrogate word into a voice recognizing system
of said computer; (2)
pronouncing said marker of said prefix into said voice recognizing system of
said computer; (3)
pronouncing said separating mark of said surrogate word into said voice
recognizing system of said
computer; (4) pronouncing said suffix of said surrogate word into said voice
recognizing system of said
computer; and (5) pronouncing said marker of said suffix into said voice
recognizing system of said
computer.

206. A method for converting non-phonetic characters into surrogate words for
inputting into
a computer, as recited in claim 104, in which each of said surrogate words is
input into the computer by
inputting a spelling of said prefix and then a spelling of said suffix into
the computer.

207. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, comprising the steps
of:
(a) alphabetizing each said non-phonetic character of said phrase according to
a
pronunciation of said non-phonetic character to form a spelled prefix for a
surrogate word of each said
non-phonetic character; and
(b) selecting a predetermined alphabet from each said prefix of each said non-
phonetic
character of said phrase and grouping said plurality of selected alphabets to
form an acronym of said
surrogate phrase.


44




208. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
207, wherein, in step (b), a first
alphabet is selected from each said prefix of each said non-phonetic character
of said phrase to form said
acronym of said surrogate phrase.

209. A method for convening a plurality of non-phonetic characters of a phrase
of a language
into a surrogate phrase for inputting into a computer. as recited in claim
207) wherein, in step (b), a last
alphabet is selected from each said prefix of each said non-phonetic character
of said phrase to form said
acronym of said surrogate phrase.

210. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
207, after step (b), further
comprising an additional step of repeating said last alphabet of said acronym
as a marker.

211. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
208, after step (b), further
comprising an additional step of repeating said last alphabet of said acronym
as a marker.

212. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
209, after step (b), further
comprising an additional step of repeating said last alphabet of said acronym
as a marker.

213. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
207, 208, or 209, after step (b),
further comprising the following steps of:
(c) alphabetizing a pictographic/ideographic radical of each said non-phonetic
character of
said phrase according to a pronunciation of said pictographic/ideographic
radical of each said non
phonetic character to form a spelled suffix of each said non-phonetic
character of said phrase;
(d) selecting a predetermined alphabet from each said suffix of each said non-
phonetic
character of said phrase and grouping said plurality of selected alphabets of
said suffixes of said
non-phonetic characters of said phrase to form a label of said surrogate
phrase; and
(e) combining said acronym and said label together to form said surrogate
phrase.

214. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
213, wherein, in step (e), said
acronym is placed in front of said label to form said surrogate phrase.

215. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
214, wherein said acronym is in
upper case alphabet and said label is in lower case alphabet when English-
style alphabet is used.

216. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
213, wherein, in step (e), said
label is placed in front of said acronym to form said surrogate phrase.


45




217. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer. as recited in claim
216, wherein said label is in
upper case alphabet and said acronym is in lower case alphabet when English-
style alphabet is used.

218. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
213, wherein, in step (e). each
said alphabet of said label is put ahead of each said alphabet of said acronym
to form said surrogate
phrase.

219. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
218, wherein said alphabets of
said label are in upper case alphabet and said alphabets of said acronym are
in lower case alphabet when
English-style alphabet is used.

220. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
213. wherein, in step (e), each
said alphabet of said acronym is put ahead of each said alphabet of said label
to form said surrogate
phrase.

221. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
220, wherein said alphabets of
said acronym are in upper case alphabet and said alphabets of said label are
in lower case alphabet when
English-style alphabet is used.

222. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
213. wherein, in step (d), a first
alphabet is selected from each said suffix of each said non-phonetic character
of said phrase to form said
label of said surrogate phrase.

223. A method for convening a plurality of non-phonetic characters of a phrase
of a language
into a surrogate phrase for inputting into a computer, as recited in claim
214, wherein, in step (d), a first
alphabet is selected from each said suffix of each said non-phonetic character
of said phrase to form said
label of said surrogate phrase.

224. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
2l6, wherein, in step (d), a first
alphabet is selected from each said suffix of each said non-phonetic character
of said phrase to form said
label of said surrogate phrase.

225. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
218) wherein, in step (d), a first
alphabet is selected from each said suffix of each said non-phonetic character
of said phrase to form said
label of said surrogate phrase.

226. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
220, wherein, in step (d), a first



46




alphabet is selected from each said suffix of each said non-phonetic character
of said phrase to form said
label of said surrogate phrase.

227. A method for convening a plurality of non-phonetic characters of a phrase
of a language
into a surrogate phrase for inputting into a computer, as recited in claim
213, wherein, in step (d), a last
alphabet is selected from each said suffix of each said non-phonetic character
of said phrase to form said
label of said surrogate phrase.

228. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
214, wherein, in step (d), a last
alphabet is selected from each said suffix of each said non-phonetic character
of said phrase to form said
label of said surrogate phrase.

229. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
216, wherein, in step (d), a last
alphabet is selected from each said suffix of each said non-phonetic character
of said phrase to form said
label of said surrogate phrase.

230. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
218, wherein, in step (d), a last
alphabet is selected from each said suffix of each said non-phonetic character
of said phrase to form said
label of said surrogate phrase.

231. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
220, wherein, in step (d), a last
alphabet is selected from each said suffix of each said non-phonetic character
of said phrase to form said
label of said surrogate phrase.

232. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
213) after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

233. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
214, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

234. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
216, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

235. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
218, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

236. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
220, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.


47




237. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
222, after step {e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

238. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
223, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

239. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
224, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

240. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
225, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

241. A method for converting a plurality of non-phonetic characters of a
please of a language
into a surrogate phrase for inputting into a computer. as recited in claim
226, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

242. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
227, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

243. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
228, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

244. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
229) after step (c), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

245. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
230, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

246. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
231, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

247. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
207, 208, or 209, after step (b),
further comprising the following steps of:
(c) alphabetizing an abbreviation of a pronunciation of a
pictographic/ideographic radical of
each said non-phonetic character of said phrase to form a spelled suffix of
each said non-phonetic
character of said phrase;


48




(d) selecting a predetermined alphabet from each said suffix of each said non-
phonetic
character of said phrase and grouping said plurality of selected alphabets of
said suffixes of said
non-phonetic characters of said phrase to form a label of said surrogate
phrase; and
(e) combining said acronym and said label together to form said surrogate
phrase.

248. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
247, wherein, in step (e), said
acronym is placed in front of said label to form said surrogate phrase.

249. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
248, wherein said acronym is in
upper case alphabet and said label is in lower case alphabet when English-
style alphabet is used.

250. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
247, wherein, in step (e), said
label is placed in front of said acronym to form said surrogate phrase.

251. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
250, wherein said label is in
upper case alphabet and said acronym is in lower case alphabet when English-
style alphabet is used.

252. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
247, wherein, in step (e), each
said alphabet of said label is put ahead of each said alphabet of said acronym
to form said surrogate
phrase.

253. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
252, wherein said alphabets of
said label are in upper case alphabet and said alphabets of said acronym are
in lower case alphabet when
English-style alphabet is used.

254. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
247, wherein, in step (e), each
said alphabet of said acronym is put ahead of each said alphabet of said label
to form said surrogate
phrase.

255. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
2S4, wherein said alphabets of
said acronym are in upper case alphabet and said alphabets of said label are
in lower case alphabet when
English-style alphabet is used.

256. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
247, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

257. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
248, after step (e}, further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.


49




258. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
250, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

259. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
252, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

260. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
254, after step (e), further
comprising an additional step (f) of repeating said last alphabet of said
label as a marker.

261. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
207, 208 or 209, wherein said
plurality of non-phonetic characters of said phrase of said language are input
into said computer by typing
said surrogate phrase thereof alphabet by alphabet.

262. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
207, 208 or 209, wherein said
plurality of non-phonetic characters of said phrase of said language are input
into said computer by
pronouncing said surrogate phrase thereof alphabet by alphabet into a voice
recognizing system of said
computer.

263. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
210, 211 or 212, wherein said
plurality of non-phonetic characters of said phrase of said language are input
into said computer by typing
said surrogate phrase and said marker thereof alphabet by alphabet.

264. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
210, 211 or 212, wherein said
plurality of non-phonetic characters of said phrase of said language are input
into said computer by
pronouncing said surrogate phrase and said marker thereof alphabet by alphabet
into a voice recognizing
system of said computer.

265. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer. as recited in claim
213, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.

266. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer. as recited in claim
213, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.

267. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
214, wherein said plurality of





non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.

268. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
214, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.

269. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
215, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.

270. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
215, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.

271. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
216, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.

272. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
216, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.

273. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
2l7, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.

274. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
217, wherein said plurality of
non phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.

275. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
218, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.

276. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
218, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.


51




277. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
219, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.

278. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
219, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.

279. A method for convening a plurality of non-phonetic characters of a phrase
of a language
into a surrogate phrase for inputting into a computer, as recited in claim
220, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.

280. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
220, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.

281. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
221, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.

282. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
221, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.

283. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
222, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.

284. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
222, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.

285. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
223, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.

286. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
223, wherein said plurality of


52



non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.

287. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
224, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.

288. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
225, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.

289. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
226, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.

290. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting info a computer, as recited in claim
226, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.

291. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
227, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.

292. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
227, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.

293. A method for convening a plurality of non-phonetic characters of a phrase
of a language
into a surrogate phrase for inputting into a computer, as recited in claim
228, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.

294. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
228, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.

295. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
229, wherein said plurality of
non-phonetic characters of said please of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.


53




296. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
229, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.
297. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
230, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.
298. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
230. wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.
299. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
231, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.
300. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
231, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.
301. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
232, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
302. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
232, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
303. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
233, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
304. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
233, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
54




305. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
234, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
306. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
234, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
307. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
235, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
308. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
235, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
309. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
236, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
310. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
236, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
311. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
237, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
312. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
237, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
313. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
238, wherein said plurality of




non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
314. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
238, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
315. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
239, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
316. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
239, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
317. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
240, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
318. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
240, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
319. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
241, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
320. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
241, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
321. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
242, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
56




322. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
242, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
323. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
243, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
324. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
243, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
325. A method for convening a plurality of non-phonetic characters of a phrase
of a language
into a surrogate phrase for inputting into a computer, as recited in claim
244, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
326. A method for convening a plurality of non-phonetic characters of a phrase
of a language
into a surrogate phrase for inputting into a computer, as recited in claim
244, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
327. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
245, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
328. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
245, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
329. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
246, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
330. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
246, wherein said plurality of
57




non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
331. A method for convening a plurality of non-phonetic characters of a phrase
of a language
into a surrogate phrase for inputting into a computer, as recited in claim
247, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.
332. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
247, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.
333. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
248, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.
334. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
248, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.
335. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
249, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.
336. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
249, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.
337. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
250, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.
338. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
250, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.
339. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
251, wherein said plurality of
58




non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.
340. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
251, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.
341. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
252, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.
342. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
252, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.
343. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
253, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.
344. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
253, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.
345. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
254, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.
346. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
254, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.
347. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
255, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase thereof alphabet by alphabet.
348. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
255, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase thereof alphabet by alphabet into a voice recognizing system
of said computer.
59




349. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
256, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
350. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
256, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
351. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
257, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
352. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
257, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
353. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
258, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
354. A method for convening a plurality of non-phonetic characters of a phrase
of a language
into a surrogate phrase for inputting into a computer, as recited in claim
258, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
355. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
259, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
356. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
259, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.
357. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
260, wherein said plurality of



non-phonetic characters of said phrase of said language are input into said
computer by typing said
surrogate phrase and said marker thereof alphabet by alphabet.
358. A method for converting a plurality of non-phonetic characters of a
phrase of a language
into a surrogate phrase for inputting into a computer, as recited in claim
260, wherein said plurality of
non-phonetic characters of said phrase of said language are input into said
computer by pronouncing said
surrogate phrase and said marker thereof alphabet by alphabet into a voice
recognizing system of said
computer.



61

Description

CA 02270956 1999-OS-OS
WO 98I20429 PCT/US96/19780 '
Title
Method for Converting Non-phonetic Characters into Surrogate Words for
Inputting into a
Computer
Background of the Present Invention
The present invention relates to written non-phonetic characters of oriental
languages, such as
Chinese, Japanese, Korean language, Indian language, and etc., and more
particularly to a conversion
method of creating new surrogate words to precisely represent such non-
phonetic characters used in
written oriental languages, in which the surrogate words are words created
with either English-style or
native alphabets in the present invention to represent non-phonetic characters
used in the Chinese,
3apanese and Korean languages. Therefore) the non-phonetic characters can be
easily inputted into in a
computer duough an English-style or native alphabetic keyboard, a mouse or
other phonetic inputting
method. Moreover, such new surrogate words can be stored in a computer and
precisely transmitted by E-
mail (Electronic Mail).
Non-phonetic characters of Chinese languages were derived from pictures by the
ancient
Chinese to express themselves thousands of years ago. These characters have
gone through many changes
over their long history, from pictures of the subjects they described in the
ancient times to the uniformly
square shapes of today. The Koreans and the Japanese adopted and incorporated
the Chinese characters
into their languages, although they do not necessarily pronounce or use all
the characters the same way as
the Chinese do. The majority of the characters used by these two peoples have
the same or similar
meaning as they do in the Chinese language. Nowadays, most of the characters
are consisted of two parts,
i.e. one denotes the meaning, usually referred to as the pictogram when this
part resembles something, or
referred to as the ideogram when this part bears some of the meaning of the
character. The other denotes
the pronunciation, usually referred to as phonetic radical. In Chinese
language, the pronunciation of a
character is monosyllabic, meaning one sound for each character.
The ideogram is a symbol that can be either a character or pan of a character,
which denotes
the meaning of that character by inference. Pure ideograms are rare. However
they can be found in many
characters that do not have phonetic radicals but instead) have two or more
pictograms combined to infer a
meaning that can be understood by the readers. The pronunciation of this kind
of characters must be
memorized, since there are no phonetic radicals present in this kind of
characters. When the ideogram is
used as a radical of a character, it is silent. The following are some
examples of the ideogram.
(1) l3Jj is made of the sun, p , and the moon, ~, therefore it means bright.
(2) ~ is consisted
of abundant, ~ and color, ~, therefore it means strikingly beautiful. (3 ) ~(~
is the combination of a son) ~
and a daughter, ~', hence it means good. (4) ~ is made of combination of silk,
~ and small squares of
rice field, ~, therefore it means tiny and fine. (5) ~c is made of two trees,
~, therefore it means woods.
The pictogram is a symbol that is either a character or part of a character,
wluch is the
approximate likeness of an object the character described. The pictograms are
more common than the
ideograms since the Chinese characters evolved from pictures. When the
pictogram is used as a part of a
character, it is silent. For example, ,~ for bird, i~, for horse, and 7(c for
wood or tree.
1


CA 02270956 1999-OS-OS
WO 98l20429 PCT/US96l19780 ~ ~ -
A pictogram not only bears the meaning of the character of which it is a part,
but also
expresses the meaning by showing the physical likeness of the object the
character described. This affords
the character to be easily recognized and understood.
The radical is a part of a character. There are usually two kinds of radicals
in a character. One
denotes the meaning and the other denotes the pronunciation of the character.
The former is known as a
pictogram or ideogram depending on its shape or what it stands for. Lf the
shape resembles an object, it is
called pictogram. If it does not resemble anything but has a meaning derived
from other uses, or from
inference, it is called ideogram. They remain silent when the character is
pronounced. Another kind of
radical is known as a phonetic radical that bears the actual or approximate
pronunciation of the character,
hence it is sounded.
Sometimes, a character can be used as a radical, such as ( 1 ) ~ in , . ( 2 )
~ in ~, ~, .
This kind of radicals are mostly used as phonetic radicals. Very often, a
radical can be used as a character,
such as ~, ~-, 7~.
Another unique feature in colloquial Chinese language is that it allows four
ways to pronounce
a given phonetic. i.e. four intonations. The total combinations of
pronunciations and intonations in
Chinese language are about I,544. This compares to about 13,200 commonly used
characters.
Theoretically speaking, each pronunciation/intonation combination represents
about 8 to 9 characters. In
reality, a lot of pronunciation/intonation combinations are not adequately
used or not used at all.
Furthermore, the Chinese people seem to over-use some of the combinations)
such as ji, gi and xi. Such
uneven usage causes certain combinations to represent more than 50 characters.
The applicant calls this
phenomenon over representation, a problem that renders oriental languages
(including Chinese, Japanese,
Korean, and Indian languages) very difficult to be computerized in their
original forms.
For example, there are 99 Chinese characters, such as ~Jj" J~[" , ~,, ~, ~, )
~' , ~, , ,
, etc., having the same
pronunciation/intonation combination of j!. There are 69 Chinese characters,
such as , , ~, ~, ,
~. , -~, > ~J, ~, ~, ~> ll~, ~, d~, ,~, ~, i~, SFr, Ta, , ~, ~, z" ~> etc.,
having the same
pronunciation/intonation combination of qi. There are 67 Chinese characters,
such as ~~, , " , ~ ,
,~,te"'~T, U, ~, ~f, I~, pJ5't, ~, , ,~, ~, ~,etc. , having the same
pronunciation/ intonation combination
of xi.
Currently, the oriental languages, such as Chinese, Japanese, Korean language,
and Indian
language, use thousands of characters which is in contract to the English
language's 26 alphabets,
therefore the computerization of such oriental languages is a substantial
problem. Obviously, it is
absolutely impractical to have a typewriter keyboard consisting of thousands
of keys. Thus, the input of the
oriental characters into the computers or word processors becomes an extremely
hard task.
Generally speaking, there are two major systems of computer inputting method
for the oriental
languages, i.e. the "shape" system and the "phonetic" system. The "shape"
system, such as the
"CHANGJEI" or "DA YI" input system for Chinese, designates a plurality of
shape symbols according to
the shapes of the radicals of the characters, in which each combination of the
shape symbols represents an
2


CA 02270956 1999-OS-OS
WO 98/20429 PCT/LFS96/19780
unique characters. The drawback of the "shape" system is really difficult to
learn and use. The users have
to study the specific way of how to divide each character into predetermined
shape symbols and learn by
heart thousands of shape symbols representing different characters. Although
the shape system enables the
user to precisely input the specific character into the computer or word
processor, only a tiny portion of
skilled people such as the professional typists who received special, and
intensive training can utilize such
"shape" system. Ordinary people are unable to input even one character by
utilizing the "shape" system.
Besides, the learning process of the "shape" system is so complicated that
most business people are unable
to spend so much time to learn by heart a11 the input codes of the "shape"
system. In other words, the
"shape" system is designed for those people whose career are computer data
typists only. Furthermore, the
"shape" system inputs and stores each character by 2 bites. However, during
electronic transmission, such
as E-mail, the transmitting unit is single byte only, so that any information
or data inputted by the "shape"
system is unable to E-mail through Internet. In other words) those oriental
people whose written language
is not a phonetic one such as English have little or no chance to enjoy the
convenience of E-mail and
Internet.
The "phonetic" system, such as the "PIN YIN" or "ZHUYIN' input system for
Chinese, as
shown in Fig. l, enables the user to input the pronunciation of the character
by typing the corresponding
Latin-style alphabets adopted to represent consonants and vowels in Chinese or
zhuyin zimu into the
computer, therefore most people can utilize these methods without any
training. Basically, pin yin is the
Chinese pronunciation for spelling. Here the term implies "spelling with Latin-
style alphabets". The pin
yin system generally refers to the Draft Plan of Chinese Language Phonetic
Spelling announced by the
Committee for Chinese Characters Reform in February of 195G. These alphabets
are listed alongside the
zhuyin zimu in Fig. 1. The zhuyin zimu comprises thirty-six Chinese
characters, with very few strokes
each) which were chosen to represent consonants and vowels in Chinese language
by the Chinese
Ministry of Education in the spring of 1913. Zhuyin zimu is still commonly
used in Taiwan for the purpose
of teaching the pronunciation of the Chinese characters. In mainland China)
however, the pin yin system
has replaced zhuyin zimu. Please refer to Figs. 1 and 4.
As mentioned above, for oriental languages, it is very common that a plurality
of different
characters have the same pronunciation. In other words, one single set of pin
yin or zhuyin zimu codes
may represent a plurality of different characters. Therefore, after a set of
pin yin or zhuyin zimu codes is
keyed-in, either the "PIN YIN' or the "ZHUYIN ZIMI1" system will provide
numerous characters for the
user to select the exact character therefrom. For example, the pin yin of "Jk"
is ''ji". Therefore, if the user
would like to key-in a character "J~" which means "and", the user can key-in
the alphabets j and i.
. However, there are approximately 99 Chinese characters, such as ~f~" IL, , ,
i~, l~, ~'t, ~, , , B~,
> ~lL> > ,~, ~c, , ~, ~~, ~,> 1'X, ~fc> , ~ °, , etc., sharing the
identical
pronunciation/intonation combination of ji. The user needs to further search
for the precise character "7~"
from the 99 homonymous characters appeared on the computer screen. Obviously,
both the "PIN YIN"
and "ZHUYIN" systems are too cumbersome and impractical. Moreover, for the
reason mentioned above,
neither the'~PIN YIN" system nor the "ZFiIJYIN' system is adapted for
transmission through E-mail.
3


CA 02270956 1999-OS-OS
WO 98I20429 PCT/US96/19780
Nowadays, the most efficient and commonly used tool for information
transmission is the E-
mail. Large quantity of data and information can be transmitted all over the
world instantly. People can
transmit or achieve unlimited information and knowledge instantly through the
E-mail. However, those
countries and people using oriental languages still can not discover any input
method which is adapted to
be E-mail. This unsolved situation may deeply resist the cultural and
commercial development between the
Asia and the Western societies.
Moreover, having been around for thousands of years) the Chinese culture
produced huge
numbers of idioms and proverbs that are quoted daily by hundreds of millions
of people throughout East
Asia and other places where Chinese, Japanese and Korean languages are taught
or used. It will be a boon
to the computer users who routinely process one of these languages to have a
fast yet accurate means to
input these frequently quoted phrases and sentences into the computers.
Those existing methods to input commonly used phrases and sentences written in
Chinese or
Kanji characters consists the following steps:
(1) Alphabetizing the Chinese or Kanji characters according to their
pronunciation in the
respective language) and
(2) Typing the first alphabet of the spelling of each Chinese or Kanji
character of the phrase
to form an acronym on the keyboard of a computer wluch is equipped with a
software that can interpret
the acronyms and display the correspondent Chinese characters.
This method works fine when the pronunciation of a phrase is unique, but in
real life, there are
large number of phrases, especially the ones containing less than four
characters, having identical
pronunciation (homonymous). To compensate this problem of large number of
homonyms, the software
engineers design their program to display the phrases in Chinese characters,
at the bottom of the screen for
the typist to select the one he or she desires. If the desired phrase or
sentence is not there, the typist can
hit the down arrow key to invoke the next phrase or sentence until the desired
one is found. This
searching or selection process makes the existing method cumbersome, time
consuming and, sometimes
frustrating.
Accordingly) the learning and memorizing of the Chinese or Kanji characters is
so ineffective
that even an average student at 4th grade in China or Taiwan cannot express
himself or herself clearly in
Chinese characters. This has been largely blamed on the 'complexity' of the
Chinese characters, and the
public have been accepting this theory for over a thousand years. The
situation can only be improved
dramatically with a visual, audio or multimedia tool to expedite the learning
process and consolidate what
has already been learnt.
Summary of the Present Invention
The main object of the present invention is to provide a method for
specifically converting non-
3 5 phonetic characters representing vocabulary in languages into surrogate
words for inputting into a
computer. Such newly created surrogate words are unique for and can precisely
represent the non-phonetic
characters used in the written oriental languages such as Chinese, Japanese,
Korean language, and Indian
language, thus facilitating the easy input of the information in these
languages into a computer.
4


CA 02270956 1999-OS-OS
WO 98/Z0429 PCT/US96/19780
Another object of the present invention is to provide a method for
specifically converting non-
phonetic characters representing vocabulary in languages into surrogate words
for inputting into a
computer, in which such newly created surrogate words are adapted to be
transmitted through E-mail
without losing any information.
Another object of the present invention is to provide a method for
specifically converting non-
phonetic characters representing vocabulary in languages into surrogate words
for inputting into a
computer, which paves the way for incorporating the voice recognizing and
generating technology into
computers processing information in the oriental languages.
Another object of the present invention is to provide a method for
specifically converting non
phonetic characters representing vocabulary in languages into surrogate words
for inputting into a
computer, wherein a voice recognizing computer can be built using a sound card
and a software as in
usual manner to train it to understand a person's pronunciation of each word
in such a manner that first
the prefix, then the indicator if applies, then the separating mark (hyphen),
then the suffix, then the
markers) if applicable. Of course, the reversed combination described above
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
prefix. Therefore, the user can input an article into a computer by voice.
Another object of the present invention is to provide a method for
specifically converting non-
phonetic characters representing vocabulary in languages into surrogate words
far inputting into a
compute which is equipped with a voice generating system having a same sound
card and a software that
can pronounce the suffices of the surrogate words accurately, so that the
computer can read out a
document for the user to edit and print. Accordingly, die users need not spend
time and effort to go over
and check the document character by character for possible typing errors. This
function can also help those
people who can speak but cannot write or read the respective non-phonetic
language to check their
document which is inputted into the computer through the conversion method of
the present invention.
Another object of the present invention is to provide a method for
specifically converting non-
phonetic characters representing vocabulary in languages into surrogate words
for inputting into a
computer. Such method enables both the Western and Eastern people to input
oriental languages easily
and precisely without any complicated learning process.
Another object of the present invention is to provide a method for
specifically converting non-
phonetic characters representing vocabulary in languages into surrogate words
for inputting into a
computer, which facilitates the input of the phrases and sentences into the
computer.
Another object of the present invention is to provide a method for
specifically converting non-
phonetic characters representing vocabulary in languages into surrogate words
for inputting into a
computer, in which such method can also be utilized to teach speaking, reading
and writing of a language
whose written form is non-phonetic by using the theories and logic of the
present invention.
Another object of the present invention is to provide a method for
specifically converting non-
phonetic characters representing vocabulary in languages into surrogate words
for inputting into a
computer, in which base on the converting method of the present invention) the
using of the
5


CA 02270956 1999-OS-OS
WO 98/20429 PCT/LTS96/19780
pictographic/ideographic radical as a prefix of the surrogate word can
establish a helpful process for the
children to memorize the Chinese or Kanji characters easily.
Accordingly) a method for specifically converting non-phonetic characters
representing
vocabulary in languages into surrogate words for inputting into a computer
comprises the steps of:
(a) 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;
(b) alphabetizing the character according to its pronunciation in the
respective language,
with the resulting spelling then being used as a spelled suffix for the newly
created surrogate word; and
(c) combining the prefix and suffix together to form a surrogate word for the
specific
"character" used in the written form of the respective language.
In order to distinguish the prefix and die suff x in a surrogate word to avoid
any confusion to
the user. the above step (c) further comprises a distinction step of
separating the prefix and the suffix with
a separating mark, such as a hyphen "-' or a space inserting between the
prefix and the su$ix of the
surrogate word.
With respect to the Chinese language which has intonations) for the new
surrogate words in
Chinese, the intonations of the pronunciation of the prefixes and suffixes are
indicated with selected
consonants as indicators.
For pictograms/ideograms with the same pronunciation and intonation, the last
alphabet of the
spelling for the specific pictogram/ideogram is repeated either once, twice or
thrice, the repeated alphabets
being treated just as extra alphabets for distinguishing the radicals they
represent and have no bearing on
the pronunciation of the radicals.
When the new surrogate words are pronounced, the prefixes are to be treated
like the
pictograms or ideograms that they represent silent. Just as the phonetic
radicals they represent, the su>f xes
are sounded. If the pronunciation of a Chinese prefix is unique, the indicator
for its intonation is
exempted. Since the sui~ixes are sounded, the demand for accuracy dictates
that the indicator for the
intonations should be present at all times with su~3xes except when the
intonation is the first one of four.
Brief Description of the Drawings
Fig. 1 is a chart for illustrating the Pin Yin alphabets and Zhuyin Zimu.
Fig. 2 is a chart for illustrating the Katakana, Hiragana and their English
Equivalent.
Fig. 3 is a chart for illustrating the Hangul and their English Equivalent.
Figs. 4-I to 4-1 I are a continuous chart for illustrating the 214 p/i
radicals of Chinese language and the
spelled surrogate prefix for each p/i radical, in which various systems of
surrogate prefix can be obtained
by Literary pronunciation, Habitual pronunciation, simplified special keys)
(both pinyin alphabets and
zhuyin zimu) for computer input, and some simplified optional key for computer
input.
Fig. 5 is a chart for illustrating a plurality of Chinese characters having
the identical pronunciation of ji,
wherein each character is precisely represented by a unique surrogate word
achieved by the three steps of
the conversion method of the present invention.
6


CA 02270956 1999-OS-OS
WO 98I20429
PCT/US96/19780
Fig. 6 is a chart for illustrating the five steps used to convert the Chinese
characters into surrogate words
in English-style alphabets and Zhuyin Zimu according to the present invention.
Fig. 7 is a chart for illustrating the five steps used to convert the Japanese
characters into surrogate words
in English-style alphabets, Katakana and Hiragana according to the present
invention.
Fig. 8 is a chart for illustrating the five steps used to convert the Korean
characters into surrogate words in
English-style alphabets and Hangul according to the present invention.
Fig. 9 is a chart for illustrating the changes made to the alphabets used in
the Pin Yin system according to
the present invention.
Fig. 10 is a chart for illustrating the steps used to convert the Chinese
phrases into surrogate phrases in
English-style alphabets according to the present invention.
Fig. 11 is a chart for illustrating the steps used to convert the Chinese
phrases into surrogate phrases in
Zhuyin Zimu according to the present invention.
Fig. 12 is a chart for illustrating the steps used to convert the phrases of
the Chinese characters used by the
Japanese phrases into surrogate phrases in English-style alphabets. Hiragana
and Katakana according to
the present invention.
Fig. 13 is a chart for illustrating the steps used to convert the phrases of
Chinese characters used by the
Korean phrases into surrogate phrases in English-style alphabets and Hangul
according to the present
invention.
Fig. 14 is a chart for introducing how the pictographic/ideographic radicals
be illustrated visually.
Detailed Description of the Preferred Embodiment
The Chinese, the written form of Japanese and Korean languages which are
derived from the
Chinese, and even the Indian languages are constituted by non-phonetic
characters. The present invention
provides a method to convert such non-phonetic characters into phonetic
components by using existing or
newly created phonetic symbols. The phonetic symbols are the visual signs to
represent the phonetic
components, consonants and vowels. They can be Latin-style or English-style
alphabets and native
alphabets such as Zhuyin Zimu, Katakana, Hiragaua, Hangul, and etc.. Phonetic
symbols can also be
created by designating a set of signs to represent consonants, vowels and
intonations of any languages.
The purpose of the conversion method of the present invention is to enable the
computerization
of these languages. The phonetic symbols can be English-style alphabets,
native alphabets such as Zhuyin
Zimu, Katakana, Hiragana, Hangul or newly created signs or symbols. Each non-
phonetic character is
then converted to a unique and newly spelled "surrogate word" by the
conversion process disclosed in the
present invention. The newly spelled surrogate words can precisely represent
the characters used in the
respective language. Please refer to Figs. l, 2 and 3 for these phonetic
symbols and Figs. 6, 7 and 8 for the
spelled surrogate words constituted of these phonetic symbols. These three
charts, as shown in Figs. 6, 7
and 8, can be seen as a summary of this conversion process.
Generally speaking, each non-phonetic character, such as each typical Chinese
character, is
constituted by a pictographic or ideographic radical (reciting as "p/i
radical" in the following description)
denoting the meaning of the character and a phonetic radical denoting the
pronunciation or the
7


CA 02270956 1999-OS-OS
WO 98I20429 PCT/US96/19780
approximate pronunciation of the character. There are only 214 p/i radicals.
Practically, the 214 p/i
radicals can be coded precisely by 214 different sets of codes to represent
the corresponding p/i radicals
respectively. Referring to Fig. 4, in fact) each p/i radical has a specific
pronunciation, for example, the
Chinese character "~" pronouncing xi and "~" pronouncing zhi. In other words,
surrogate words "xi"
and "zhi" precisely represent the p/i radicals "~" and "~" respectively.
To assign thousands of sets of codes as surrogate words to precisely represent
all the non-
phonetic characters of an oriental language, for example Chinese, is more than
possible. However) as the
"shape" input system (such as the "CHANGJEI" or "DA Y1" input system for
Chinese mentioned in the
background of the present invention) did, it is nearly impossible for a common
and non-career user to
memorize thousands of unfamiliar codes. In fact, before a human being learns
how to write, he or she
learns how to speak, i.e. how to pronounce the characters in a sentence.
Hence, the pronunciation-derived
alphabetization is one of the most familiar and logical ways to form a
character. English utilizes different
combinations of the 26 alphabets to constitute all the words in that language.
Most Chinese characters also
provide the phonetic radicals as their major constituting components.
No matter the Chinese. Japanese or Korean language, homonym is a common
phenomenon in
pronouncing characters and radicals. When two or more characters or radicals
share identical
pronunciation, or identical combination of pronunciation and intonation, they
are said to be homonyms.
According to the present invention, a character is broken into two radicals.
Then the radicals
are alphabetized into prefix and suffix to form a surrogate word representing
a given character. However,
as disclosed in the background of the present invention, there are many non-
phonetic characters are
homonyms which share the identical pronunciation. The present invention
provides a conversion method
of creating new surrogate words to precisely represent such non-phonetic
characters used in written
oriental language respectively. Such conversion method can entirely solve such
problems of homonyms, so
that the non-phonetic characters can be easily inputted into in a computer
through an ordinary alphabetic
keyboard, a mouse or other phonetic inputting method by keying in sequentially
the corresponding created
surrogate words for the characters.
For Chinese language, the most common phonetic systems of pronunciation for
spelling is
Pinyin, Zhuyin Zimu, and Yueyin. Pinyin is the Chinese pronunciation for
spelling. Here the term implies
"spelling with Latin-style alphabets." Zhuyin comprises thirty-six Chinese
characters, with very few stokes
each. They were chosen to represent consonants and vowels in Chinese language,
as shown in Fig. 1.
Yueyin is the use of Pinyin for the Cantonese dialect.
For Japanese language, the most common phonetic system of pronunciation for
spelling is
Hiragana and Katakana, as shown in Fig. 2, in which Hiragana) which is treated
as if it is plural in the
present invention, is a group of special Chinese characters adopted by the
Japanese as consonants and
vowels to denote the pronunciation of vocabularies of Japanese origin.
Hiragana resemble script Chinese
characters. They are also a form of Japanese alphabets. Katakana, which is
treated as if it is plural in the
present invention, are a group of special Chinese characters adopted by the
Japanese as consonants and
8


CA 02270956 1999-OS-OS
WO 98/20429 PCT/LTS96/19780
vowels to denote the pronunciation of the Chinese characters and vocabularies
of foreign origin. Katakana
resemble the shapes of the printed characters. In reality, Katakana are also
Japanese alphabets.
For Korean language, as shown in Fig. 3, Hangul are symbols representing the
consonants and
vowels of the Korean language. They are, in fact) referred to as alphabets by
the Korean people.
The conversion method for specifically converting non-phonetic characters
representing
vocabulary in languages into surrogate words for inputting into a computer of
the present invention
comprises the steps as follows.
Step one. Alphabetize 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.
For example) if English-style alphabets is used, the following examples
illustrate how to
phoneticalize the p/i radicals of the characters by spelling according to
their pronunciation respectively in
Chinese) Japanese and Korean.
A. Chinese language: I. mu for ~c. 2. ma for ~ 3. niao for ~4. shui for ~Jr 5.
xin for ~~~.
B. Japanese language: 1. ki for 7~C. 2. uma for ~,. 3. tori for ,~. 4. sui or
mizu for 7Jr. 5.
sakana or uo for ~ .
C. Korean language: I. mool or soo for 7jc. 2. nahmooh or muk for 7~. 3. kAn
for ~. 4.
soon or soo for ~.
It is worth to mention again that, of course, the p/i radicals can be
represented in many ways.
One way is to assign a unique number to each p/i radical. The total 214
numbers for the 214 p/i radicals
can then be used instead of the spelling. Another way is to use a combination
of keys on a computer key
board to represent the numbers assigned to the radicals. For an example, by
pressing one or two or a11
three of Ctrl, Alt, and Shift, then press any one of the alphanumeric keys, we
can easily have 214 key
combinations to represent all 214 p/i radicals. But the applicant thinks that
the phonetic representation is
the most user-friendly of a11 methods because the majority of these radicals
can be easily pronounced and
spelled. It requires little or no effort to memorize numbers or keys.
Step two. Alphabetize a phonetic radical of each character according to its
pronunciation
in the respective language, or alphabetize a pronunciation of a character if
this character does not have a
phonetic radical or when the phonetic radical does not bear the actual
pronunciation of its character. The
resulting spelling is then used as a suffix for the newly created surrogate
word.
For example, if English-style alphabets is used, the following examples
illustrate how to
phoneticalize the phonetic radicals of the characters by spelling according to
their pronunciation
respectively in Chinese, Japanese and Korean.
A. Chinese language: 1. ya for 3f and ~ as in and ~,~, in which 3f is the
phonetic
3 5 radical of the character ~ and ~ pronounces T~ (i.e. ya). Also ~ is the
phonetic radical of the character
~,~ and ~,~ pronounces ~ (i.e. ya). 2. mei for ~, ~, J~, and ~ as in ~. 3. qi
for ~ as in ~.
B. Japanese language: 1. ken for ~ as in , ~, and ~ as in ~~ and ~. 2. tsuru
for and
. 3. kai for ~ as in ~, ~ as in , ~ as in .
9


CA 02270956 1999-OS-OS
WO 98/20429 PCTI~7S96119780 -
C. Korean language: I. kang for ~ as in , I as in ~_, jl, as in ~, and [3~J as
in ~. 2.
to for ~~ as in ~k, and ~~] as in ~.
Step three. Combine the prefix and suffix together to create a newly spelled
surrogate word
for each specific "character" used in the written form of the respective
language.
For inputting a surrogate word representing a non-phonetic character into a
computer, an
inputting tool bar is programmed to present on the screen of the computer. The
inputting tool bar
comprises two separated input windows, wherein one input window is a prefix
inputting window for
keying in the alphabetized spelling of the prefix of the surrogate word, and
that another input window is a
suffix inputting window for keying in the alphabetized spelling of the suffix
of the surrogate word. By
inputting the prefix and the su~x of the surrogate word into the prefix
inputting window and the suffrx
inputting window respectively, the surrogate word is input into the computer
for the representing
character.
In order to distinguish the prefix and the suffix in a surrogate word to avoid
any confusion to
the user, the above step three further comprises a distinction step of
separating the prefix and the suffix
with a separating mark, such as a hyphen "=' or a space, which is inserted
between the prefix and the
suffix.
For example:
A. Chineselanguage:
1. mu-nrei for which p/i radical is ~c pronouncing mu and phonetic radical is
pronouncing nrei (the character also pronouncing mei).
2. niao-ya for ~ which p/i radical is ,~ pronouncing niao and phonetic radical
is ~
pronouncing ya (the character also pronouncing ya).
3. nra-qi for ~ which p/i radical is ~ pronouncing ma and phonetic radical is
~ pronouncing
gi (the character l~ also pronouncing gi).
B. Japanese language: 1. ki-ken for ~. 2. uma-ken for ~. 3, sui-ken for ~~. 4.
tori-ken for
. 5. kusa-tsuru for . 6. tori-tsuru for . 7. ki-kai for ~. 8. sakana-kai for .
9. ,sui-kai for y~.
C. Korean language: 1. moo!-kang for ~I. 2. soo-kang for ~. 3. kinr-kang for
~. 4.
nahnrooh-to for ~~. 6. mool-to for ~J.
By processing the above step one to step three, a unique and newly spelled
surrogate word is
created to precisely represent a specific character. The surrogate word
generally comprises a prefix and a
suW x combining by a separating mark, in which the prefix is the spelling of
the pronunciation of the p/i
radical of the character and the suiBx is the spelling of the pronunciation of
the phonetic radical of the
character or the pronunciation of the character. When the user is spelling the
surrogate word, it just likes
the user is speaking the character. In other words, Chinese, Japanese or
Korean people can simply and
easily distinguish which surrogate word created by the above steps of the
present invention is standing for
which character) as if they are writing that character.
However, when the inputting specific character is a p/i radical itself, such
as
~ ~ - ~ ~, ~ ~ ~ .t ~ ~ ~ Cl ~ ~Z' ~ fJ etc., the user can immediately achieve
the above precise


CA 02270956 1999-OS-OS
WO 98/20429 PCT/US96/19780 ~ t
character after inputting the prefix (the spelling for the p/i radical) and
the separating mark only and does
not need to key in the suffix. In some case, even the separate mark can also
be omitted.
In view of Chinese language, although the surrogate words do not look like the
written Chinese
character, it is 100% derived from Chinese character. According to the above
three steps of the conversion
process of the present invention, approximately 95% of the Chinese characters
are precisely represented by
a corresponding unique surrogate word respectively. In other words, when the
user inputs a surrogate word
created with the above three steps into a computer or word processor, a
specific Chinese character can be
precisely obtained. Therefore) this conversion method highly increases the
inputting accuracy and speed of
inputting Chinese characters. Furthermore, since the surrogate words are
constituted of alphabets and can
precisely represent the respective characters, the surrogate words enable the
non-phonetic characters, i.e.
the Chinese, Japanese and Korean languages, to be sent through E-mail without
any confusion and loss of
any information.
Generally, a number of Chinese characters have an identical pronunciation, for
example the
pronunciation yi has about 99 homonymous characters. It is the major problem
making the non-phonetic
characters di~cult or even impossible to be computerized. As shown in Fig. 5,
a list of Chinese homonym
characters is illustrated, wherein a11 the characters pronounce ji. In
accordance with the present invention,
the spelling of the pronunciation ji of each homonymous character as shown in
Fig. 5 is converted to be a
suffix of a surrogate word. Since the non-phonetic characters have a common
feature that there is no
identical character, i.e. each character has a different appearance, this
feature becomes an important
distinct factor of the non-phonetic characters. Practically, even two
characters have an identical
pronunciation, they have different p/i radicals or even differently written
phonetic radicals. In other
words, even though they may have the same p/i radicals and are pronounced
identically, they definitely
have different shapes, so that they will not be misunderstood by a reader. By
this point, one would
probably has gathered that the non-phonetic characters are visually based. The
trick to sort homonyms in
a visually based written language is by making them look different from one
another. Therefore,
according to the present invention, the spelling of the pronunciation or an
assigned alphabetic or number
code of the p/i radical of each homonymous character is used as a prefix of
the surrogate word. Combining
the prefix and the suffix with a separating mark constitutes a whole spelled
surrogate word uniquely
representing that character. As shown in Fig. 5, each homonymous character has
a corresponding, unique
spelled surrogate word, therefore by inputting those surrogate words into the
computer or word processor,
a specific character can be obtained.
Basically, by proceeding the above three steps of the conversion method of the
present
invention, nearly a11 of but 5% of the Chinese and 10 to 15% of Japanese and
Korean characters can be
precisely inputted into a computer by typing the corresponding, unique
surrogate words for the characters.
Of course, the user may simply selects the desired character from the display
on the screen of the computer
since the large number of homonym characters is reduced to several characters
only. The present
invention already greatly shortens the selection time and reduces work. The
present invention further
provides two additional steps to the above three basic steps for creating
unique surrogate words which can
11


CA 02270956 1999-OS-OS
WO 98I20429 PCT/US96/19780 ~ ~ -
100% precisely represent the remaining homonymous characters. In other words,
by processing the total
five steps of the present invention, there will be no chance of any two
characters having an identical
surrogate word.
With respect to the Chinese language which has intonations, for the new
surrogate words in
Chinese, the intonations of the pronunciation of the prefixes and suffixes are
denoted with selected
consonants as indicators. Therefore, a first additional step is processed
before the step three as described
above. In the first additional step) for the newly spelled surrogate words for
Chinese characters,
intonations of the pronunciation of the prefixes and suffixes are to be
indicated with consonants placed at
the end of the spelling. The first intonation bears no indicator. The second
intonation is denoted by the
second Chinese consonant 'p" for pinyin alphabet and " ~ " for zhuyin zimu.
The third intonation is
denoted by a third consonant "m " for pinyin alphabet and " f1 " for zhuyin
zimu The fourth intonation is
denoted by a fourth consonant 'y"' for pinyin alphabet and " C " for zhuyin
zimu.
For examples:
In Chinese language: 1. shi for ~ . 2. ship for-f -. 3. shim for ~ . 4.
shitfor
Therefore) for example, for the Chinese character y~, its unique surrogate
word is shut-met. In
which its p/i radical is 7~c pronouncing shut and phonetic radical is ~
pronouncing met (the character
also pronouncing met).
It is important to note that in the official colloquial Chinese language,
Mandarin dialect, the
consonants never appear behind the vowels except for n or r according to the
rules set forth in the Pinyin
system. Therefore it is easy for a reader or typist to recognize these three
ending consonants p, m, f, as
indicators of the intonations. It must be noted again that this first
additional step does not apply to the
Japanese and Korean languages as these languages do not have intonations in
their colloquial form.
Basically, by processing the above four steps, approximately 98% of the
Chinese characters can be
precisely represented by their corresponding specific surrogate words
respectively.
Since the Chinese language has quite a few pictograms or ideograms with the
same
pronunciation and intonation, , there are some extreme examples as shown in
Fig. 6, in which four
homonymous Chinese characters having the identical pronunciation of shi are
illustrated. A second
additional step is processed after step tlu-ee. In the second additional step,
a marker is added after the last
alphabet of the surrogate word to represent the next homonymous pictogram or
ideogram that appears
secondly in the Index of Pictogramslldeograms in a Chinese dictionary. The
marker can be any key on the
keyboard. However, for the sake of eft'iciency and accuracy, this marker
should be the last alphabet of the
spelling. In other words, the repetition of the last alphabet of the spelling
distinguishes homonymous
pictograms or ideograms. For the homonymous pictogram or ideogram that appears
secondly in the Index
(choose bar) on the screen of the computer or in the standard dictionary) it
will be repeated once, twice for
the one that appears thirdly, thrice for the one that appears fourthly in the
Index (choose bar) on the screen
of the computer or in the standard dictionary. However, we can used the
numerals 1, 2, 3, 4, 5,... or "home
keys": a, s, d, f, g, h, j, k, 1, and etc. or any other predetermined symbols
as the markers. Home keys are
12


CA 02270956 1999-OS-OS
WO 98!2Q429 PCT/US96/19780 y
the keys provided on the keyboard of the computer where the typist's fingers
generally rest thereon for
representing the numerals 1 to 10.
For example:
A. Chinese language: 1. y for - . 2. yy for ~ . 3. .yyy for -~ . 4. yyvy for ~
. OR
"1"for-.2."2"forZ,.3."3"for-~,4."4"for~.OR
"a" for - . 2. "s" for Z, . 3. "d" for -~ . 4. "f ' for ~ .
B. Japanese language: l.ki for7~ ; 2.kii for .
C. Korean language: 1. sin for 3~ 2. sine for ~ 3. sinnn for ~ 4. sinnnn for ~
The repeated alphabets shall be treated just as extra alphabets, or markers,
for distinguishing
the homonymous radicals and they shall not have any bearing in the
pronunciation of the radical. The
same procedure mentioned above will be applied to the homonymous characters
having the identical
prefix, according to the order they appear in the dictionaries.
Example as shown in Figs. 6 to 8:
A. Chinese language (as shown in Fig. 6): 1. yan-shiffor ~ . 2. yan-shifffor .
3. yan-shiffjfor ~, ~ . 4. yan-shiffff for . OR 1. yan-
shil for ~ . 2. yan-shit for ~ . 3. yan-shi3 for ,~,~ . 4. yan-shi4 for . OR
(1. yan-shia for ~ . 2.
yan-shis for ~ . 3. yan-skid for ,a ~ . 4. yan-shit for .)
B. Japanese language (as shown in Fig. ?): 1. ki-ko for ~j . 2. ki-koo for ~~
. 3. ki-
kooa for ~y . 4. ki-koooo for ~ .
C. Korean language (as shown in Fig. 8): 1. muk-ki for ~~ . 2. muk-kii for ~ .
3. muk-
kiii for ~ . 4. muk-kiiii for .
When the new surrogate words are pronounced. the prefixes are to be treated
like the
pictograms or ideograms that they represent silent. Just as the phonetic
radicals they represent, the suffixes
are sounded. If the pronunciation of a Chinese prefix is unique, the indicator
for its intonation is
exempted. Since the suffixes are sounded, the demand for accuracy dictates
that the indicator for the
intonations to be present at all times with suffixes except when the
intonation is the first one of the four.
Please refer to Figs. 6 to 8, which summarize the entire conversion process
for four extreme
exemplary characters which can illustrate all fve steps regarding to the
present invention. Fig. 6
illustrates four Chinese characters as example. Fig. ? illustrates four
Japanese characters as example. Fig.
8 illustrates four Korean characters as example. Those charts in Figs. 6 to 8
share the same format that
each has five columns and at least eight rows. Starting from the left, Column
1 contains the five steps of
the conversion process or description of the columns to the right. The four
columns to the right contains
the four characters mentioned in the above examples, one in each column, and
the transformation they go
through row by row. Row 1 is occupied by the four characters in their original
forms with pronunciation
3 5 marked by English-style alphabets. Row 2 houses the radicals derived from
each character. Row 3 shows
the spelling for each and every radical. This row actually details the effects
of steps one and two. Row 4
illustrates the effect of step three, which applies only to the Chinese
language. Row 5 shows how step four
influences the characters, with explanation in column two. Row 6 demonstrates
how step five completes
13


CA 02270956 1999-OS-OS
WO 98/20429
PCTlUS96/19780 v
the conversion process with comments in each column invoking rule number two.
Row 7 exhibits the final
products of the process by themselves without any description. By doing so, it
allows the readers to clearly
see the uniqueness of the newly spelled surrogate words or codes for the
characters which share the
identical prefix, pronunciation and intonation. Row 8 unveils the surrogate
words experimentally spelled
with native alphabets. There is an extra row in Fig. 7, because the Japanese
people have 2 sets of native
alphabets, i.e. Katakana and Hiragana. Row 8 is occupied by codes made of
Katakana. Codes made of
Hiragana are put in row 9. There is also an extra row in Fig. 8 too. The
applicant just wants to use that
extra row to spell codes in Hangul organized in a straight horizontal line
like English. At the bottom of
each chart, a rule which is described below is listed for reminding purpose.
In accordance with the present invention, the conversion method further has
two rules for
pronouncing the invented surrogate words.
When it comes to pronouncing the invented, spelled surrogate words, the
prefixes are to
be silent (like the pictograms or ideograms they represent). Just as the
phonetic radicals they stand for. the
suffices are sounded.
2. If the pronunciation of a prefix is unique, the indicator for its
intonation can be omitted.
Since the suffices are sounded, the demand for accuracy dictates that the
indicator for their intonation to
be present at all times except when the intonation is the first one of the
four.
As described in the above step three of the present invention, the surrogate
words are organized
in such a manner: the prefix comes in first, then the separating mark (the
separating mark can be a
hyphen as in Latin alphabets, however the hyphen can be replaced by other
symbols such as * if native
alphabets are used to spell the surrogate words), then the Buff x. However,
the step one and the step three
as described above can be reversed, that is, the suffix proceeds the prefix.
Therefore, the surrogate word
will be organized "suff'ix-prefix". Such alternative mode will also work as
long as the computer is told this
is the situation. For example, the unique surrogate word of the specific
Chinese character ~~ is ' ji-xi"
2~ according to this second embodiment (in the first embodiment, the surrogate
word of ~~ is "xi-ji"). Since
both the surrogate words created from the first embodiment and the second
embodiment consist of the
same alphabets, both of them can be used to precisely represent the same
character. Besides, the user may
preprogram the computer with a "switching key", so that the user can feel free
to switch the computer to
accommodate the first and the second embodiment anytime.
In fact, the second embodiment may be better in certain cases. When a
particular user feels that
the pictographic/ideograpluc radical is hard to pronounce, hence difficult to
type. Instead of looking from
the dictionary for the pronunciation of a rare and difficult radical, the user
can just go ahead to type the
suffix. The computer can display homonymous characters for the user to choose.
This can be done, for
example, by typing just a hyphen or * in case of native alphabet, first, then
the suff x. If the user suddenly
remembers the spelling of the prefix, i.e. the spelling of the pronunciation
of the p/i radical, he can type a
hyphen (or *, if native alphabets are used) then the prefix. He can still get
precisely the character he
desires, since this reversed combination is just as unique as the "normal"
combination described in step
four of the first embodiment. Otherwise, homonymous characters will be
displayed for the user to select
14


CA 02270956 1999-OS-OS
y t
WO 98/20429 PCT/US96/19780
the desired character. Instead of numeralizing the homonyms, alphabets of the
"home keys" can be used to
indicate the order of the homonyms. The user can choose the desired character
by typing in a key, such as:
"a" for the first, "s" for the second. "d" for the third". This is just a
matter of the software design.
Moreover, the combination of these five steps, including the reversed
combination described
above, and the two rules not only enables the Chinese, Japanese, Korean, and
even East Indians to use
computers likes Americans) but also makes voice recognizing/generating
technology readily available to
them. A voice recognizing computer can be built using a sound card and a
software as in usual manner to
train it to understand a person's pronunciation of each word in such a
sequence that first the prefix) then
the indicator if applies, then the marker if applies, then the separating mark
(hyphen or asterisk), then the
suffix, then the indicator if applies, then the markers) if applicable. Of
course, the reversed combination
described above can also be used for this purpose as long as the hyphen or
asterisk (*) is pronounced first,
then the suffix, then the hyphen or asterisk (*), then the prefix.
The conversion method disclosed in the present invention can enable those
people who can
speak but cannot write the respective non-phonetic language to input the
characters into a computer and
print out an essay written in that language. Another remarkable function of
the present invention is that by
utilizing a voice generating computer, with the same sound card and a software
that can pronounce the
suffices accurately, the computer can read out a document for the user to edit
and print, so that the users
need not spend time and energy to go over and check the document character by
character for possible
typing errors. This function can also help those people who can speak but
cannot write or read the
respective non-phonetic language to check their document which is inputted
into the computer through the
conversion method of the present invention.
The following are some notes that the applicant would like to further
disclose.
The English-style alphabets used to create the surrogate words to precisely
represent the
characters in written Chinese language are the ones used in the official
Pinyin system in China, with some
irunor changes. These changes are intended to eliminate some exceptions in the
Pinyin system, making it
easier to use. Please refernng to Fig. 1 for the entire set of Pinyin
alphabets and Fig. 9 for the said
changes. If Zhuyin Zimu is used to spell the newly invented surrogate words,
the prefixes and the suffixes
should be separated by an asterisk instead of a hyphen.
The alphabets used to create the surrogate words to precisely represent the
characters in written
Japanese are the ones proposed in Hepburn system of romanization commonly
accepted by the Japanese to
phonetically translate the Japanese language into English-style alphabets. If
the new surrogate words are
spelled with Katakana or Hiragana, the hyphen should be replaced by an
asterisk also.
The alphabets used to create the surrogate words to precisely represent the
characters used in
the written Korean language are the ones commonly accepted by the Koreans to
phonetically translate the
Korean language into English-style alphabets. Also, an asterisk is used
instead of a hyphen when the
native alphabet is employed to spell a surrogate word for a character used in
Korean language.
To distinguish the surrogate words invented for these languages from English,
the non English
spellings can be italicized as is the case in this application.


CA 02270956 1999-OS-OS
WO 98/20429
PCT/US96/19780
The order of the Chinese consonants are as follows according to the Pinyin
system: 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 abbreviate the prefixes after the mass gets very familiar
with them. In its
abbreviated form, the consonant, the first alphabet or the last alphabet of a
prefix should be adequate to
represent most of the prefixes. With voice recognition technology, the
abbreviation may not be necessary.
In this description, the examples of the phonetically spelled surrogate words
with native
alphabets for the Chinese, Japanese and Korean languages are illustrations of
the concept of the present
invention. The actual spellings for the same characters with the native
alphabets or English-style alphabets
may differ from the ones used in this description. Furthermore, one can always
create any kinds of signs to
replace the existing phonetic symbols. But to effectively create uniquely new
surrogate words to precisely
represent the characters, one has to use the five steps and the two rules
disclosed in the present invention.
The newly spelled surrogate words, whether made of English-style or the native
alphabets,
resemble the characters in the way both kinds are consisted of radicals,
pictographic or ideographic ones
and phonetic ones. These surrogate words differ from the characters in at
least two ways. First, the radicals
1 ~ for the newly spelled surrogate words are phoneticalized, while the
radicals in the characters, especially
the pictographic/ideographic radicals are not. Second, the invented and
spelled surrogate words are more
uniform in construction that the pictographic/ideographic radicals always
occupy the left portion of the
surrogate words as prefixes, and the phonetic radicals always occupy the right
portion of the surrogate
words as suffixes . While the pictographic/ideographic radicals in the
characters can occupy the left, right,
top or bottom portion of the characters. The aforesaid resemblance makes the
new surrogate words more
familiar to the users while the differences make the new surrogate words
logical and more scientific from
the stand point of phonology. As a result, it is fairly easy to learn these
surrogate words. Practically, the
user can simply type the surrogate word which represents a specific non-
phonetic character through the
key board so as to precisely key-in the specific non-phonetic character into
the computer.
According to the conversion method for converting non-phonetic characters into
surrogate
words of the present invention, the user can simply input the predetermined
character into the computer by
means of a manually inputting method processed after executing the conversion
method.
The manually inputting method comprises the steps of:
(I) typing the prefix of the surrogate word created by the conversion method;
(2) typing the indicator, if applicable, of the prefix;
(3) typing the marker, if applicable, of the prefix;
(4) typing the separating mark, if applicable, of the surrogate word;
(5) typing the suffix of the surrogate word;
(6) typing the indicator, if applicable, of the suffx; and
(7) typing the marker, if applicable, of the suffix.
In addition, the user can also simply input the predetermined character into
the computer,
which is equipped with a voice recognizing system, by means of an orally
inputting method processed after
executing the conversion method as disclosed above. The orally inputting
method comprises the steps of:
16


CA 02270956 1999-OS-OS
WO 98/20429 PCT/US96/19780 y
( 1 ) pronouncing the prefix of the surrogate word created by the conversion
method;
(2) pronouncing the marker, if applicable, of the prefix;
(3) pronouncing the separating mark of the surrogate word;
(4) pronouncing the suffix of the surrogate word;
(5) pronouncing the marker, if applicable) of the suffix.
Referring to Figs. 10 to 13, by means of the surrogate words, it renders a set
of mufti-syllabic
vocabularies, a phrase or a sentence of written Chinese or Kanji characters
used in Chinese, Japanese and
Korean languages to be keyed-in through a simplified method utilizing a
surrogate phrase or sentence
which is a unique set of codes (LJSC).
The unique set of codes (LJSC) is a group of alphabets constitute of acronyms,
labels and
makers for precisely representing a phrase or sentence, in which the acronym
refers to the abbreviation of
the su~xes of a plurality of surrogate words representing a plurality of
Chinese characters in a given
phrase or sentence and the label refers to the abbreviation of the prefixes of
a plurality of surrogate words
representing a plurality of Chinese characters in the above given phrase or
sentence. Besides, the marker
is the repetition or repetitions of the last alphabet of the acronym or label.
The unique surrogate phrase or sentence constituted of a plurality of non-
phonetic characters
can be achieved by the following steps:
(a) alphabetizing each non-phonetic character of the phrase according to a
pronunciation of
the non-phonetic character to form a spelled prefix for a surrogate word of
the non-phonetic character; and
(b) selecting a first or a last alphabet from each prefix of each non-phonetic
character of the
phrase and grouping the selected alphabets of each prefix of each non-phonetic
character of the phrase to
form an acronym of the surrogate phrase.
Generally, the non-phonetic character is pronounced with a pronunciation of a
phonetic radical
of the non-phonetic character. For most Chinese phrases or sentences which
have more than four
characters, the specific phrase or sentence may be achieved by merely keying-
in the acronym, which is
obtained by the above two steps, of the surrogate phrase or sentence into the
computer. If there are still a
few homonymous phrases or sentences occurred, an additional step of repeating
the last alphabet of the
acronym as a marker can be processed.
For phrases or sentences with four Chinese characters or more, simply
repetition of the last
alphabet of the acronym as the marker can be adequate to separate the
homonymous acronyms from one
another since the homonymous acronyms of longer phrases or sentences are less
common than those of the
phrases consisting less than four characters.
For those phrases with less than four Chinese characters) additional steps as
follows must be
processed:
(c) alphabetizing a pictographicJideographic radical of each non-phonetic
character of the
phrase according to a pronunciation of the pictographic/ideographic radical of
the non phonetic character
or an abbreviation of the pronunciation of the pictographiclideographic
radical to form a spelled suffix of
the non-phonetic character;
17


CA 02270956 1999-OS-OS
WO 98/20429 PCT/LJS96/19780 V
(d) grouping a first or a last alphabet of the suffix of each non-phonetic
character to form a
label of the surrogate phrase; and
{e) combining the acronym and the label together to form the unique surrogate
phrase, as
shown in the column 6 of Figs. 10 to 13.
By inputting the surrogate phrase into the computer, generally the precise
phrase or sentence in
characters can be achieved. However, in order to prevent misunderstanding of
the acronym and the label
of the surrogate phrase, the acronym can be keyed in upper case alphabets and
the label can be keyed in
lower case alphabets if the acronym and label are pronounced by English-style
alphabets according to the
Pinyin system. Of course, one can also key-in the acronym in lower case
alphabets and the label in upper
case alphabets.
If such surrogate phrase is still unable to produce a unique set of codes to
represent the speck
phrase or sentence, the following step can be processed until a unique set of
codes (USC) is created:
(f) repeating the last alphabet of the label as a marker.
Basically, the acronym and the label can also be pronounced by Zhuyin Zimu,
Hiragana,
Katagana or Hangul. In accordance with the present embodiment, the acronym is
keyed-in before the
label. It is also possible to put the label in front of the acronym, then
repeat the last alphabet of the
acronym as a marker.
Alternatively, the above step (e) can be substituted by the step (e') of
putting each alphabet of
the label ahead of each alphabet of the acronym, or the step (e") of putting
each alphabet of acronym
ahead of each alphabet of the label. For example, if we have an acronym
"ABODE" and a label "stuvw"
instead of forming a surrogate phrase as "ABCDEstuvw" or "STLTVWabcde" as
mentioned above, the
alternative surrogate phrase can be created in this manner: "SaTbUcVdWe" or
"AsBtCuDvEw".
With a software based on this invention, a11 commonly used phrases in Chinese,
Japanese and
Korean languages can be produced precisely on the screen just a English words
are processed now. For
newly created popular phrases or sentences, the typist can create the new
unique surrogate phrases for
them respectively. Moreover, using a conventional voice recognizing software
which helps the computer
to understand the pronunciation of the alphabets, the surrogate phrases can be
input orally. After the
computer is informed that phrase input will begin, the user can then start
reading the unique set of codes
(surrogate phrase), including cases of the alphabets, to input the phrases.
The computer can then convert
the voice into Chinese characters.
It is worth to mention that there are other modified methods to create orders
of acronyms
mentioned above. These can be based on any alphabet of the prefixes or
suffixes of any character of the
phrases or sentences. Here are some examples:
1. In the native alphabetical order of:
A. The first alphabet of prefix of the first Chinese character of the phrase
or sentence; or
B. The last alphabet of the prefix of the first Clinese character of the
phrase or sentence; or
C. The first alphabet of the prefix of the last Chinese character of the
phrase or sentence; or
D. The last alphabet of the prefix of the last Chinese character of the phrase
or sentence; or
18


CA 02270956 1999-05-OS
WO 98/20429 PCT/US96/19780
E. The last alphabet of the suffix of the first Chinese character of the
phrase or sentence; or
F. The last alphabet of the suffix of the last Chinese character of the phrase
of sentence.
2. English alphabetical order for all of the above and the acronyms mentioned
above can be
used as well when Latin-style alphabets are used to create USC's.
3. The order can be based on the number of strokes of one of the radicals
contained in any
character or the number of strokes of any character of the phrase or sentence.
for examples, number of
strokes of the following can be used for this purpose:
A. The first Chinese or Kanji character of the phrase or sentence: or
B. The last Chinese of character of the phrase or sentence; or
C. The pictographiclideographic radical of the first character of the phrase
or sentence; or
D. The pictographic/ideographic radical of the last character of the phrase or
sentence; or
E. The phonetic radical of the first Chinese character of the phrase or
sentence; or
F. The phonetic radical of the last Chinese character of the phrase or
sentence.
Besides, actually the label can be any alphabet of a prefix or suffix of any
character of the
phrase, for examples, one of the following can be used as a label:
A. The first alphabet of the prefix of the first character of the phrase or
sentence;
B. The last alphabet of the prefix of the first character of the phrase or
sentence;
C. The first alphabet of the suffix of the first character of the phrase or
sentence;
D. The last alphabet of the suffix of the first character of the phrase or
sentence;
E. The first alphabet of the prefix of the last character of the phrase or
sentence;
F. The last alphabet of the prefix of the last character of the phrase or
sentence;
G. The first alphabet of the suffix of the last character of the phrase or
sentence,
H. The last alphabet of the suffix of the last character of the phrase of
sentence.
Also, the label can be the number of strokes of any character or its one of
its radicals in the
phrase or sentence.
The preferable labels are made of the regular form of the first alphabet of
the prefixes because
it is flowing with the typist's train of thoughts. Also, the labels will
always be in lower case alphabet,
while the acronyms themselves are always in upper case alphabet. This
arrangement can avoid confusion
on the part of the human as well as the computer. Since the spelling of a
character is always in lower case
alphabet, the "shift" key on the keyboard will serve as a signal to the
computer that the user is going to
input a phrase or sentence.
In fact, the theory of the surrogate phrase can be applied to any language
that is burdened by
homonyms, such as certain dialects in Indian language.
Again, the predetermined phrase or sentence of non-phonetic characters can
also be input into
the computer by means of by means of a manually inputting method processed
after executing the
conversion method for converting a plurality of non-phonetic characters of a
phrase of a language into a
surrogate phrase as described above.
The manually inputting method comprises the steps of:
19


CA 02270956 1999-OS-OS
WO 98I20429 PCT/US96/19780
( 1 ) typing the surrogate phrase or sentence created by the conversion
method: and
(2) typing the marker, if applicable, of the surrogate phrase or sentence.
Also, if the computer is equipped with a voice recognizing system) the user
can also simply
input the predetermined phrase or sentence into the computer by means of an
orally inputting method
processed after executing the conversion method as disclosed above. The orally
inputting method
comprises the steps of:
( 1 ) pronouncing the surrogate phrase or sentence created by the conversion
method alphabet
by alphabet including the cases of the alphabets if applicable; and
(2) pronouncing die marker, if applicable, of the surrogate phrase or
sentence.
These surrogate words and surrogate phrases (unique sets of codes (USC)) can
be used to send
documents consisting Chinese characters through E-mail via the Internet or
other similar media, as long
as Use receiving party has a copy of the same software installed that can
interpret the surrogate words and
USC's. In fact, the documents generated without the benefit of the surrogate
words and USC's are not
quite compatible with the Internet protocol since the characters require two
bytes to represent each and
every one of them wlule Internet recognizes only one byte (actually seven
bits) at a time. That is due to
the extraordinarily large number of Chinese characters. one byte is not
adequate to represent a11 of them,
since the largest number of byte can represent is 256, which is large enough
to cover all of the English
alphabets, punctuation marks and numbers. To accommodate thousands of the
Chinese characters, two
bytes are required to make up a number wluch will have more than four digits.
This conflict puts this kind
of documents at odds with the Internet protocol. A document with this
incompatibility can get
"scrambled" beyond recognition after going through the Internet. However, if
the contents of these
documents are sent through E-mail in the form of the surrogate words or
surrogate phrases (USC), they
will arrive their destination intact, because the Internet protocol will treat
the surrogate words and phrases
as English which is totally compatible with Internet.
Base on the method for converting non-phonetic characters into surrogate words
as disclosed
above, the using of the pictographic/ideographic radical as a prefix of the
surrogate word can establish a
helpful process for the cluldren to memorize the Chinese or Kanji characters
easily. Since every character
has a pictographic/ideographic radical or is solely constituted by a
pictographic or ideographic radical
(many pictographic/ideographic radical itself is a character), the
pictographic/ideographic radicals play a
very important part of memorizing a character. Once one recognizes a
pictographic/ideographic radical of
a character, one can understand tile meaning or the shape of the character. It
is an important feature and
characteristic of Chinese or Kanji characters. Moreover, a visual image is the
most easy thing to be
memorized.
In other words, every pictographic/ideographic radical can be illustrated by a
visual drawing
which is more easily and familiarly for the user to memorize. For example) as
shown in Fig. 14, ~ ,
pronouncing "mu" and having a meaning of the phonetic word, "eye", can be
illustrated by a picture of
eye; 7f c , pronouncing "mu" and having a meaning of the phonetic word,
"wood", can be illustrated by a
drawing of a green tree; ~ , pronouncing "shen" and having a meaning of the
phonetic word, "body", can


CA 02270956 1999-OS-OS
WO 98I20429 PCT/US96/19780
be illustrated by a drawing of a human body; ~ , pronouncing "gu" and having a
meaning of the phonetic
word, "bone", can be illustrated by a picture of bone.
Accordingly, since each pictographic/ideographic radical has a unique meaning,
the spelling of
the meaning of each pictographic/ideographic radical can also be used as the
alphabetized spelling of the
prefix of the surrogate word. For example, the "eye" for ~ , "wood" for ~ ,
"body" for ~ , and "bone"
for' . Therefore, for example, the surrogate words for Chinese characters:
~ (meaning "sleep") is "eye-mian"; ~ (meaning "root") is "wood-gen"; ~
(meaning "lie
down") is "body-tang"; and (meaning "thighbone") is "bone-bi".
Alternatively, it is possible to designate and program 214 different pictorial
and colorful icons
into the computer representing the 214 radicals respectively, therefore the
user may use the mouse of the
computer to precisely click on the desired icon for inputting the prefix of
the surrogate word.
Those designated pictorial icons have an additional function of helping the
user or student to
memorize the pictographic/ideographic radicals. In order to remind the
spelling of the
pictographic/ideographic radicals for the user, the spelling of the
pronunciation of each
pictographic/ideographic radical can further be illustrated next to the
representing pictorial icon.
Therefore, a memorizing process can be added to the basic steps of the
conversion method
described above, which comprises the steps of:
(a) assigning a unique code to represent a pictographic/ideographic radical of
a non-
phonetic character of a language, wherein the unique code being used as a
prefix for a surrogate word;
(b) alphabetizing the non-phonetic character of the respective language
according to a
pronunciation of the non-phonetic character to form a spelled suffix for the
surrogate word; and
(c) combining the prefix and the suffix together to constitute the surrogate
word
representing the non-phonetic character of the respective language.
The memorizing process comprises the following steps adding after the above
step (c):
(dl) illustrating the prefix of the surrogate word by a visual picture which
represents the
meaning of the pictographic/ideographic radical represented by the prefix;
(d2) illustrating the meaning of tire non-phonetic by a corresponding meaning
visual picture;
(d3 ) combining the prefix visual picture with the character meaning visual
picture.
Practically, we can use animated visual aids such as video tapes to describe
how the visual
pictures transformed into certain Chinese characters, then pictograms and
color code them. The same can
be done to explain how the ideograms were derived. This can firmly imprint the
p/i radicals in the minds
of the students.
Once the students understand each p/i radical, then characters under each p/i
radical can be
shown in this manner:
1. Video will be used to show the actions the verbs describe.
2. Still pictures will be used to show the objects the nouns describe.
We will used huo (fire) as an example.
21


CA 02270956 1999-OS-OS
WO 98I20429 PCT/US96/19780 y ~ _
First, a video shows a group of people sitting around an orange-red colored
bond fire. Then a
close-up of the bond fire will be shown. The video will then show the flames
of the fire roaring to make a
noise mimicking the pronunciation of 'huo,' and dancing to form die shape of
the character ' J~' bearing
the same orange-red color. A video showing how a calligrapher smoothes out the
fussy edges of the
s picture, and gives it the modern look as 'J~' bearing the same color. Then
we will show how the right half
of the character is shrunk so that the character can be used as a pictographic
radical in the same orange-
red color.
Video showing a woman stir-frying food in a wok on top of an orange-red
colored fire, making
noise with the iron spatula mimicking 'chao' can be shown together with the
character ' XJ' (Pronounced
chap in Chinese) with its pictographic radical '~ 'in orange-red color. Other
characters such as ,~'',~y
~~' ~ ,z,~"~, ~ ~# can be made in the same manner) leaving the p/i radical in
orange-red color.
For those radicals that cannot be effectively represented by colors alone) the
strokes of the
radicals of this type can be made 'hollow,' that is, to outline the stroke
with black ink but leave the rest
blank. Then tiny, but visually discernible colored pictures of the objects the
radicals represent can be used
1 i to fill in the blank space. Of course,nhese pictures will have to be the
still pictures that are used to explain
the radicals. For an example, ~gu (bone) can be shown with just the outline
filled with tiny pictures of
bones. A partial list of the radicals and the method to illustrate them is
shown in Fig. 1. This list is
intended to show what can be done to made the radicals easy to recognize and
to remember.
The remaining radicals can be illustrated the same way, if they are related to
tangible objects.
There are some radicals that are related to intangible concepts. These
intangible radicals can be outlined
to have "blank space" in the strokes first. The its pronunciation in native
alphabets can be put in the blank
space.
In the drawing, there is a column referred to as "method of illustration." In
that column, the
word "picture" are meant to be the "tiny, but visually discernible colored
pictures" mentioned above in this
paragraph. In that column, a specific color is mentioned most of the time.
When the color is not
mentioned, a natural color of the object relative to the radical will be used.
Although the above examples are all in Chinese pronunciation, they can
obviously be applied
any other languages, such as Japanese and Korean languages. All it takes is to
substitute Chinese
pronunciation with the pronunciation of chosen language, for example) 3apanese
or Korean.
22