Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Quick term marking method

A terminology and fast technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve the problem of reducing the efficiency of the terminology labeling process, achieve the effect of reducing the number of searches and improving performance

Active Publication Date: 2011-03-16
TRANSN IOL TECH CO LTD
View PDF3 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0010] The main problem in the method introduced above is that when there are a large number of term base query operations in a piece of text, the efficiency of the term labeling process is greatly reduced

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Quick term marking method
  • Quick term marking method
  • Quick term marking method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0030] The present invention is mainly used in the manuscript preprocessing and analysis link in the field of translation. Its main function is to analyze the manuscript to be translated and find out all the terms in the manuscript that already exist in the term base, so that the translator can use it as a reference when translating ( see figure 2 ). In this process, how to efficiently retrieve all substrings in each paragraph of text in a massive term base and mark all known terms appearing in the text has become the key problem to be solved in the present invention.

[0031] Step 1. Use the prefix table to search for terms.

[0032] Step 101: Establish a prefix table.

[0033] term prefix

The minimum length M of prefixed terms

The maximum length N of prefixed terms

[0034] The structure of the prefix table is shown in the figure above. The first field is the prefix of the term, the second field records the minimum length of the term startin...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

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

technical field [0001] The invention relates to a manuscript preprocessing and analysis technology in the translation process, specifically, a method for quickly labeling known terms in a manuscript before translation. Background technique [0002] At present, the annotation of manuscript preprocessing and analysis tools in the field of translation mainly adopts the method of "maximum forward matching" or "maximum reverse matching", in order to obtain a term with the longest and most complete meaning as much as possible. The following is a brief introduction to the above two methods. [0003] "Maximum forward matching", that is, starting from a substring of the minimum length of the target term to search in the term base one by one, adding 1 to the length of the string each time it is retrieved, until the length of the string reaches a certain threshold, The last matched string is the target term. [0004] Contrary to "Maximum Forward Matching", "Maximum Reverse Matching" ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30G06F17/28
Inventor 江潮
Owner TRANSN IOL TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com