CN101986308A - Quick term marking method - Google Patents

Quick term marking method Download PDF

Info

Publication number
CN101986308A
CN101986308A CN 201010545766 CN201010545766A CN101986308A CN 101986308 A CN101986308 A CN 101986308A CN 201010545766 CN201010545766 CN 201010545766 CN 201010545766 A CN201010545766 A CN 201010545766A CN 101986308 A CN101986308 A CN 101986308A
Authority
CN
China
Prior art keywords
term
length
substring
prefix table
prefix
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
Application number
CN 201010545766
Other languages
Chinese (zh)
Other versions
CN101986308B (en
Inventor
江潮
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Transn Iol Technology Co ltd
Original Assignee
TRANSN (BEIJING) INFORMATION TECHNOLOGY Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by TRANSN (BEIJING) INFORMATION TECHNOLOGY Co Ltd filed Critical TRANSN (BEIJING) INFORMATION TECHNOLOGY Co Ltd
Priority to CN 201010545766 priority Critical patent/CN101986308B/en
Publication of CN101986308A publication Critical patent/CN101986308A/en
Application granted granted Critical
Publication of CN101986308B publication Critical patent/CN101986308B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses a quick term marking method, which comprises the following steps of: establishing a prefix table and uploading the prefix table into a memory, reading characters which comprise at least one sub-string; extracting one sub-string from the characters and searching for a term in the prefix table by using the sub-string; and recording current searched sub-strings as terms. In the invention, when the term marking is carried out, a prejudgment is made by using the term prefix table which is pre-established and cached in the memory, so that the searching times of a term base are greatly reduced.

Description

The quick mask method of a kind of term
Technical field
The present invention relates to contribution pre-service analytical technology in a kind of translation process, specifically, next method exactly soon hastens the known term in the contribution to mark out earlier before translating.
Background technology
The mark that is applied to translate field contribution pre-service analysis tool has at present mainly adopted the method for " maximum forward coupling " or " maximum reverse coupling ", to obtain the term of full sense the longest as far as possible.Do simple an introduction with regard to top two kinds of methods below.
" maximum forward coupling ", promptly to terminology bank, retrieve one by one from a sub-start of string of the minimum length of target terms, word string length of every retrieval just adds 1, and till leading word string length and reaching certain threshold values, the word string that wherein matches for the last time is exactly a target terms.
Opposite with " maximum forward coupling ", " maximum reverse coupling " is to intercept in the terminology bank since the word string of the maximum length of a setting earlier to retrieve, word string length of every retrieval just subtracts 1, just stop in case finding the content match in word string and the terminology bank, the word string that wherein matches for the last time is exactly a target terms.
Be that example is done an analysis simply with " maximum reverse coupling " now.Supposing has sentence: " we will have an opportunity to exchange with regard to the charitable work of China with the philanthropist with Chinese a collection of successful businessperson S=.", suppose that simultaneously the maximum length of term is 10, there is not term in the sentence.
According to top condition find if desired among the sentence S all terms then needs begin the word string of first length 10 of retrieval terminology bank from first word of sentence S, we are S (1 at note, 10), if do not retrieve in the terminology bank then continue S (1,9) the rest may be inferred knows and finds till the term, if do not find term then from S (2 yet during to S (1,1), 10) begin to continue up to match term or this proceeds to S (n, 1) always.Detailed process is as shown in the table:
The word string name The word string content Whether retrieve
S(1，10) We will have an opportunity and China one Not
S(1，9) We will have an opportunity and China Not
S(1，8) We will have an opportunity with in Not
S(1，7) We will have an opportunity with Not
S(1，6) We will have an opportunity Not
S(1，5) We are with organic Not
S(1，4) We will have Not
S(1，3) We will Not
S(1，2) We Not
S(1，1) I Not
S(2，10) Will have an opportunity with China a collection of Not
…… …… ……
S(34，1) Stream Not
If will not carry out 295 term retrievals according to above-mentioned way when in sentence S, having term.
Subject matter in the method for introducing above is exactly to have a large amount of terminology bank query manipulations in passage, has reduced the efficient of term marking process widely.
Summary of the invention
Technical matters solved by the invention provides the quick mask method of a kind of term, has significantly reduced the retrieval number of times to terminology bank.
Technical scheme is as follows:
The quick mask method of a kind of term comprises:
Set up prefix table, and described prefix table is loaded in the internal memory, read literal, described literal comprises at least one substring;
Extract a substring in the described literal, described substring is carried out the retrieval of term in described prefix table;
The current substring that finds is noted as term.
Further: the structure of described prefix table comprises the minimum length of the prefix of term, term and the maximum length of term.
Further: if the length of described substring is then retrieved terminology bank between the minimum length and maximum length of term.
Further: set up nomenclature, will, described nomenclature is loaded in the internal memory, and the term behind the record is retrieved in described nomenclature, and described term unification is retrieved in original text, translation and the additional information that obtains described term in described terminology bank.
Further: if described substring does not retrieve in nomenclature, the prefix of described substring exists in prefix table simultaneously, and the reference position of so current substring is constant, will continue the described prefix table of retrieval behind the contraction in length.
Further: if the length of current substring changes the reference position of described current substring, and begins to retrieve described prefix table from maximum term length again less than the length of short term in the prefix table.
Further:, and begin to retrieve described prefix table from maximum term length again if the length of current substring greater than the length of maximum term in the described prefix table, changes the reference position of current substring.
Further: use in the described nomenclature of original text in internal memory of described term and retrieve, if retrieve then return the term unique ID of term; Described term ID unification is retrieved in original text, translation and the additional information that obtains term in described terminology bank.
Further: the data structure of described nomenclature comprises the source language ID of term, target language ID, unique identification, term original text and the byte number of term.
The technique effect that technical solution of the present invention is brought comprises:
1, when carrying out term marking, makes pre-judgments and significantly reduced retrieval number of times terminology bank by the term prefix table of setting up in advance in the internal memory of being buffered in.
2, the key message in the terminology bank is loaded in the internal memory with the least possible space buffer memory terminology data as much as possible and has promoted performance in the term marking process greatly.
Description of drawings
Fig. 1 is based on the term marking process flow diagram of prefix table among the present invention;
Fig. 2 is applied to the design sketch of annotating and commenting on after the annotations and comments module among the present invention.
Embodiment
The present invention is mainly used in the contribution pre-service in translation field and analyzes link, its major function is just analyzed contribution to be translated the term search that all have existed in the contribution is come out in terminology bank, so that translator when translating (referring to Fig. 2) as a reference.In this process, how all substrings in every section literal are retrieved efficiently at the terminology bank of magnanimity, all known terms tag that occur in the literal are come out just to become the problem that emphasis of the present invention will solve.
Step 1, utilize prefix table to carry out the retrieval of term.
Step 101: set up prefix table.
The term prefix
The minimum length M of the term of prefix
The maximum length N of the term of prefix
The structure of prefix table as shown above, first field is the prefix of term, second field record with the minimum length of the term of this prefix beginning, the 3rd field record with the maximum length of the term of this prefix beginning.
Step 102: term marking begins.At first reading passage length is W.Suppose that the maximum term length L that we are provided with is 10, divide that (n, represent by mode L) with S for all substrings in the analytic process since n word.
Step 103: from the 1st word of the literal that reads, intercepted length be L substring S (n, L), n represents the reference position of substring, L represents the length of substring.At this process n=1 at first for the first time, L=10;
Step 104: obtain substring S (n, prefix L);
Step 105: the retrieval prefix table, and judge whether to exist this prefix, if exist then forward step 106 to, if there is no then forward step 111 to;
Step 106: obtain minimum length M and maximum length N with these all terms of prefix;
Step 107: judge substring S (n, whether length L) between M and N, if then forward step 108 to, if not then forwarding step 115 to;
Step 108: retrieval terminology bank;
Step 109: (n L) then forwards step 110 to, otherwise changes step 112 over to if retrieve current substring S in terminology bank;
Step 110: the current current substring S that finds is noted as term;
Step 111: because substring S (n L) has determined it is term, so can directly skip this substring, continue from n+L begin to search next term (this moment n=n+L, L=10);
Step 112:(connects step 109) when substring does not retrieve in terminology bank, the prefix of this substring exists in prefix table simultaneously, and the reference position n of so current substring is constant, and length L is shortened the continuation of (L=L-1) back;
Step 113: judge current substring S (n, whether length L-1) less than the length M of short term in the prefix table, if then enter step 114, if not then entering step 108;
Step 114: if current substring S (n, length L-1) is less than the length M of short term in the prefix table; Then illustrate in terminology bank to find current substring, then change the reference position (n=n+1) of current substring, and continue said process (entering step 102) from maximum term length (L=10) again;
Step 115:(connects step 107) judge S (n, whether length L) greater than the length N of maximum term in the prefix table, if bigger then forward step 116 to than N, if smaller or equal to N then change step 117 over to;
Step 116: if S is (n, L) length is greater than the length N of maximum term in the prefix table or less than minimum length M, then illustrate in terminology bank and can not find current substring, so change the reference position (n=n+1) of current substring, and continue said process (entering step 102) from maximum term length (L=10) again;
Step 117: judge that (n, whether length L L) less than the length M of short term in the prefix table, if then enter step 116, otherwise enters step 108 to current substring S.
No matter in internal memory, it can reduce the access times to database to prefix table.For example: whether as long as find with " AB " be that the term of prefix does not exist, so just need not inquire about word strings such as " ABCDE ", " ABCD ", " ABC " degressively again is term at every turn for " ABCDE ".Prefix table and nomenclature are all in internal memory.
Step 2, the nomenclature after will simplifying are loaded in the internal memory to promote the speed of term retrieval.
Though adopt prefix table to significantly reduce the number of times of visit terminology bank in each step in step 1, but the search operaqtion of terminology bank is remained the bottleneck of whole term marking process, the retrieval rate that how to promote terminology bank is exactly our next step problem that need solve at every turn.
For promote retrieval rate first thinkable be exactly with data load to internal memory, reduce the I/O operation of computing machine.But also preserved picture language direction, industry, client properties or the like a series of adeditive attribute except original text, the translation of having preserved term in the terminology bank, when the quantity of term is very large, can't all be added in internal memory, want to utilize the advantage of internal memory just must need to reduce the size of data that is loaded in the internal memory.
Can find that by matching process inquiring about whether a term exist is a very frequent operation, it only need know that the original text of term gets final product simultaneously, and other additional informations do not play a crucial role to judging whether term exists.The present invention utilizes term original text and a few crucial adeditive attribute to set up nomenclature, and nomenclature is loaded in the internal memory, can utilize memory source more fully, is added in more term in limited internal memory.
The following describes the structure of the preferred nomenclature of the present invention, the structure of passing through the data that are loaded into the nomenclature in the internal memory after simplifying is as follows:
Field Byte number
The source language ID of term 2 bytes
The target language ID of term (2 byte) 2 bytes
The unique identification (4 byte) of term in terminology bank 4 bytes
Term original text (32 byte) 32 bytes
As can be seen, a term only needs 40 bytes to get final product from the structure of top nomenclature, and the memory headroom of 2G can be put more than 5,000 ten thousand terms, can satisfy the demands fully.In 1 step 108, can do so like this:
1) uses in the nomenclature of original text in internal memory of term and retrieve, if retrieve then return the ID (term unique identification) of term.
2) we can obtain a series of term ID that retrieve after whole section literal all finished dealing with;
3) afterwards these terms ID unification is retrieved original text, translation and other additional informations that obtains term in terminology bank.
As shown in Figure 2, be to be applied to the design sketch of annotating and commenting on after the annotations and comments module among the present invention.Literal user-selected among the figure retrieves, and the literal that retrieves is marked with shading, font distortion and underscore.
By top two big technological improvements, when carrying out term marking, can significantly reduce retrieval number of times to terminology bank, promoted the performance of term marking process.

Claims (9)

1. quick mask method of term comprises:
Set up prefix table, and described prefix table is loaded in the internal memory, read literal, described literal comprises at least one substring;
Extract a substring in the described literal, described substring is carried out the retrieval of term in described prefix table;
The current substring that finds is noted as term.
2. the quick mask method of term as claimed in claim 1 is characterized in that: the structure of described prefix table comprises the minimum length of the prefix of term, term and the maximum length of term.
3. the quick mask method of term as claimed in claim 2 is characterized in that: if the length of described substring is then retrieved terminology bank between the minimum length and maximum length of term.
4. the quick mask method of term as claimed in claim 1, it is characterized in that: set up nomenclature, will, described nomenclature is loaded in the internal memory, term behind the record is retrieved in described nomenclature, described term unification is retrieved in original text, translation and the additional information that obtains described term in described terminology bank.
5. the quick mask method of term as claimed in claim 4, it is characterized in that: if described substring does not retrieve in nomenclature, the prefix of described substring exists in prefix table simultaneously, and the reference position of so current substring is constant, will continue the described prefix table of retrieval behind the contraction in length.
6. the quick mask method of term as claimed in claim 4, it is characterized in that: if the length of current substring is less than the length of short term in the prefix table, change the reference position of described current substring, and begin to retrieve described prefix table from maximum term length again.
7. the quick mask method of term as claimed in claim 4, it is characterized in that: if the length of current substring is greater than the length of maximum term in the described prefix table, change the reference position of current substring, and begin to retrieve described prefix table from maximum term length again.
8. the quick mask method of term as claimed in claim 7 is characterized in that: use in the described nomenclature of original text in internal memory of described term and retrieve, if retrieve then return the term unique ID of term; Described term ID unification is retrieved in original text, translation and the additional information that obtains term in described terminology bank.
9. the quick mask method of term as claimed in claim 4 is characterized in that: the data structure of described nomenclature comprises the source language ID of term, target language ID, unique identification, term original text and the byte number of term.
CN 201010545766 2010-11-16 2010-11-16 Quick term marking method Active CN101986308B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201010545766 CN101986308B (en) 2010-11-16 2010-11-16 Quick term marking method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201010545766 CN101986308B (en) 2010-11-16 2010-11-16 Quick term marking method

Publications (2)

Publication Number Publication Date
CN101986308A true CN101986308A (en) 2011-03-16
CN101986308B CN101986308B (en) 2013-07-31

Family

ID=43710654

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201010545766 Active CN101986308B (en) 2010-11-16 2010-11-16 Quick term marking method

Country Status (1)

Country Link
CN (1) CN101986308B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103729344A (en) * 2013-12-30 2014-04-16 传神联合（北京）信息技术有限公司 Method for labeling statements in document manuscript

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1770147A (en) * 2004-11-01 2006-05-10 英业达股份有限公司 Keyword segmented indexing type data query method and system
CN101464898A (en) * 2009-01-12 2009-06-24 腾讯科技（深圳）有限公司 Method for extracting feature word of text
CN101751430A (en) * 2008-12-12 2010-06-23 汉王科技股份有限公司 Electronic dictionary fuzzy searching method

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1770147A (en) * 2004-11-01 2006-05-10 英业达股份有限公司 Keyword segmented indexing type data query method and system
CN101751430A (en) * 2008-12-12 2010-06-23 汉王科技股份有限公司 Electronic dictionary fuzzy searching method
CN101464898A (en) * 2009-01-12 2009-06-24 腾讯科技（深圳）有限公司 Method for extracting feature word of text

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
《微电子学与计算机》 20071231 张辉 等 基于规则和统计的汉语多输出切分系统 56-58 第24卷, 第7期 2 *
《计算机工程》 20030630 徐菁 等 汉语语料的切分标注加工系统 66-68,165 第29卷, 第九期 2 *
《计算机系统应用》 20100831 任雪利 等 基于后缀数组的分词技术 229-230,211 第19卷, 第8期 2 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103729344A (en) * 2013-12-30 2014-04-16 传神联合（北京）信息技术有限公司 Method for labeling statements in document manuscript
CN103729344B (en) * 2013-12-30 2016-08-31 传神联合（北京）信息技术有限公司 A kind of method of statement mark in document manuscript

Also Published As

Publication number Publication date
CN101986308B (en) 2013-07-31

Similar Documents

Publication Publication Date Title
US7337165B2 (en) Method and system for processing a text search query in a collection of documents
KR101157693B1 (en) Multi-stage query processing system and method for use with tokenspace repository
US9069857B2 (en) Per-document index for semantic searching
US20050267915A1 (en) Method and apparatus for recognizing specific type of information files
US7199729B2 (en) Character code conversion methods and systems
US6826555B2 (en) Open format for file storage system indexing, searching and data retrieval
JP2000231563A (en) Document retrieving method and its system and computer readable recording medium for recording document retrieval program
CN102110123B (en) Method for establishing inverted index
WO2020133039A1 (en) Entity identification method and apparatus in dialogue corpus, and computer device
US20130254190A1 (en) Search device, search method, and computer program product
US6981002B2 (en) Docubase indexing, searching and data retrieval
CN106503195A (en) A kind of translation word stocks search method and system based on search engine
CN103064844A (en) Indexing equipment, indexing method, search device, search method and search system
CN101021851B (en) Text search device, text search method
CN107168966B (en) Search engine index construction method and device
CN103678385B (en) A kind of personalization lexicon building method suitable for mobile search
CN1256688C (en) Chinese segmenting method
CN101986308B (en) Quick term marking method
CN116126997B (en) Document deduplication storage method, system, device and storage medium
US7246107B2 (en) System and method for creating a data file for use in searching a database
CN105426490A (en) Tree structure based indexing method
JPH067385B2 (en) Automatic keyword extraction method
JP4091586B2 (en) Structured document management system, index construction method and program
KR100818628B1 (en) Apparatus and method for building patent translation dictionary
CN110867179A (en) File storage and retrieval method and system based on voice recognition, IKAnalyzer word segmentation and hdfs

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
ASS Succession or assignment of patent right

Owner name: TRANSN (CHINA) NETWORK TECHNOLOGY CO., LTD.

Free format text: FORMER OWNER: TRANSN (BEIJING) INFORMATION TECHNOLOGY CO., LTD.

Effective date: 20150624

C41 Transfer of patent application or patent right or utility model
TR01 Transfer of patent right

Effective date of registration: 20150624

Address after: 430070, Optics Valley Software Park, East Lake Development Zone, Wuhan, Hubei, six South, South Lake Road, Optics Valley Software Park, 2, 4, 204 rooms

Patentee after: Vivid (China) Network Technology Co.,Ltd.

Address before: 100085 Beijing city Haidian District Qingyun aromatic garden Ting Building 9, Tsing Wun contemporary building seventeen 1707A1 room

Patentee before: TRANSN (BEIJING) INFORMATION TECHNOLOGY Co.,Ltd.

PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Quick term marking method

Effective date of registration: 20150818

Granted publication date: 20130731

Pledgee: Guanggu Branch of Wuhan Rural Commercial Bank Co.,Ltd.

Pledgor: Vivid (China) Network Technology Co.,Ltd.

Registration number: 2015420000011

PLDC Enforcement, change and cancellation of contracts on pledge of patent right or utility model
PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20160823

Granted publication date: 20130731

Pledgee: Guanggu Branch of Wuhan Rural Commercial Bank Co.,Ltd.

Pledgor: Vivid (China) Network Technology Co.,Ltd.

Registration number: 2015420000011

PLDC Enforcement, change and cancellation of contracts on pledge of patent right or utility model
C56 Change in the name or address of the patentee
CP03 Change of name, title or address

Address after: 430070, Optics Valley Software Park, East Lake Development Zone, Wuhan, Hubei, six South, South Lake Road, Optics Valley Software Park, two, 4, 204 rooms

Patentee after: TRANSN IOL TECHNOLOGY Co.,Ltd.

Address before: 430070, Optics Valley Software Park, East Lake Development Zone, Wuhan, Hubei, six South, South Lake Road, Optics Valley Software Park, 2, 4, 204 rooms

Patentee before: Vivid (China) Network Technology Co.,Ltd.

PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Quick term marking method

Effective date of registration: 20160926

Granted publication date: 20130731

Pledgee: Guanggu Branch of Wuhan Rural Commercial Bank Co.,Ltd.

Pledgor: TRANSN IOL TECHNOLOGY Co.,Ltd.

Registration number: 2016420000038

PLDC Enforcement, change and cancellation of contracts on pledge of patent right or utility model
PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20170921

Granted publication date: 20130731

Pledgee: Guanggu Branch of Wuhan Rural Commercial Bank Co.,Ltd.

Pledgor: TRANSN IOL TECHNOLOGY Co.,Ltd.

Registration number: 2016420000038

PC01 Cancellation of the registration of the contract for pledge of patent right
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Quick term marking method

Effective date of registration: 20170927

Granted publication date: 20130731

Pledgee: Guanggu Branch of Wuhan Rural Commercial Bank Co.,Ltd.

Pledgor: TRANSN IOL TECHNOLOGY Co.,Ltd.

Registration number: 2017420000031

PE01 Entry into force of the registration of the contract for pledge of patent right
PC01 Cancellation of the registration of the contract for pledge of patent right
PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20180927

Granted publication date: 20130731

Pledgee: Guanggu Branch of Wuhan Rural Commercial Bank Co.,Ltd.

Pledgor: TRANSN IOL TECHNOLOGY Co.,Ltd.

Registration number: 2017420000031

PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Quick term marking method

Effective date of registration: 20180930

Granted publication date: 20130731

Pledgee: Guanggu Branch of Wuhan Rural Commercial Bank Co.,Ltd.

Pledgor: TRANSN IOL TECHNOLOGY Co.,Ltd.

Registration number: 2018420000053

PE01 Entry into force of the registration of the contract for pledge of patent right
PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20190926

Granted publication date: 20130731

Pledgee: Guanggu Branch of Wuhan Rural Commercial Bank Co.,Ltd.

Pledgor: TRANSN IOL TECHNOLOGY Co.,Ltd.

Registration number: 2018420000053

PC01 Cancellation of the registration of the contract for pledge of patent right
PE01 Entry into force of the registration of the contract for pledge of patent right
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Quick term marking method

Effective date of registration: 20190929

Granted publication date: 20130731

Pledgee: Guanggu Branch of Wuhan Rural Commercial Bank Co.,Ltd.

Pledgor: TRANSN IOL TECHNOLOGY Co.,Ltd.

Registration number: Y2019420000021

PC01 Cancellation of the registration of the contract for pledge of patent right
PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20201009

Granted publication date: 20130731

Pledgee: Guanggu Branch of Wuhan Rural Commercial Bank Co.,Ltd.

Pledgor: TRANSN IOL TECHNOLOGY Co.,Ltd.

Registration number: Y2019420000021

PE01 Entry into force of the registration of the contract for pledge of patent right
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: A fast term tagging method

Effective date of registration: 20201016

Granted publication date: 20130731

Pledgee: Guanggu Branch of Wuhan Rural Commercial Bank Co.,Ltd.

Pledgor: TRANSN IOL TECHNOLOGY Co.,Ltd.

Registration number: Y2020420000071

PC01 Cancellation of the registration of the contract for pledge of patent right
PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20211105

Granted publication date: 20130731

Pledgee: Guanggu Branch of Wuhan Rural Commercial Bank Co.,Ltd.

Pledgor: TRANSN IOL TECHNOLOGY Co.,Ltd.

Registration number: Y2020420000071

PE01 Entry into force of the registration of the contract for pledge of patent right
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: A fast labeling method of terms

Effective date of registration: 20211203

Granted publication date: 20130731

Pledgee: Guanggu Branch of Wuhan Rural Commercial Bank Co.,Ltd.

Pledgor: TRANSN IOL TECHNOLOGY Co.,Ltd.

Registration number: Y2021420000136

PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20221227

Granted publication date: 20130731

Pledgee: Guanggu Branch of Wuhan Rural Commercial Bank Co.,Ltd.

Pledgor: TRANSN IOL TECHNOLOGY Co.,Ltd.

Registration number: Y2021420000136

PC01 Cancellation of the registration of the contract for pledge of patent right