CN102479187A - GBK (Chinese Internal Code Specification) character inquiring system on basis of parity check and implementing method thereof - Google Patents
GBK (Chinese Internal Code Specification) character inquiring system on basis of parity check and implementing method thereof Download PDFInfo
- Publication number
- CN102479187A CN102479187A CN2010105554867A CN201010555486A CN102479187A CN 102479187 A CN102479187 A CN 102479187A CN 2010105554867 A CN2010105554867 A CN 2010105554867A CN 201010555486 A CN201010555486 A CN 201010555486A CN 102479187 A CN102479187 A CN 102479187A
- Authority
- CN
- China
- Prior art keywords
- gbk
- character
- inquiry
- count
- valid
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
The invention discloses a GBK (Chinese Internal Code Specification) character inquiring system on the basis of parity check, which comprises a character basic inquiry module, a GBK parity check module and a Chinese character boundary verification module. The character basic inquiry module is used for carrying out basic inquiry on read GBK encoded character strings and inquiry character strings, searching positions in the GBK encoded character strings, at which the inquiry character strings occur, and recording an initial position and a final position; the GBK parity check module is used for carrying out encoding check on a basic inquiry result obtained by the character basic inquiry module by adopting a forward and backward bidirectional parity check method; and the Chinese character boundary verification module is used for judging whether the initial position and the final position are positioned on a boundary of a GBK double byte Chinese character according to a parity value check result of the GBK parity check module. Moreover, the invention also discloses an implementing method of the system. According to the invention, the boundary of the Chinese character can be searched and determined, so that the problem of inquiry mismatching which is easy to cause by encoding crossing of high and low bytes of the Chinese character is successfully solved.
Description
Technical field
The present invention relates to a kind of Chinese character inquiry system, relate in particular to a kind of GBK character inquiry system based on parity checking; In addition, the invention still further relates to this implementation method based on the GBK character inquiry system of parity checking.
Background technology
One, the Chinese character boundary problem of GBK coding
The GBK coding is one of most popular method of expression Chinese character in the computing machine.Its full name be " Chinese Internal Code Specification " (GBK); English name Chinese Internal Code Specification; Whole nation information technology standard technical committee of the People's Republic of China (PRC) works out on Dec nineteen ninety-five 1; Standardization department of State Bureau of Technical Supervision, Ministry of Electronics Industry's science and technology and the form that quality supervision department unites with No. 1995229 files of the technical supervising offer of tender on Dec nineteen ninety-five 15 are confirmed as the technical manual directive document with it, issue and enforcement.GBK is coded in the ISN extension specification on the GB2312-80 standard base; Used the double-byte encodings scheme, its coding range is from 8140 to FEFE (rejecting xx7F), totally 23940 sign indicating number positions; 21003 Chinese characters have been included altogether; Complete compatible GB2312-80 standard is supported the whole China, Japan and Korea S. Chinese character among international standard ISO/IEC10646-1 and the standard GB 13000-1, and has comprised all Chinese characters in the BIG5 coding.The high byte scope of GBK coding is 0 * 81-0xFE, and the low byte scope is 0x40-7E and 0x80-0xFE.
The GBK encode Chinese characters for computer may encounter problems when definite Chinese character border, mainly shows:
1.GBK in the coding, part coding and ASC-II coding have overlapping, the mistake gunnery problems that causes the ASC character to be searched;
2. the double-byte encodings mode does not have zone bit, is difficult to confirm the start byte and the position that stops byte of single Chinese character, when causing carrying out the inquiry of single Chinese character, can't confirm the Chinese character border.
Therefore, need a kind of GBK coding from matching system, can search and the border of definite Chinese character, thereby successfully solve above-mentioned inquiry mistake matching problem.
Two, the not clear problem that is caused in GBK Chinese character border
In the GBK coded system, Chinese character has adopted the coded system of double byte, and promptly each Chinese character is represented by 2 bytes.For example, "Jin Huai Chun Water Culture Collection," this sentence, the computer seems, is a string, hexadecimal notation as: "BD? F9? BB? B3? 89? 40? CB? AE? CE? C4? BB ? AF? CE? C4? BC? AF ".
Because the GBK coding lacks zone bit, computing machine is difficult to judge the border of Chinese character when judging this section character string.The problem that causes thus is, carrying out character when searching, because the Chinese character border is uncertain, causes the character match problem of misalignment.
For example, the string, the Chinese character "Chun", GBK encoding [89,40].And encode 40 also the expression be ASC symbol " ".Therefore, when the symbol'', you will find the string "Jin Huai Chun Water Culture Collection" appears in the symbol does not match with the actual situation.
Problem except the ASC character is searched also can go wrong when looking up Chinese characters.This is because the border of GBK encode Chinese characters for computer is indeterminate, also can cause the Chinese character problem of misalignment.
Chinese character string " Health Education for College Students " for example, corresponding GBK is encoded to " B4 F3 D1 A7 C9FA BD A1 BF B5 BD CC D3 FD ", if when searching Chinese character " Gou " therein, can find it is to exist.Be encoded to [F3, D1] owing to " Gou " just is that the low byte F3 of Chinese character " greatly " and the high byte D1 of " " word combine, thereby caused this mistake.
Summary of the invention
The technical matters that the present invention will solve provides a kind of GBK character inquiry system based on parity checking, and this system can search and the border of definite Chinese character, intersects the inquiry mistake matching problem that causes easily thereby successfully solve Chinese character height byte code.For this reason, the present invention also provides this implementation method based on the GBK character inquiry system of parity checking.
For solving the problems of the technologies described above, the present invention provides a kind of GBK character inquiry system based on parity checking, and this system comprises three modules: character base enquiry module, GBK parity checking module and Chinese character border authentication module;
This character base enquiry module is used for GBK coded string that reads and inquiry string are carried out the basis inquiry, in the GBK coded string, finds and satisfies the position that inquiry string occurs, and write down its reference position and final position;
This GBK parity checking module is used for the basic Query Result of this character base enquiry module gained is carried out coding checkout; At first detect byte forward successively to judge the parity value of step-length counter count, detect byte backward successively to judge the parity value of step-length counter count along final position then along reference position;
This Chinese character border authentication module is used for judging according to the parity value check results of this GBK parity checking module whether reference position and final position are in the border of GBK double byte Chinese character.
The inquiry mode of said character base enquiry module is for scan the GBK coded string from left to right successively; Find and satisfy the position that inquiry string occurs; The line item reference position of going forward side by side is headpos_k; Final position is tailpos_k, and wherein digital k is illustrated in the current GBK coded string result that the k time basic match query arrives.
Detect the parity value concrete employing following method of byte to judge step-length counter count forward successively along reference position in the said GBK parity checking module: at first, count initially is made as 0 with the step-length counter; Then, along headpos_k forward, detect byte T_i successively, i=headpos1-1 wherein, headpos1-2 ...., 0; Then, whether be 0, and carry out processing logic according to the numerical value of T_i&0x80 computing if calculating T_i&0x80; Judge the parity value of step-length counter count at last,, then write down head_valid=0 if count is an odd number; If count is an even number, then write down head_valid=1.
Detect the parity value concrete employing following method of byte to judge step-length counter count backward successively along final position in the said GBK parity checking module: at first, count initially is made as 0 with the step-length counter; Then, along tailpos_k backward, detect byte T_i successively, i=tailpos+1 wherein, tailpos1+2 ....; Then, whether be 0, and carry out processing logic according to the numerical value of T_i&0x80 computing if calculating T_i&0x80; Judge the parity value of step-length counter count at last,, then write down tail_valid=0 if count is an odd number; If count is an even number, then write down tail_valid=1.
The verification method of said Chinese character border authentication module is specially: if head_valid=1 and tail_valid=1, the matching result of then current GBK character is effective, and with the match information of this time inquiry gained: headpos_k, tailpos_k carries out record; If head_valid=0 or tail_valid=0; The matching result of then current GBK character is invalid, ignores this matching result, and k=k+1 is set; Continue to return GBK parity checking module; Again carrying out the checking work of next inquiring position, is that last matching result of character base enquiry module just finishes inquiry until k, the output Query Result.
In addition, the present invention also provides a kind of implementation method of the GBK character inquiry system based on parity checking, comprises the steps:
(1) reads the character string that GBK encodes, import in the given character string, with the text_str mark;
(2) read inquiry string, be labeled as query_str;
(3) query_str and text_str are carried out the basis inquiry; Mode is for scan text_str from left to right successively; Find and satisfy the position that query_str occurs; The line item reference position of going forward side by side is headpos_k, and final position is tailpos_k, and wherein digital k is illustrated among the current string text_str result that the k time basic match query arrives;
(4) after the basic Query Result headpos_k of obtaining step (3) and tailpos_k, carry out coding checkout; Be specially: steps A: detect byte T_i forward successively to judge the parity value of step-length counter count along headpos_k, wherein, i=headpos1-1; Headpos1-2 ...., 0; Step B: detect byte T_i backward successively to judge the parity value of step-length counter count along tailpos_k, i=tailpos+1 wherein, tailpos1+2 ....;
(5) judge according to the parity value check results of step (4) whether headpos_i and tailpos_i are on the border of GBK double byte Chinese character;
(6) output GBK character Query Result.
In step (4), said steps A is specially: 1) step-length counter count initially is made as 0; 2) along headpos_k forward, detect byte T_i successively, wherein, i=headpos1-1, headpos1-2 ...., 0; Whether 3) calculate T_i&0x80 is 0; 4) numerical value according to the T_i&0x80 computing carries out following processing logic: if T_i&0x80 equals 0, then write down head_valid=1, and stop this step subsequent flow process, directly get into step B; If T_i&0x80 is not equal to 0,,, carries out following two and handle sub-logic again according to the numerical value of T_i then with counter count=count+1: if i=0 then stops this step, and output count numerical value; If i＞0 then is made as T_i-1 with T_i, and carry out the computing of above-mentioned steps A again, promptly continue to detect forward along this character string; 5) parity value of judgement step-length counter count if count is an odd number, then writes down head_valid=0; If count is an even number, then write down head_valid=1.
In step (4), said step B is specially: 1) step-length counter count initially is made as 0; 2) along tailpos_k backward, detect byte T_i successively, i=tailpos+1 wherein, tailpos1+2 ....; Whether 3) calculate T_i&0x80 is 0; 4) numerical value according to the T_i&0x80 computing carries out following processing logic: if T_i&0x80 equals 0, then write down tail_valid=1, and stop this step subsequent flow process; If T_i&0x80 is not equal to 0,,, carries out following two and handle sub-logic again according to the numerical value of T_i then with counter count=count+1: if i is identical with the length of current string text_str, then stop this step, and output count numerical value; If the length of i＜current string text_str then is made as T_i+1 with T_i, and carry out the computing of above-mentioned steps B again, promptly continue to detect backward along this character string; 5) parity value of judgement step-length counter count if count is an odd number, then writes down tail_valid=0; If count is an even number, then write down tail_valid=1.
Step (5) is specially: if when head_valid=1 and tail_valid=1, the matching result of then current GBK character is effective, and with the match information of this time inquiry gained: headpos_k, tailpos_k carries out record; If when head_valid=0 or tail_valid=0, the matching result of then current GBK character is invalid, ignores this matching result, and k=k+1 is set, and continues to return step (4), carries out the checking work of next inquiring position again.
Step (6) is specially: if k has been last matching result of step (3), then finish all checking work of this inquiry, with whole headpos_k of successful match, tailpos_k character Query Result is exported; If k is not last matching result of step (3), k=k+1 then is set, continue to return step (4), carry out the checking work of next inquiring position again.
Beneficial effect of the present invention is: the character string that the present invention is directed to the GBK coding; When carrying out the character inquiry; Because the mistake matching problem that Chinese character height byte code intersection causes has easily proposed a kind of GBK character inquiry system based on parity checking from coupling, this system is made up of character base enquiry module, GBK parity checking module, Chinese character border authentication module three parts; Utilize the characteristics of Chinese character double-byte encodings; Used forward the method for two-way parity checking backward, the result verifies one by one to character match, this system facts have proved can the inquiry of good treatment GBK character problem; The result of high low byte mistake coupling can be rejected, the result of legal coupling can be kept again.
Description of drawings
Fig. 1 is the modular structure and the schematic flow sheet of system of the present invention.
Embodiment
As shown in Figure 1, the present invention proposes a kind of GBK character inquiry system based on parity checking from coupling, and this system comprises three modules: character base enquiry module, GBK parity checking module, Chinese character border authentication module.Be connected the character match problem of misalignment that is run into during string searching in processing GBK that can the be good coding each other through these three modules.
Lift an embodiment below and specify this implementation method based on the GBK character inquiry system of parity checking, it comprises the steps (see figure 1):
1. this system at first reads the character string (promptly reading the GBK matched text) of GBK coding, imports in the given character string, here with the text_str mark.And be unit with byte (Byte), each byte of this character string is named successively: T_0, T_1, T_2, T_3, T_4
2. reading inquiry string, be labeled as query_str here, is that unit carries out mark, called after: Q_0, Q_1, Q_2, Q_3, Q_4 with byte (Byte) equally ... ..
3. character base enquiry module:
Query_str and text_str are carried out the basis inquiry, and mode is for scan text_str, find the position of satisfying the query_str appearance from left to right successively; The line item reference position of going forward side by side is headpos_k; Final position is that (wherein digital k is illustrated among the current string text_str result that the k time basic match query arrives to tailpos_k, is headpos_1 and tailpos_1 for the first time promptly, and be headpos_2 and tailpos_2 the second time; By that analogy); Be among the text_str, identical from character string and query_str between T_headpos_k to the T tailpo_k.
4.GBK parity checking module:
This module is carried out coding checkout after basic Query Result headpos_k that obtains character base enquiry module gained and tailpos_k.Concrete treatment scheme is:
Steps A:
1) step-length counter count is set and is initially 0;
2) detect byte T_i (i=headpos1-1, headpos1-2 successively along headpos_k forward ...., 0);
Whether 3) calculate T_i&0x80 is 0 (computing parameter is here got the former of 0x80 because according to the rule of GBK coding, the coding range of high byte is the sign that legal Chinese character high byte begins more than or equal to 0x80).Wherein symbol & representes that step-by-step carries out boolean's AND operation, with computing (And) rule is: 0&0=0,0&1=0,1&0=0,1&1=1; Step-by-step and computing do, byte with binary expansion, and is carried out and calculated each, and for example: if T is i=0x9E, then binary form is shown 10011110; And the binary expansion of 0x80 is 10000000.At this moment: T_i&0x80=10011110&10000000=10000000;
4) according to the numerical value of T_i&0x80 computing, carry out following processing logic:
If-equal 0, then write down head_valid=1; And stop this step subsequent flow process, the step B below directly getting into;
If-be not equal to 0, then with counter count=count+1,, carry out following two and handle sub-logic again according to the numerical value of T i:
If i=0 (i.e. the stem of character string has been arrived in expression) then stops this step, and output count numerical value;
If i＞0 then is made as T_i-1 with T_i, and carry out the computing of above-mentioned steps A again, promptly continue to detect forward along this character string;
5) handle normal the completion more than in the steps A after, judge the parity value of step-length counter count:
If-count is an odd number, then write down head_valid=0;
If-count is an even number, then write down head_valid=1.
Step B:
1) step-length counter count is set and is initially 0;
2) along tailpos_k backward, detect byte T_i (i=tailpos+1, tailpos1+2 successively ... .);
Whether 3) calculate T_i&0x80 is 0 (method is identical with steps A);
4) according to the numerical value of T_i&0x80 computing, carry out following processing logic:
If-equal 0, then write down tail_valid=1, and stop this step subsequent flow process;
If-be not equal to 0, then with counter count=count+1,, carry out following two and handle sub-logic again according to the numerical value of T_i:
If i=text_str.length (i is identical with the length of current string text_str in expression, has promptly arrived the afterbody of character string) then stops this step, and output count numerical value;
If i＜text_str.length then is made as T_i+1 with T_i, and carry out the computing of above-mentioned steps again, promptly continue to detect backward along this character string;
5) handle normal the completion more than among the step B after, judge the parity value of step-length counter count:
If-count is an odd number, then write down tail_valid=0;
If-count is an even number, then write down tail_valid=1.
5. Chinese character border authentication module:
The result of GBK parity checking module is imported Chinese character border authentication module, handle.According to the numerical value of head_valid and tail_valid, judge whether headpos_i and tailpos_i are on the border of GBK double byte Chinese character, and processing logic is:
If when-head_valid=1 and tail_valid=1, think that the matching result of current GBK character is effective, with the match information of this time inquiry gained: headpos_k, tailpos_k carries out record;
If when-head_valid=0 or tail_valid=0, think that the matching result of current GBK character is invalid, ignore this matching result, and k=k+1 is set, continue to return GBK parity checking module, carry out the checking work of next inquiring position again;
6. export GBK character Query Result
After more than judgement finished, then the checking of character string subsequent query position was carried out in circulation, and processing logic is:
If-k has been last matching result of character base enquiry module, then finish all checking work of this inquiry, with whole headpos_k of successful match, tailpos_k information (being GBK character Query Result) is exported.
If-k is not last matching result of character base enquiry module, k=k+1 then is set, continue to return GBK parity checking module, carry out the checking work of next inquiring position again.
A kind of GBK character inquiry system that the present invention proposes based on parity checking; This system is directed against the character string of GBK coding, when carrying out the character inquiry, because the mistake matching problem that Chinese character height byte code intersection causes easily; One cover inquiry system has been proposed; This system is made up of character base enquiry module, GBK parity checking module, Chinese character border authentication module three parts, utilizes the characteristics of Chinese character double-byte encodings, has used forward the method for two-way parity checking backward; The result verifies one by one to character match; The problem that facts have proved the inquiry of ability good treatment GBK character of this system can be rejected the result that high low byte mistake is mated, and can keep the result of legal coupling again.
Claims (10)
1. the GBK character inquiry system based on parity checking is characterized in that this system comprises three modules: character base enquiry module, GBK parity checking module and Chinese character border authentication module;
This character base enquiry module is used for GBK coded string that reads and inquiry string are carried out the basis inquiry, in the GBK coded string, finds and satisfies the position that inquiry string occurs, and write down its reference position and final position;
This GBK parity checking module is used for the basic Query Result of this character base enquiry module gained is carried out coding checkout; At first detect byte forward successively to judge the parity value of step-length counter count, detect byte backward successively to judge the parity value of step-length counter count along final position then along reference position;
This Chinese character border authentication module is used for judging according to the parity value check results of this GBK parity checking module whether reference position and final position are in the border of GBK double byte Chinese character.
2. the GBK character inquiry system based on parity checking as claimed in claim 1; It is characterized in that; The inquiry mode of said character base enquiry module satisfies the position that inquiry string occurs for scanning the GBK coded string from left to right successively, finding, and the line item reference position of going forward side by side is headpos_k; Final position is tailpos_k, and wherein digital k is illustrated in the current GBK coded string result that the k time basic match query arrives.
3. the GBK character inquiry system based on parity checking as claimed in claim 2; It is characterized in that; Detect the parity value concrete employing following method of byte to judge step-length counter count forward successively along reference position in the said GBK parity checking module: at first, count initially is made as 0 with the step-length counter; Then, along headpos_k forward, detect byte T_i successively, i=headpos1-1 wherein, headpos1-2 ...., 0; Then, whether be 0, and carry out processing logic according to the numerical value of T_i&0x80 computing if calculating T_i&0x80; Judge the parity value of step-length counter count at last,, then write down head_valid=0 if count is an odd number; If count is an even number, then write down head_valid=1.
4. the GBK character inquiry system based on parity checking as claimed in claim 2; It is characterized in that; Detect the parity value concrete employing following method of byte to judge step-length counter count backward successively along final position in the said GBK parity checking module: at first, count initially is made as 0 with the step-length counter; Then, along tailpos_k backward, detect byte T_i successively, i=tailpos+1 wherein, tailpos1+2 ....; Then, whether be 0, and carry out processing logic according to the numerical value of T_i&0x80 computing if calculating T_i&0x80; Judge the parity value of step-length counter count at last,, then write down tail_valid=0 if count is an odd number; If count is an even number, then write down tail_valid=1.
5. like claim 3 or 4 described GBK character inquiry systems based on parity checking; It is characterized in that; The verification method of said Chinese character border authentication module is specially: if head_valid=1 and tail_valid=1; The matching result of then current GBK character is effective, and with the match information of this time inquiry gained: headpos_k, tailpos_k carries out record; If head_valid=0 or tail_valid=0; The matching result of then current GBK character is invalid, ignores this matching result, and k=k+1 is set; Continue to return GBK parity checking module; Again carrying out the checking work of next inquiring position, is that last matching result of character base enquiry module just finishes inquiry until k, the output Query Result.
6. the implementation method based on the GBK character inquiry system of parity checking is characterized in that, comprises the steps:
(1) reads the character string that GBK encodes, import in the given character string, with the text_str mark;
(2) read inquiry string, be labeled as query_str;
(3) query_str and text_str are carried out the basis inquiry; Mode is for scan text_str from left to right successively; Find and satisfy the position that query_str occurs; The line item reference position of going forward side by side is headpos_k, and final position is tailpos_k, and wherein digital k is illustrated among the current string text_str result that the k time basic match query arrives;
(4) after the basic Query Result headpos_k of obtaining step (3) and tailpos_k, carry out coding checkout; Be specially: steps A: detect byte T_i forward successively to judge the parity value of step-length counter count along headpos_k, wherein, i=headpos1-1; Headpos1-2 ...., 0; Step B: detect byte T_i backward successively to judge the parity value of step-length counter count along tailpos_k, i=tailpos+1 wherein, tailpos1+2 ....;
(5) judge according to the parity value check results of step (4) whether headpos_i and tailpos_i are on the border of GBK double byte Chinese character;
(6) output GBK character Query Result.
7. the implementation method of the GBK character inquiry system based on parity checking as claimed in claim 6 is characterized in that in step (4), said steps A is specially: 1) step-length counter count initially is made as 0; 2) along headpos_k forward, detect byte T_i successively, wherein, i=headpos1-1, headpos1-2 ...., 0; Whether 3) calculate T_i&0x80 is 0; 4) numerical value according to the T_i&0x80 computing carries out following processing logic: if T_i&0x80 equals 0, then write down head_valid=1, and stop this step subsequent flow process, directly get into step B; If T_i&0x80 is not equal to 0,,, carries out following two and handle sub-logic again according to the numerical value of T_i then with counter count=count+1: if i=0 then stops this step, and output count numerical value; If i＞0 then is made as T_i-1 with T_i, and carry out the computing of above-mentioned steps A again, promptly continue to detect forward along this character string; 5) parity value of judgement step-length counter count if count is an odd number, then writes down head_valid=0; If count is an even number, then write down head_valid=1.
8. the implementation method of the GBK character inquiry system based on parity checking as claimed in claim 6 is characterized in that in step (4), said step B is specially: 1) step-length counter count initially is made as 0; 2) along tailpos_k backward, detect byte T_i successively, i=tailpos+1 wherein, tailpos1+2 ....; Whether 3) calculate T_i&0x80 is 0; 4) numerical value according to the T_i&0x80 computing carries out following processing logic: if T_i&0x80 equals 0, then write down tail_valid=1, and stop this step subsequent flow process; If T_i&0x80 is not equal to 0,,, carries out following two and handle sub-logic again according to the numerical value of T_i then with counter count=count+1: if i is identical with the length of current string text_str, then stop this step, and output count numerical value; If the length of i＜current string text_str then is made as T_i+1 with T_i, and carry out the computing of above-mentioned steps B again, promptly continue to detect backward along this character string; 5) parity value of judgement step-length counter count if count is an odd number, then writes down tail_valid=0; If count is an even number, then write down tail_valid=1.
9. the implementation method of the GBK character inquiry system based on parity checking as claimed in claim 6; It is characterized in that; Step (5) is specially: if when head_valid=1 and tail_valid=1; The matching result of then current GBK character is effective, and with the match information of this time inquiry gained: headpos_k, tailpos_k carries out record; If when head_valid=0 or tail_valid=0, the matching result of then current GBK character is invalid, ignores this matching result, and k=k+1 is set, and continues to return step (4), carries out the checking work of next inquiring position again.
10. the implementation method of the GBK character inquiry system based on parity checking as claimed in claim 6; It is characterized in that; Step (6) is specially: if k has been last matching result of step (3); Then finish all checking work of this inquiry, with whole headpos_k of successful match, tailpos_k character Query Result is exported; If k is not last matching result of step (3), k=k+1 then is set, continue to return step (4), carry out the checking work of next inquiring position again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010555486.7A CN102479187B (en) | 2010-11-23 | 2010-11-23 | GBK character inquiry system based on even-odd check and its implementation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010555486.7A CN102479187B (en) | 2010-11-23 | 2010-11-23 | GBK character inquiry system based on even-odd check and its implementation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102479187A true CN102479187A (en) | 2012-05-30 |
| CN102479187B CN102479187B (en) | 2016-09-14 |
Family
ID=46091837
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010555486.7A Active CN102479187B (en) | 2010-11-23 | 2010-11-23 | GBK character inquiry system based on even-odd check and its implementation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102479187B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110531307A (en) * | 2019-09-12 | 2019-12-03 | 宁波三星医疗电气股份有限公司 | Adjustment method, device and the electric power acquisition terminal of electric power acquisition terminal |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6157905A (en) * | 1997-12-11 | 2000-12-05 | Microsoft Corporation | Identifying language and character set of data representing text |
| CN2869995Y (en) * | 2004-12-31 | 2007-02-14 | 北京中星微电子有限公司 | Chinese-character searching engine |
| CN1916888A (en) * | 2005-08-15 | 2007-02-21 | 国际商业机器公司 | Method and system of identifying language of double-byte character set character data |
| US20070176802A1 (en) * | 2006-01-24 | 2007-08-02 | Zih Corp. | Global printing system and method of using same |
-
2010
- 2010-11-23 CN CN201010555486.7A patent/CN102479187B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6157905A (en) * | 1997-12-11 | 2000-12-05 | Microsoft Corporation | Identifying language and character set of data representing text |
| CN2869995Y (en) * | 2004-12-31 | 2007-02-14 | 北京中星微电子有限公司 | Chinese-character searching engine |
| CN1916888A (en) * | 2005-08-15 | 2007-02-21 | 国际商业机器公司 | Method and system of identifying language of double-byte character set character data |
| US20070176802A1 (en) * | 2006-01-24 | 2007-08-02 | Zih Corp. | Global printing system and method of using same |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110531307A (en) * | 2019-09-12 | 2019-12-03 | 宁波三星医疗电气股份有限公司 | Adjustment method, device and the electric power acquisition terminal of electric power acquisition terminal |
| CN110531307B (en) * | 2019-09-12 | 2021-09-21 | 宁波三星医疗电气股份有限公司 | Debugging method and device of power acquisition terminal and power acquisition terminal |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102479187B (en) | 2016-09-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8670976B2 (en) | System and methods for encoding and decoding multi-lingual text in a matrix code symbol | |
| CN108776673B (en) | Automatic conversion method and device of relation mode and storage medium | |
| CN105630765A (en) | Place name address identifying method | |
| CN104750666A (en) | Text character encoding mode identification method and system | |
| CN105095237A (en) | Method and device used for generating schema of not-only-structured-query-language database | |
| CN101876965A (en) | Method and system used for processing text | |
| CN105335378A (en) | Multi-data source information processing device and method, and server | |
| CN105243168A (en) | Data migration method and system | |
| CN112948776A (en) | Digital watermark adding method and device, electronic equipment and storage medium | |
| WO2014106037A1 (en) | Detecting product lines within product search queries | |
| CN104424010A (en) | Method and system for detecting and repairing text document messy codes | |
| CN106649333B (en) | Method and device for detecting consistency of field sequence | |
| CN102479187A (en) | GBK (Chinese Internal Code Specification) character inquiring system on basis of parity check and implementing method thereof | |
| CN104243095A (en) | Code word type blind identification method for convolutional code and linear block code | |
| CN105373392A (en) | DOS system based control method for digit number of character string of scanning sequence | |
| CN103051417A (en) | Fixed code length complementary type coding method for infrared remote controller | |
| CN103049619A (en) | Method for completing chip design integrated functions by forms | |
| CN105608137A (en) | Method and device for extracting identity label | |
| CN102156789B (en) | System and method for automatically generating constraint file of field programmable gate array (FPGA) | |
| CN102841988A (en) | System and method for matching nucleotide sequence information | |
| CN101702100A (en) | Word input method and word input device | |
| CN109634578B (en) | Program generation method based on text description | |
| CN103995602B (en) | A kind of certificate information typing output and the method for error correction | |
| CN102073682A (en) | Code mode-based document data recovering system and quick recovering method thereof | |
| CN100479331C (en) | Bar-code decoding method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20190222 Address after: 201203 7, 1 Lane 666 lane, Zhang Heng Road, Pudong New Area, Shanghai. Patentee after: SHANGHAI ZHANGMEN TECHNOLOGY CO., LTD. Address before: 201203 No. 356 GuoShoujing Road, Zhangjiang High-tech Park, Pudong New Area, Shanghai Patentee before: Shengle Information Technology (Shanghai) Co., Ltd. |