CN117688908A - Method for converting Tiancheng text basic character sequence into printable character sequence - Google Patents

Abstract

The invention relates to the technical field of computer word processing, in particular to a method for converting a basic character sequence of a Tiancheng text into a printable character sequence, which prepares a series of combination rules comprising a grapheme rule and a word combination rule, wherein the combination rule describes a rule that a plurality of combination element characters form a single combination character. The process of applying the combining rule is to replace all the sequence of combining meta-characters contained in the input character sequence with a single combining character. When the basic character sequence of Tiancheng text is input, a grapheme rule is firstly applied to the basic character sequence of Tiancheng text to obtain a sequence with all characters being graphemes, and then a word combination rule is applied to the obtained result to finally obtain the sequence of all printable characters. The invention converts the basic character sequence of the space and city text which can not be independently displayed or printed in the original computer into the printable character sequence, and displays or prints the character sequences according to the character fonts, so that a user can read the character sequences normally.

Description

Method for converting Tiancheng text basic character sequence into printable character sequence

Technical Field

The invention relates to the technical field of computer word processing, in particular to a method for converting a basic character sequence of a Tiancheng text into a printable character sequence.

Background

When the computer displays characters or performs character printing processing, a mapping relation from character codes to fonts is established. Most characters, such as Latin letters and Chinese characters, are in one-to-one correspondence with fonts, but the character codes of Tiancheng characters are not in one-to-one correspondence with fonts, and the number of the character codes is far smaller than that of the fonts. The reason is that the characters of the world can be combined or changed in shape according to the context thereof, and the appearance of one character depends on the order thereof with respect to other characters, which makes the number of characters of the world very large and also complicated to process. Many computer systems, particularly devices with early production times or embedded devices with limited resources, have a rough method for processing the space and the words, which results in poor display or printing of many characters, and thus, users cannot read the characters normally.

Disclosure of Invention

The invention aims to provide a method for converting a Tiancheng text basic character sequence into a printable character sequence, which aims to establish a mapping relation from Tiancheng text character codes to fonts.

To achieve the above object, the present invention provides a method for converting a basic character sequence of a space city text into a printable character sequence, comprising the steps of:

step 1: determining a combination rule comprising a grapheme rule and a word combination rule;

step 2: grouping all the grapheme rules and the word combining rules according to the rule length respectively, putting the rules with the same length into the same group, wherein the grapheme rules or the word combining rules in the same group can be arranged in any sequence;

step 3: firstly, applying all character element rules to an input character sequence, and then applying all word combination rules to the obtained result;

when the grapheme rule is applied, the rule with the large length is firstly applied and then the rule with the small length is applied according to the sequence from the large rule length to the small rule length;

when the word combination rule is applied, the rule with the large length is applied first according to the sequence from the large rule length to the small rule length, and then the rule with the small length is applied.

Optionally, in step 2, the following steps are included:

the grouping of the grapheme rules with the length of n is marked as grains { n }, if the maximum length of the grapheme rules is nmax, all the grapheme rules are divided into nmax-1 groups, and the grapheme rules are orderly arranged from big to small according to the rule length:

grules{nmax},grules{nmax-1},…,grules{3},grules{2}；

the group where the word combination rule with the length of m is located is marked as a rules { m }, if the maximum length of the word combination rule is mmax, all the word combination rules are divided into mmax-1 groups, and the word combination rules are sequentially arranged from big to small according to the rule length:

crules{mmax},crules{mmax-1},…,crules{3},crules{2}。

alternatively, in step 3, when a combination rule (a grapheme-containing rule and a word-synthesizing rule) is applied to a character sequence, all the combination element character sequences included in the input character sequence are replaced with single combination characters.

Optionally, in one combination rule, the grapheme-containing rule and the word-combining rule are expressed as follows:

combination character = combination element 1+ combination element 2+ … + combination element n

The number n of combination elements is defined as the length of the combination rule, n being 2 or an integer greater than 2.

Alternatively, the combination character is denoted by cr, the combination element is denoted by ce, the combination element sequence ce [1], ce [2], …, ce [ n ] is denoted by ce [1 … n ], and a combination rule may be denoted as { cr, ce [1 … n ] }.

Optionally, in step 3, a combination rule { cr, ce [1 … n ] } with a length n is applied to the character sequence text, including the following steps:

step 3.1: searching the character sequence text for a subsequence identical to the combined meta sequence ce [1 … n ], i.e. finding a subscript idx, such that text [ idx … (idx+n-1) ]= ce [1 … n ];

step 3.2: if such idx is found, go to step 3.3, if such idx is not found, go to step 3.4;

step 3.3: replacing the subsequence identical to the combined element sequence ce [1 … n ] in the character sequence text with the combined character cr in the combined rule, namely replacing the subsequence of the text [ idx … (idx+n-1) ] with the combined character cr, and turning to the step 3.1;

step 3.4: the flow ends.

Optionally, the character sequence text is an input character sequence containing any type of characters, which may be all characters of the space city and the city, or may not contain the space city and the city, or may contain a part of the space city and the city and a part of other characters.

Optionally, when applying the grapheme rule, specifically, the input character sequence is text_basic, the sequences of the groups { nmax }, the groups { nmax-1}, …, the groups {3}, and the groups {2} are grouped according to the grapheme rule, each grapheme rule in the group is sequentially taken out, and the rule is applied to the text_basic according to the step of the step 3, and after all grapheme rules are applied, the obtained result is recorded as text_grapheme, and all the space city graphemes in the text_grapheme are graphemes.

Optionally, when the word combination rule is applied, specifically, the text_graphic of the character sequence obtained after the word combination rule is applied is taken as input, and each word combination rule in the group is sequentially taken out according to the sequence of word combination rule groups of rules { mmax }, rules { mmax-1}, …, rules {3}, rules {2}, and the word combination rule is applied to the text_graphic according to the step of step 3, and the obtained result is marked as text_connect after all the word combination rules are applied, namely the final result.

The invention provides a method for converting a Tiancheng text basic character sequence into a printable character sequence, which applies a combination rule comprising a grapheme rule and a word combination rule, when a character sequence is input, firstly applies the grapheme rule to the input character sequence, then applies the word combination rule to the obtained result, applies the combination rule to the character sequence in the application process, simultaneously replaces all combination element character sequences contained in the input character sequence with single combination characters, obtains the character sequence that all Tiancheng characters are graphemes after applying all grapheme rules, and finally obtains the final result by applying all word combination rules. The basic character sequence which cannot be independently displayed or printed in the original computer is converted into the printable character sequence, and the character sequences are displayed or printed according to the character fonts, so that a user can read normally.

Drawings

In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

FIG. 1 is a flow chart of the steps of a method of converting a basic character sequence of a Tiancheng text into a printable character sequence according to the present invention.

FIG. 2 is a schematic diagram of 128 Tiancheng text base characters in the Unicode standard.

FIG. 3 is a flow chart of the present invention for applying a combination rule to a character sequence.

FIG. 4 is a flow chart of the present invention for applying all grapheme rules to a character sequence.

FIG. 5 is a flow chart of the present invention for applying all word-combining rules to a character sequence.

Detailed Description

Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to like or similar elements or elements having like or similar functions throughout. The embodiments described below by referring to the drawings are illustrative and intended to explain the present invention and should not be construed as limiting the invention.

Referring to fig. 1, the present invention provides a method for converting a basic character sequence of a space city and a character sequence capable of being printed, comprising the following steps:

s1: determining a combination rule comprising a grapheme rule and a word combination rule;

s2: grouping all the grapheme rules and the word combining rules according to the rule length respectively, putting the rules with the same length into the same group, wherein the grapheme rules or the word combining rules in the same group can be arranged in any sequence;

s3: firstly, applying all character element rules to an input character sequence, and then applying all word combination rules to the obtained result;

when the grapheme rule is applied, the rule with the large length is firstly applied and then the rule with the small length is applied according to the sequence from the large rule length to the small rule length;

when the word combination rule is applied, the rule with the large length is applied first according to the sequence from the large rule length to the small rule length, and then the rule with the small length is applied.

Before proceeding with the step detailed description, first, the storage form and combination rule concerning the space city in the existing computer system will be described:

(1) Basic character of Tiancheng text

The text of the space city is stored in the form of basic characters in the computer. Taking Unicode character set as an example, 128 code bits are allocated to the space and city characters by Unicode, the coding range is U+0900-U+097F, and the codes and the corresponding basic characters are shown in figure 2.

The 128 space city basic characters in the Unicode standard can be divided into the following classes:

1. consonant character

The code bit ranges of consonant letters in Unicode are U+0915-U+0939, U+0958-U+ F, U +0978-U+097C, 45 consonant letters in total:

tiancheng is a salom system vowel attachment letter, each consonant letter carrying an inherent vowel/a/, e.g. lettersRepresenting a syllable/ka/, rather than a single consonant/k/.

2. Independent vowels

Independent vowels can be presented alone, mainly to represent syllables starting with a single vowel. The code bit ranges of the independent vowels in Unicode are U+0904-U+0914, U+0960-U+0961, U+0972-U+0977, and the total number of the independent vowels is 25:

3. dependent vowels

Non-independent vowels are vowels that cannot occur independently, but are presented in combination with a basic letter form. The code bit range of the non-independent vowels in Unicode is U+093A-U+ B, U +093E-U+ C, U +094E-U+ F, U +0955-U+0957, U+0962-U+0963, and the total number of the non-independent vowels is 24:

when there is a non-independent vowel following a consonant letter or consonant cluster, the natural vowel/a/will be replaced with the corresponding vowel, e.gRepresenting vowels/i/, and consonant letters +.>Combination: />The/ka/+/i/=/ki/, the natural vowels/a/are replaced by/i/, and a new syllable/ki/isformed. Dependent vowels may appear in the up, down, left, right directions in the form of basic letters, such as:

4. tone-changing symbol

The space city has some combined symbols that can be considered as the tone-change symbols. The code bit ranges in the Unicode character set are u+0900-u+0903, u+ C, U + D, U +0951-u+0954, for a total of 10 argument symbols:the above-mentioned inflexion symbols cannot appear alone, but are presented in combination with the basic letter form. For example, the De-voice (Virama) symbol +.>The effect of (a) is to remove the natural vowels of the consonant letters to make them dead consonants, such as +.>The vowels/a/' in the/ka/syllables are removed by/ka/+virama=/k/.

5. Other symbols

The code bit range in Unicode character set is U+ D, U +0950, U+0964-U+0971, U+097D, 17:I、II、

(2) Combination rule of Tiancheng characters

The Tiancheng characters can be combined or changed in shape according to the context, and the combination rules are divided into two types, namely a grapheme rule and a word combining rule.

1. Grapheme rules

Grapheme (grapheme) is the smallest functional unit in a text writing system, also called the basic writing unit, and also the basic unit for display or printing. In the basic characters of the Tiancheng text, consonant letters, independent vowels and other symbols can all appear independently, or can be said to be displayed or printed independently, and a user can read normally, so that the 3 kinds of characters belong to grapheme. Other graphemes are composed of consonant letters combined with non-independent vowels and syllable-changing symbols, and most of the graphemes are composed of the consonant letters and the syllable-changing symbols.

The grapheme rule describes a combination rule in which 2 or more basic characters are combined into one grapheme, the first basic character is a consonant letter, and the following basic characters are dependent vowels or diacritics. The following are examples of combining 2, 3, 4 basic characters into one grapheme, respectively:

the grapheme obtained by combining consonant letters with a note-removing number is called dead consonant (dead consonant), such as:

2. rule of word combination

Successive consonants (or consonants) with the natural vowels removed are written together in a regular fashion, called a word (joint or character). The word combination rule describes a rule that a word combination is made up of 2 or more graphemes, where the last one can be any grapheme and the preceding graphemes must be dead consonants. For example, the following are examples of a combination of 2, 3, and 4 graphemes, respectively:

the invention is further described in connection with the following specific implementation steps:

in step S1, a combination rule, whether a grapheme rule or a word combination rule, is uniformly expressed as follows:

combination character = combination element 1+ combination element 2+ … + combination element n

The number n of combination elements is defined as the length of the combination rule, n being 2 or an integer greater than 2. Such as charactersThe combination rule of (2) can be expressed as +.>Wherein the combined character is->The combination element is->These 3 characters, and therefore, the length of the combining rule is n=3.

The input character sequence is marked as text, and the character sequence may contain any type of characters, may be all of the characters of the space city and the character of the other characters, or may not contain the characters of the space city and the character of the other characters.

In step S3, when a combination rule is applied to the character sequence, all the combination element character sequences included in the input character sequence are replaced with single combination characters.

The detailed procedure for applying the combination rule of length n to the character sequence text is { cr, ce [1 … n ] }, as follows:

step 1: the same subsequence as the combined meta sequence ce [1 … n ] is searched in the character sequence text, i.e. a subscript idx is found such that text [ idx … (idx+n-1) ]= ce [1 … n ]

Step 2: if such idx is found, go to step 3, if such idx is not found, go to step 4

Step 3: the sub-sequence identical to the combined element sequence ce [1 … n ] in the character sequence text is replaced by the combined character cr in the combined rule, namely the sub-sequence of text [ idx … (idx+n-1) ] is replaced by the combined character cr, and other characters in the text are unchanged. Turning to step 1

Step 4: ending

The flow of the above process is shown in fig. 3.

The above is the principle of applying a combination rule.

Steps S1 to S3 are the process of converting the basic character sequence of the space city text into a printable character sequence:

step S1 and step S2 are the preparation and grouping of the combination rules, and the combination rules are prepared, wherein the combination rules comprise a grapheme rule and a word combining rule.

All the grapheme rules are grouped according to the rule length, the rules with the same length are put into the same group, and the grapheme rules in the same group can be arranged in any sequence. The grouping of the grapheme rules with the length of n is marked as grains { n }, if the maximum length of the grapheme rules is nmax, all the grapheme rules are divided into nmax-1 groups, and the grapheme rules are orderly arranged from big to small according to the rule length:

grules{nmax},grules{nmax-1},…,grules{3},grules{2}

all the word combination rules are grouped according to the rule length, the rules with the same length are put into the same group, and the word combination rules in the same group can be arranged in any sequence. The group where the word combination rule with the length of m is located is marked as a rules { m }, if the maximum length of the word combination rule is mmax, all the word combination rules are divided into mmax-1 groups, and the word combination rules are sequentially arranged from big to small according to the rule length:

crules{mmax},crules{mmax-1},…,crules{3},crules{2}

text containing the space and the city is input, and space and city characters in the text are stored in a form of space and city basic characters in a computer.

And S3, firstly, applying a grapheme rule to the input character sequence, and then, applying a word combination rule to the obtained result.

And S3, when the grapheme rule is applied, firstly applying the rule with the large length and then applying the rule with the small length according to the sequence of the rule length from large to small. The input character sequence is text_basic, the sequences of the groups { nmax }, groups { nmax-1}, …, groups {3}, groups {2} are grouped according to the character element rules, each character element rule in the group is sequentially fetched, and the character element rules are applied to the text_basic according to the steps described in the step S3. A flowchart for applying the grapheme rules is shown in fig. 4. After all the grapheme rules are applied, the obtained result is marked as text_grapheme, and all the heaven city grapheme characters in the text_grapheme are grapheme.

And step S3, when the word combination rule is applied, firstly applying the rule with large length and then applying the rule with small length according to the sequence of the rule length from large to small. And (3) taking the character sequence text_grapheme obtained after the grapheme rule is applied as input, grouping the rules { mmax }, rules { mmax-1}, …, rules {3}, rules {2} according to the word combination rule, sequentially taking out each word combination rule in the group, and applying the rule on the text_grapheme according to the step described in the step S3. A flow chart for applying the word-combining rule is shown in fig. 5. After all the word combination rules are applied, the obtained result is marked as text_connect, which is the final result and the conversion is finished.

Further, the invention uses the words of Tiancheng textFor the sake of example, it is stored in the form of 9 basic characters in the computer, and the characters and the storage sequence are shown in table 1:

TABLE 1 9 basic characters that make up a word

Firstly, applying a grapheme rule to 9 character sequences in table 1, wherein the grapheme rule is applied in sequence from large to small, and the lengths of the grapheme rules in the example are 2, and are respectively as follows:

applying the 3 grapheme rule above, 6 characters are obtained as shown in Table 2:

table 2 sequences obtained after application of the grapheme rules

And then applying the word combination rules to 6 characters in the table 2, wherein the word combination rules are applied in the sequence from big to small, and the length of the word combination rules is 2 in the example, and the word combination rules are respectively as follows:

according to the search replacement method described above, the above 2 word-combining rules are applied to obtain 4 characters shown in table 3:

TABLE 3 sequences obtained after application of the word-combining rules

The characters in Table 3 are the characters to be finally displayed or printed, according to whichA glyph of 4 characters that is displayed or printed out, results similar to:the user can read normally.

The above disclosure is only a preferred embodiment of the present invention, and it should be understood that the scope of the invention is not limited thereto, and those skilled in the art will appreciate that all or part of the procedures described above can be performed according to the equivalent changes of the claims, and still fall within the scope of the present invention.

Claims (9)

1. A method for converting a basic character sequence of a space-city-text into a printable character sequence, comprising the steps of:

step 1: determining a combination rule comprising a grapheme rule and a word combination rule;

step 2: grouping all the grapheme rules and the word combining rules according to the rule length respectively, putting the rules with the same length into the same group, wherein the grapheme rules or the word combining rules in the same group can be arranged in any sequence;

step 3: firstly, applying all character element rules to an input character sequence, and then applying all word combination rules to the obtained result;

when the grapheme rule is applied, the rule with the large length is firstly applied and then the rule with the small length is applied according to the sequence from the large rule length to the small rule length;

when the word combination rule is applied, the rule with the large length is applied first according to the sequence from the large rule length to the small rule length, and then the rule with the small length is applied.

2. The method of converting a sequence of basic characters of a space-city-text into a sequence of printable characters of claim 1,

in step 2, the following steps are included:

the grouping of the grapheme rules with the length of n is marked as grains { n }, if the maximum length of the grapheme rules is nmax, all the grapheme rules are divided into nmax-1 groups, and the grapheme rules are orderly arranged from big to small according to the rule length:

grules{nmax},grules{nmax-1},…,grules{3},grules{2}；

the group where the word combination rule with the length of m is located is marked as a rules { m }, if the maximum length of the word combination rule is mmax, all the word combination rules are divided into mmax-1 groups, and the word combination rules are sequentially arranged from big to small according to the rule length:

crules{mmax},crules{mmax-1},…,crules{3},crules{2}。

3. the method of converting a sequence of basic characters of a space-city-text into a sequence of printable characters of claim 2,

in step 3, when a combination rule including a grapheme rule and a word combination rule is applied to a character sequence, all the combination meta character sequences included in the input character sequence are replaced with single combination characters.

4. The method of converting a sequence of basic characters of a space-city-text into a sequence of printable characters of claim 3,

in one combination rule, the grapheme-containing rule and the word-combining rule are expressed as follows:

combination character = combination element 1+ combination element 2+ … + combination element n

The number n of combination elements is defined as the length of the combination rule, n being 2 or an integer greater than 2.

5. The method of converting a sequence of basic characters of a space-city-text into a sequence of printable characters of claim 4,

the combination character is represented by cr, the combination element is represented by ce, the combination element sequence ce [1], ce [2], …, and ce [ n ] are represented by ce [1 … n ], and a combination rule can be expressed as { cr, ce [1 … n ] }.

6. The method of converting a sequence of basic characters of a space-city-text into a sequence of printable characters of claim 5,

in step 3, the basic operation when the combination rule is applied is to apply a combination rule of length n { cr, ce [1 … n ] }, to a character sequence text, comprising the steps of:

step 3.1: searching the character sequence text for a subsequence identical to the combined meta sequence ce [1 … n ], i.e. finding a subscript idx, such that text [ idx … (idx+n-1) ]= ce [1 … n ];

step 3.2: if such idx is found, go to step 3.3, if such idx is not found, go to step 3.4;

step 3.3: replacing the subsequence identical to the combined element sequence ce [1 … n ] in the character sequence text with the combined character cr in the combined rule, namely replacing the subsequence of the text [ idx … (idx+n-1) ] with the combined character cr, and turning to the step 3.1;

step 3.4: the flow ends.

7. The method of converting a sequence of basic characters of a space-city-text into a sequence of printable characters of claim 6,

the character sequence text is an input character sequence containing any type of characters, and can be all characters of the space city and the character, or can not contain the characters of the space city and the character, or can contain a part of the characters of the space city and the character of a part of other characters.

8. The method of converting a sequence of basic characters of a space-city-text into a sequence of printable characters of claim 7,

when the character rule is applied, the input character sequence is specifically text_basic, the character rules are grouped according to the character rule, the sequences of the groups { nmax }, the groups { nmax-1}, …, the groups {3}, and the groups {2}, each character rule in the group is sequentially taken out, the character rules are applied to the text_basic according to the step of the step 3, and after all the character rules are applied, the obtained result is marked as text_graphic, and all the space characters in the text_graphic are characters.

9. The method of converting a sequence of basic characters of a space-city-text into a sequence of printable characters of claim 8,

when the word combination rule is applied, specifically, a character sequence text_graphic is obtained after the word combination rule is applied as input, each word combination rule in the group is sequentially taken out according to the sequence of word combination rules of groups { mmax }, groups { mmax-1}, …, groups {3}, and groups {2}, and the word combination rule is applied to the text_graphic according to the step of the step 3, and the obtained result is marked as text_connection after all the word combination rules are applied, namely the final result.