CN108664494A - Method, apparatus, electronic equipment and the storage medium of Data Matching - Google Patents
Method, apparatus, electronic equipment and the storage medium of Data Matching Download PDFInfo
- Publication number
- CN108664494A CN108664494A CN201710196456.3A CN201710196456A CN108664494A CN 108664494 A CN108664494 A CN 108664494A CN 201710196456 A CN201710196456 A CN 201710196456A CN 108664494 A CN108664494 A CN 108664494A
- Authority
- CN
- China
- Prior art keywords
- matching
- cutting
- string
- data
- initial data
- 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.)
- Pending
Links
Abstract
The invention discloses a kind of method, apparatus of Data Matching, electronic equipment and storage mediums.This method includes：The standard dictionary formed by scheduled normal data is stored in the form of prefix trees；Initial data is subjected to cutting, obtains matching string；It is made comparisons with the standard dictionary to calculate matching degree by the matching string；Wherein, cutting is carried out to the initial data by positive vector iteration cutting, wherein the forward direction vector iteration cutting refers to the initial data using carrying out cutting by the way of from maximum character string to the iterative searching layer by layer of minimum character string.This method can efficiently realize nonstandard numbers evidence and the matching between user's specification data.
Description
Technical field
The present invention relates to field of computer technology more particularly to a kind of method, apparatus of Data Matching, electronic equipment and deposit
Storage media.
Background technology
With the continuous development of internet industry, the development trend that travel industry is combined with internet industry is in recent years
It is especially prominent.In particular, such as hotel, Youth Hotel, people place are that the entity that traveller accommodates widely has utilized mutually
It networks and provides more and more information to traveller, such as the title in hotel, address, telephone number, lodging condition, facility, carry
The respective services etc. of confession.
However, in current current situation, it is each due to the data standard there is no standard in hotel industry
The supplier in hotel or the external API (Application Program Interface, Application Program Interface) of retail trader are
It is correspondingly required by exclusive customization according to it.This just necessarily results in each supplier or the data model of retail trader is likely to
It is different.So working as Internet company, the Internet company especially docked with many suppliers and retail trader docks
When, it is required for individually being developed, this is a general problem in entire internet hotel field.
Currently, the Large-Scale Interconnected net company usually standard base data model with their own.With supplier and distribution
When quotient is docked, Internet company is matched using the normal data model of their own with the data of each businessman.Existing
Matching algorithm in, usually phrase (data) to be matched is executed into matching treatment as a whole, is accurately searched with reaching
Purpose.
In realizing process of the present invention, inventor has found that at least there are the following problems in existing matching algorithm：At present simultaneously
There is no a kind of efficient method that the normal data of the initial data of businessman and Internet company is carried out matched task to realize.
Word to be matched is often difficult to obtain satisfactory hit results to execute matching treatment as a whole, therefore there is still a need for
A large amount of artificial matching, results in the need for a large amount of human cost and inefficiency.
Invention content
In view of this, the embodiment of the present invention provides a kind of method, apparatus for the Data Matching being particularly suitable for hotel, electronics
Equipment and storage medium can efficiently realize the matching between initial data and user's specification data.
To achieve the above object, according to an aspect of the invention, there is provided a kind of method of Data Matching.
A kind of method of Data Matching of the embodiment of the present invention includes：Storage is by scheduled criterion numeral in the form of prefix trees
According to the standard dictionary of formation；Initial data is subjected to cutting, obtains matching string, wherein is cut by positive vector iteration
Divide and cutting is carried out to the initial data, wherein the forward direction vector iteration cutting refers to using the initial data from most
The mode of big character string to the iterative searching layer by layer of minimum character string carries out cutting；Pass through the matching string and the mark
Quasi- dictionary makes comparisons to calculate matching degree.
Optionally, the positive vector iteration cutting includes：The original first to be retrieved in the standard dictionary
Maximum fractionation character string in beginning data carries out cutting to the initial data, then to be retrieved in the standard dictionary
Maximum fractionation character string in the matching string carries out cutting to matching string, until the matching string
It is split the matching string for minimum length.
Optionally, the matching degree is embodied by matching total score, and the matching total score is calculated with following formula：
Wherein, R is the weight of the occurrence as the matching string, and m is the matching score of each occurrence,
And the quantity that k is matching string.
Optionally, the weight can be pre-defined by user.
At least one of during optionally, the initial data can include following items：Chinese character, letter, number, symbol
Number, figure.
To achieve the above object, according to another aspect of the present invention, a kind of device executing Data Matching is provided.
A kind of device of execution Data Matching of the embodiment of the present invention includes：Standard dictionary generation module, for prefix
The form of tree stores the standard dictionary formed by scheduled normal data；Cutting module is obtained for initial data to be carried out cutting
To matching string, wherein carry out cutting to the initial data by positive vector iteration cutting, wherein the forward direction
Vector iteration cutting refers to the side using the iterative searching layer by layer from maximum character string to minimum character string to the initial data
Formula carries out cutting；Matching divides computing module, is calculated for being made comparisons with the standard dictionary by the matching string
Matching degree.
Optionally, the positive vector iteration cutting includes：The original first to be retrieved in the standard dictionary
Maximum fractionation character string in beginning data carries out cutting to the initial data, then to be retrieved in the standard dictionary
Maximum fractionation character string in the matching string carries out cutting to matching string, until the matching string
It is split the matching string for minimum length.
Optionally, divide in computing module in the matching, the matching degree is indicated by matching total score, and the matching is total
Divide and is calculated with following formula：
Wherein, R is the weight of the occurrence as the matching string, and m is the matching score of each occurrence, and
And the quantity that k is matching string.
To achieve the above object, in accordance with a further aspect of the present invention, a kind of electronic equipment is provided.
The present invention a kind of electronic equipment include：At least one processor；And at least one processor communication
The memory of connection；Wherein, the memory is stored with the instruction that can be executed by one processor, and described instruction is described
At least one processor executes, so that at least one processor is able to carry out the side of Data Matching provided by the present invention
Method.
To achieve the above object, in accordance with a further aspect of the present invention, a kind of computer readable storage medium is provided.
A kind of computer readable storage medium of the present invention, the computer-readable recording medium storage computer instruction,
The computer instruction is for making the method that the computer executes Data Matching provided by the present invention.
According to the technique and scheme of the present invention, one embodiment in foregoing invention has the following advantages that or advantageous effect：With
Based on the standard dictionary formed by scheduled normal data, the initial data is carried out by positive vector iteration cutting
Cutting obtains matching string, and relatively matching degree is calculated by the matching string and normal data, can be efficient
The matching between initial data and normal data is realized on ground, to reduce artificial treatment, and then is reduced human cost and is carried
High efficiency.
Further effect possessed by above-mentioned non-usual optional mode adds hereinafter in conjunction with specific implementation mode
With explanation.
Description of the drawings
Attached drawing does not constitute inappropriate limitation of the present invention for more fully understanding the present invention.Wherein：
Fig. 1 is the flow diagram of the method for Data Matching according to the ... of the embodiment of the present invention；
Fig. 2 is a kind of schematic diagram of the main modular of device executing Data Matching according to the ... of the embodiment of the present invention；
Fig. 3 is the hardware architecture diagram of a kind of electronic equipment according to the ... of the embodiment of the present invention.
Fig. 4 is the schematic diagram of data structure used by the embodiment of the present invention.
Specific implementation mode
It explains to the exemplary embodiment of the present invention below in conjunction with attached drawing, including the various of the embodiment of the present invention
Details should think them only exemplary to help understanding.Therefore, those of ordinary skill in the art should recognize
It arrives, various changes and modifications can be made to the embodiments described herein, without departing from scope and spirit of the present invention.Together
The description to known function and structure is omitted for clarity and conciseness in sample in following description.
Fig. 1 is the flow diagram of the method for Data Matching according to the ... of the embodiment of the present invention.
As shown in Figure 1, a kind of the main of the method for Data Matching of the embodiment of the present invention includes the following steps：
Step S1：The standard dictionary formed by scheduled normal data is stored in the form of prefix trees；
Step S2：Initial data is subjected to cutting, obtains word to be matched, wherein is cut using the realization of positive vector iteration
Point；
Step S3：Matching degree is calculated by the way that word to be matched is made comparisons with normal data.
It will be specifically explained each step below.
Step S1：
In step sl, scheduled normal data is handled to form corresponding standard dictionary, then by standard words
Allusion quotation is archived in internal storage structure.
When building dictionary, well known storage organization can be used, such as Tire Tree, this is a kind of tree simple in structure
Type structure.In the Tire Tree structures, in a manner of comparing one by one prefix character, it can reduce to the maximum extent meaningless
Character string comparison, to rapidly searching word.Therefore, which is otherwise known as prefix trees.Have in Fig. 4
Show to body the structure of Tire Tree.
For simplicity, Tire Tree structures are illustrated by taking English as an example in Fig. 4.In Fig. 4, root node
Not comprising character, each node other than root node includes a character.Node is specified from root node to some
The Connection operator passed through on path specifies the corresponding character string of node as this.Solid node indicates the solid node
Corresponding character string constitutes a complete word.Therefore, as can be seen that in the Tire Tree structures from the structure of Fig. 4
In, abc, abcd, abd, b, bcd, efg, hij may be constructed word, and ab, c, ef, hi can not then constitute complete word.More
Specifically, each node can include the array that a length is 26.
Alternatively, which can be applied equally to Chinese character.In the case of Chinese character, because
The number of Chinese character is far more than 26, so the structure can become quite to spread, and committed memory space, therefore with section
It is unpractical that point represents Chinese character.In light of this situation, the variant as Tire Tree, it is proposed that use ternary tree
(Ternary Tree) structure defines normal dictionary, it can be ensured that occupies smaller memory headroom.
Step S2：
In step s 2, cutting is carried out to initial data by positive vector iteration cutting, obtains data to be matched.
Here, it is that one kind being treated matched data and used from maximum word that term " positive vector iteration cutting ", which should be understood as,
The mode of symbol string to the iterative searching layer by layer of minimum character string carries out cutting.Maximum character string can include but is not limited to have bright
Multiple words of true meaning, i.e. phrase, minimum character string can include but is not limited to the word with clear meaning.It is " to be matched
Data " be understood not to only include matched initial data is treated to carry out the intermediate character string that first time cutting obtains, and
And should be understood to further include carrying out the obtained character string of cutting again in the intermediate character string that first time cutting obtains.Cutting
Number can be one or many.
In the following, in the case where it is Chinese to need to carry out matched initial data, step S2 is elaborated.Specifically, will
Initial data " Beijing Yi Zhuang International Hotel " is used as the example of initial data.In this example, scheduled standard dictionary is at least
Including following word or phrase (character string)：" Beijing Yi Zhuang ", " International Hotel ", " Beijing ", " Yi Zhuang ", " world ", " wine
Shop " etc..
Maximum fractionation phrase " Beijing Yi Zhuang " is retrieved first in the standard dictionary formed by step S1, is obtained by cutting
Phrase to be matched is " Beijing Yi Zhuang " and " International Hotel ".Then, one of them is waited for for foundation with standard dictionary again
Match phrase " Beijing Yi Zhuang " carry out cutting, such as cutting be word " Beijing " and " Yi Zhuang ", and so on, each cutting is obtained
To two or more phrases to be matched continuation carry out cutting in the same fashion, until phrase to be matched is split as word.Its
In, known common data matching process, such as maximum forward matching method may be used in each cutting.
Finally, by the iteration slit mode, the words/phrases to be matched obtained from " Beijing Yi Zhuang International Hotel " are
" Beijing Yi Zhuang/Beijing/Yi Zhuang/world/hotel/big/hotel ".It should be noted that in the present implementation, needing progress
The initial data matched include but be not limited to the title in hotel, hotel address etc..
In alternative embodiments, it needs to carry out matched initial data and can also be letter, number, figure and symbol, example
Such as phone.
Specifically, iteration dicing process can be realized by following procedure section：
boolean accept(Lexeme_lexeme){
/ * * check acceptable types of the new lexeme to current branch
*acceptType:REFUSED cannot receive
*acceptType:ACCEPTED receives
*acceptType:TONEXT is received by contiguous branch
*/
Int acceptType=checkAccept (_ lexeme)；
switch(acceptType){case REFUSED:
//REFUSE situation return false；
case ACCEPTED:If (acceptedBranchs==null)
// current branch does not have sub- branch, then is added under current branch
AcceptedBranchs=new ArrayList<TokenBranch>(2)；
acceptedBranchs.add(new TokenBranch(_lexeme))；
Else { boolean acceptedByChild=false；
// current branch possesses sub- branch, then is preferentially received by sub- branch
for(TokenBranch childBranch:acceptedBranchs)
AcceptedByChild=childBranch.accept (_ lexeme) | |
acceptedByChild；}
If // all sub- branch cannot be received, received by current branch
if(！acceptedByChild){
acceptedBranchs.add(new TokenBranch(_lexeme))；
}}
The maximum right margin of // setting branch
if(_lexeme.getEndPosition()>this.rightBorder){
This.rightBorder=_lexeme.getEndPosition ()；
}break；
case TONEXT:
// lexeme be put into current branch contiguous branch if (this.nextBranch==null)
// if there are no contiguous branch, establish a not overlapping branch
This.nextBranch=new TokenBranch (null)；}
this.nextBranch.accept(_lexeme)；
break；}
return true；}.
Step S3：
In step s3, matching degree is calculated by the way that word to be matched is made comparisons with standard dictionary.Matching degree can lead to
Overmatching score embodies.In the simplest way, matching score 0 indicates that matching string is mismatched with normal data,
And it matches score 1 and indicates 100% matching.When there are multiple words to be matched, the sum of the matching score to them can be passed through
It is averaged to obtain matching total score, the higher expression initial data of score and corresponding user's specification Data Matching degree are higher.
In one embodiment of the invention, the matching degree indicates that the matching total score is with such as by matching total score
Lower formula calculates：
Wherein, R is the weight for the occurrence being each made of several words to be matched, and the value of R can be by user according to need
Neatly to pre-define；M is the matching score of each occurrence；And the quantity that k is word to be matched.
The weight that can be pre-defined allows for user according to the application field for currently carrying out matched data, such as hotel
Data, air ticket data, to set optimal matching total score numerical procedure.
The method of Data Matching according to the ... of the embodiment of the present invention can be seen that through positive vector iteration cutting to the original
Beginning data carry out cutting, efficiently realize the matching between initial data and user's specification data, to reduce artificial treatment, into
And reduce human cost.
Fig. 2 is a kind of schematic diagram of the main modular of device executing Data Matching according to the ... of the embodiment of the present invention.
As shown in Fig. 2, a kind of device 20 of execution Data Matching of the embodiment of the present invention, including：Standard dictionary generates mould
Block 201, for storing the standard dictionary formed by scheduled normal data in the form of prefix trees；Cutting module 202, being used for will
Initial data carries out cutting, obtains matching string, wherein is carried out to the initial data by positive vector iteration cutting
Cutting, wherein first with the maximum fractionation character string in the initial data that is retrieved in the standard dictionary to described
Initial data carries out cutting, then with the maximum fractionation word in the matching string that is retrieved in the standard dictionary
Symbol string carries out cutting to matching string, until the matching string is split as the to be matched of scheduled minimum length
Character string；Matching divides computing module 203, is calculated for being made comparisons with the standard dictionary by the matching string
With degree.
In addition, dividing in computing module 203 in matching, the matching degree is indicated by matching total score, the matching total score
It is calculated with following formula：
Wherein, R is the weight of the occurrence as the matching string, and m is the matching score of each occurrence, and
And the quantity that k is matching string.
Execution data matching device according to the ... of the embodiment of the present invention can be seen that the mark to be formed by scheduled normal data
Based on quasi- dictionary, cutting is carried out to the initial data by positive vector iteration cutting, matching string is obtained, leads to
It crosses the matching string to be made comparisons with the standard dictionary to calculate matching degree, can efficiently realize initial data and use
Matching between the normal data of family to reduce artificial treatment, and then reduces human cost.
According to an embodiment of the invention, the present invention also provides a kind of electronic equipment and a kind of readable storage medium storing program for executing.
The electronic equipment of the embodiment of the present invention includes：At least one processor；And it is logical at least one processor
Believe the memory of connection；Wherein, the memory is stored with the instruction that can be executed by one processor, and described instruction is by institute
It states at least one processor to execute, so that the method that at least one processor executes Data Matching provided by the present invention.
The computer readable storage medium of the embodiment of the present invention, the computer-readable recording medium storage computer refer to
It enables, the computer instruction is for making the method that the computer executes Data Matching provided by the present invention.
Fig. 3 is the hardware architecture diagram of the electronic equipment according to the ... of the embodiment of the present invention for executing Data Matching.Such as Fig. 3 institutes
Show, which includes：One or more processors 31 and memory 32, in Fig. 3 by taking a processor 31 as an example.Its
In, memory 32 is computer readable storage medium provided by the present invention.
Executing the electronic equipment of Data Matching can also include：Input unit 33 and output device 34.
Processor 31, memory 32, input unit 33 can be connected with output device 34 by bus or other modes,
In Fig. 3 for being connected by bus.
Memory 32 is used as a kind of computer readable storage medium, can be used for storing software program, computer can perform journey
Sequence and module, if the corresponding program instruction/module of the method for the Data Matching in the embodiment of the present invention is (for example, shown in attached drawing 2
Standard dictionary generation module 201, cutting module 202, matching divide computing module 203).Processor 31 is stored in by operation
Software program, instruction in reservoir 32 and module, the various function application to execute server and data processing, i.e., in fact
The method of Data Matching in existing above method embodiment.
Memory 32 may include storing program area and storage data field, wherein storing program area can storage program area,
At least one required application program of function；Storage data field can be stored to be created according to using for the device of Data Matching
Data etc..Can also include memory in addition, memory 32 may include high-speed random access memory, for example, at least one
Disk memory, flush memory device or other solid-state memories.In some embodiments, it includes opposite that memory 32 is optional
In the remotely located memory of processor 31, these remote memories can pass through the device of network connection to Data Matching.On
The example for stating network includes but not limited to internet, intranet, LAN, mobile radio communication and combinations thereof.
Input unit 33 can receive the number or character information of input, and generates and set with the user of the device of Data Matching
It sets and the related key signals of function control inputs.Output device 34 may include that display screen etc. shows equipment.
One or more of modules are stored in the memory 32, when by one or more of processors 31
When execution, the method that executes the Data Matching in above-mentioned any means embodiment.
The said goods can perform the method that the embodiment of the present invention is provided, and has the corresponding function module of execution method and has
Beneficial effect.The not technical detail of detailed description in the present embodiment, reference can be made to the method that the embodiment of the present invention is provided.
Technical solution according to the ... of the embodiment of the present invention, based on the standard dictionary formed by scheduled normal data,
Cutting is carried out to the initial data by positive vector iteration cutting, matching string is obtained, passes through the word to be matched
Symbol string is made comparisons with standard dictionary to calculate matching degree, can efficiently realize between initial data and user's specification data
Match, to reduce artificial treatment, and then reduces human cost.
Above-mentioned specific implementation mode, does not constitute limiting the scope of the invention.Those skilled in the art should be bright
It is white, design requirement and other factors are depended on, various modifications, combination, sub-portfolio and replacement can occur.It is any
Modifications, equivalent substitutions and improvements made by within the spirit and principles in the present invention etc., should be included in the scope of the present invention
Within.
Claims (10)
1. a kind of method of Data Matching, which is characterized in that including：
The standard dictionary formed by scheduled normal data is stored in the form of prefix trees；
Initial data is subjected to cutting, obtains matching string, wherein by positive vector iteration cutting to the original number
According to progress cutting, wherein the forward direction vector iteration cutting refers to using the initial data from maximum character string to minimum
The mode of the iterative searching layer by layer of character string carries out cutting；
It is made comparisons with the standard dictionary to calculate matching degree by the matching string.
2. according to the method described in claim 1, it is characterized in that, the forward direction vector iteration cutting includes：First in institute
The maximum fractionation character string stated in the initial data retrieved in standard dictionary carries out cutting to the initial data, then
With the maximum fractionation character string in the matching string that is retrieved in the standard dictionary to matching string into
Row cutting, until the matching string is split the matching string for minimum length.
3. according to the method described in claim 1, it is characterized in that, the matching degree is indicated by matching total score, described
It is calculated with following formula with total score：
Wherein, R is the weight of the occurrence as the matching string, and m is the matching score of each occurrence, and k
For the quantity of matching string.
4. according to the method described in claim 3, it is characterized in that, the weight is pre-defined by user.
5. method according to claim 1 to 4, which is characterized in that the initial data includes following items
At least one of in：Chinese character, letter, number, symbol, figure.
6. a kind of device executing Data Matching, which is characterized in that including：
Standard dictionary generation module, for storing the standard dictionary formed by scheduled normal data in the form of prefix trees；
Cutting module obtains matching string for initial data to be carried out cutting, wherein is cut by positive vector iteration
Divide and cutting is carried out to the initial data, wherein the forward direction vector iteration cutting refers to using the initial data from most
The mode of big character string to the iterative searching layer by layer of minimum character string carries out cutting；
Matching divides computing module, and matching degree is calculated for making comparisons with the standard dictionary by the matching string.
7. device according to claim 6, which is characterized in that it is described forward direction vector iteration cutting include：First in institute
The maximum fractionation character string stated in the initial data retrieved in standard dictionary carries out cutting to the initial data, then
With the maximum fractionation character string in the matching string that is retrieved in the standard dictionary to matching string into
Row cutting, until the matching string is split the matching string for minimum length.
8. device according to claim 6, which is characterized in that divide in computing module in the matching, the matching degree is logical
Overmatching total score indicates that the matching total score calculates with following formula：
Wherein, R is the weight of the occurrence as the matching string, and m is the matching score of each occurrence, and k
For the quantity of matching string.
9. a kind of electronic equipment, which is characterized in that including：
At least one processor；And
The memory being connect at least one processor communication；Wherein,
The memory is stored with the instruction that can be executed by one processor, and described instruction is by least one processor
It executes, so that at least one processor is able to carry out the method described in any one of claim 1 to 5.
10. a kind of computer readable storage medium, which is characterized in that the computer-readable recording medium storage computer refers to
It enables, the method that the computer instruction is used to that computer perform claim to be made to require described in any one of 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710196456.3A CN108664494A (en) | 2017-03-29 | 2017-03-29 | Method, apparatus, electronic equipment and the storage medium of Data Matching |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710196456.3A CN108664494A (en) | 2017-03-29 | 2017-03-29 | Method, apparatus, electronic equipment and the storage medium of Data Matching |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108664494A true CN108664494A (en) | 2018-10-16 |
Family
ID=63786596
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710196456.3A Pending CN108664494A (en) | 2017-03-29 | 2017-03-29 | Method, apparatus, electronic equipment and the storage medium of Data Matching |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108664494A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111831869A (en) * | 2020-06-30 | 2020-10-27 | 深圳价值在线信息科技股份有限公司 | Method and device for checking duplicate of character string, terminal equipment and storage medium |
| CN111931026A (en) * | 2020-08-10 | 2020-11-13 | 湖南快乐阳光互动娱乐传媒有限公司 | Search optimization method and system based on part-of-speech expansion |
| CN112836624A (en) * | 2021-01-29 | 2021-05-25 | 北京大米科技有限公司 | Text processing method and device, storage medium and electronic equipment |
| CN115840800A (en) * | 2023-02-27 | 2023-03-24 | 江苏曼荼罗软件股份有限公司 | Patient information matching method, system, computer and readable storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101477566A (en) * | 2009-01-19 | 2009-07-08 | 腾讯科技（深圳）有限公司 | Method and apparatus used for putting candidate key words advertisement |
| CN103646110A (en) * | 2013-12-26 | 2014-03-19 | 中国人民银行征信中心 | Natural person basic identity information matching method |
| US20150269163A1 (en) * | 2014-03-21 | 2015-09-24 | Alibaba Group Holding Limited | Providing search recommendation |
-
2017
- 2017-03-29 CN CN201710196456.3A patent/CN108664494A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101477566A (en) * | 2009-01-19 | 2009-07-08 | 腾讯科技（深圳）有限公司 | Method and apparatus used for putting candidate key words advertisement |
| CN103646110A (en) * | 2013-12-26 | 2014-03-19 | 中国人民银行征信中心 | Natural person basic identity information matching method |
| US20150269163A1 (en) * | 2014-03-21 | 2015-09-24 | Alibaba Group Holding Limited | Providing search recommendation |
Non-Patent Citations (2)
| Title |
|---|
| ITEYE_11910: "IK的整个分词处理过程", 《HTTPS://BLOG.CSDN.NET/ITEYE_11910/ARTICLE/DETAILS/82514001?UTM_MEDIUM=DISTRIBUTE.PC_RELEVANT_BBS_DOWN.NONE-TASK-BLOG-BAIDUJS-1.NONECASE&DEPTH_1-UTM_SOURCE=DISTRIBUTE.PC_RELEVANT_BBS_DOWN.NONE-TASK-BLOG-BAIDUJS-1.NONECASE》 * |
| 千丈之松: ""深度解析中文分词器算法"", 《HTTPS://BLOG.CSDN.NET/HU948162999/ARTICLE/DETAILS/43608107》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111831869A (en) * | 2020-06-30 | 2020-10-27 | 深圳价值在线信息科技股份有限公司 | Method and device for checking duplicate of character string, terminal equipment and storage medium |
| CN111831869B (en) * | 2020-06-30 | 2023-11-03 | 深圳价值在线信息科技股份有限公司 | Character string duplicate checking method, device, terminal equipment and storage medium |
| CN111931026A (en) * | 2020-08-10 | 2020-11-13 | 湖南快乐阳光互动娱乐传媒有限公司 | Search optimization method and system based on part-of-speech expansion |
| CN112836624A (en) * | 2021-01-29 | 2021-05-25 | 北京大米科技有限公司 | Text processing method and device, storage medium and electronic equipment |
| CN115840800A (en) * | 2023-02-27 | 2023-03-24 | 江苏曼荼罗软件股份有限公司 | Patient information matching method, system, computer and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108664494A (en) | Method, apparatus, electronic equipment and the storage medium of Data Matching | |
| CN105678324B (en) | Method for building up, the apparatus and system of question and answer knowledge base based on similarity calculation | |
| CN109308357A (en) | It is a kind of for obtaining the method, apparatus and equipment of answer information | |
| CN108875064B (en) | OpenFlow multidimensional data matching search method based on FPGA | |
| CN109325041A (en) | Business data processing method, device, computer equipment and storage medium | |
| EP1352344A2 (en) | Efficient searching techniques | |
| KR20220115046A (en) | Method and appartuas for semantic retrieval, device and storage medium | |
| CN109215796A (en) | Searching method, device, computer equipment and storage medium | |
| CN111460170B (en) | Word recognition method, device, terminal equipment and storage medium | |
| CN112925900B (en) | Search information processing method, device, equipment and storage medium | |
| CN110059156A (en) | Coordinate retrieval method, apparatus, equipment and readable storage medium storing program for executing based on conjunctive word | |
| CN109933645A (en) | Information query method, device, computer equipment and storage medium | |
| CN110505322A (en) | A kind of IP address section lookup method and device | |
| WO2021000411A1 (en) | Neural network-based document classification method and apparatus, and device and storage medium | |
| CN109918661A (en) | Synonym acquisition methods and device | |
| CN115248890B (en) | User interest portrait generation method and device, electronic equipment and storage medium | |
| CN114238576A (en) | Data matching method and device, computer equipment and storage medium | |
| CN114461837A (en) | Image processing method and device and electronic equipment | |
| JP2001092841A (en) | Cluster analyzing and processing method and recording medium having cluster analyzing program recorded thereon | |
| CN106951548A (en) | The method and system of feature word search precision are lifted based on RM algorithms | |
| Backstrom et al. | C2FS: An algorithm for feature selection in cascade neural networks | |
| CN104794227B (en) | A kind of information matching method and device | |
| CN113377922B (en) | Method, device, electronic equipment and medium for matching information | |
| CN113569027B (en) | Document title processing method and device and electronic equipment | |
| CN113377921B (en) | Method, device, electronic equipment and medium for matching information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181016 |
|
| RJ01 | Rejection of invention patent application after publication |