CN107341177B - fuzzy search method and device for contact - Google Patents

fuzzy search method and device for contact Download PDF

Info

Publication number
CN107341177B
CN107341177B CN201710373200.5A CN201710373200A CN107341177B CN 107341177 B CN107341177 B CN 107341177B CN 201710373200 A CN201710373200 A CN 201710373200A CN 107341177 B CN107341177 B CN 107341177B
Authority
CN
China
Prior art keywords
module
character
letter
storage space
contact
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.)
Active
Application number
CN201710373200.5A
Other languages
Chinese (zh)
Other versions
CN107341177A (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.)
Fujian Netdragon Websoft Co Ltd
Original Assignee
Fujian Netdragon Websoft 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 Fujian Netdragon Websoft Co Ltd filed Critical Fujian Netdragon Websoft Co Ltd
Priority to CN201710373200.5A priority Critical patent/CN107341177B/en
Publication of CN107341177A publication Critical patent/CN107341177A/en
Application granted granted Critical
Publication of CN107341177B publication Critical patent/CN107341177B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2455Query execution
    • G06F16/24564Applying rules; Deductive queries
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2458Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
    • G06F16/2468Fuzzy queries

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Computational Linguistics (AREA)
  • Fuzzy Systems (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Automation & Control Theory (AREA)
  • Probability & Statistics with Applications (AREA)
  • Document Processing Apparatus (AREA)

Abstract

the invention discloses a fuzzy search method and a fuzzy search device for contacts. The method comprises the following steps: s1, presetting more than one storage space with more than 26 bits, wherein the storage spaces respectively represent letters a-z from low order to high order, and all default bits are marked as 0; s2, creating a character mapping relation, mapping characters into letters, and marking the corresponding positions of the letters mapped by the characters in a storage space as 1; s3, according to the steps S1-S2, creating a first digit mark for the character corresponding to each existing contact; s4, according to the steps S1-S2, creating a second bitflag for the character input by the user; and S5, respectively performing AND operation on the second place marker and each first place marker to obtain an operation result, wherein if the operation result is the same as the second place marker, the contact corresponding to the first place marker operated with the second place marker is the result of the fuzzy search of the user. By adopting the method and the device, the fuzzy search efficiency can be improved.

Description

Fuzzy search method and device for contact
Technical Field
The invention relates to the field of fuzzy search, in particular to a fuzzy search method and device for contacts.
background
at present, communication software, a mobile phone address book and the like generally have a fuzzy search function, so that a user can acquire information required by the user in as short a time as possible. In the existing fuzzy search method, after a user inputs a character to be queried in a search box, the database data is generally searched by methods such as character string matching, hierarchical structures and the like. The character string matching search method needs to match characters one by one, and the hierarchical structure search method cannot skip the alphabetical order for searching, possibly resulting in incomplete search results and needing to search again, so that the existing search method is low in search efficiency.
in order to solve the above technical problem, the patent document with application number 201210581534.9 discloses a fuzzy search method, which includes the following steps: constructing a suffix array for each contact in advance; sequencing each suffix array item in all constructed suffix arrays according to a preset rule; when receiving the key words, sequentially using the received characters as indexes of binary search according to the sequence of the received characters; if the index is the first received character, performing binary search in all sorted suffix array items, finding out a suffix array item with a first character as the index, and taking a suffix array where the found suffix array item is as a search result of the time; if the index is not the first received character, sequencing each suffix array item in the last search result according to a preset rule, then performing binary search in each suffix array item in the sequenced last search result to find a suffix array item with a first character as the index, and taking the suffix array where the found suffix array item is as the search result of the time; until the index is the last received character, taking a suffix array in the last search result as a suffix array matched with the keyword; and taking the contact corresponding to the suffix array obtained by searching as a searching result. By the technical means, when the contact is searched, all the contacts do not need to be traversed once aiming at each character of the keyword, and the searching efficiency is improved. However, the searching method essentially realizes the contact searching through a character string matching method, and the searching efficiency is still low.
Disclosure of Invention
the technical problem to be solved by the invention is as follows: how to improve the efficiency of fuzzy search.
in order to solve the technical problems, the invention adopts the technical scheme that:
the invention provides a fuzzy search method for contacts, which comprises the following steps:
s1, presetting more than one storage space with more than 26 bits, wherein the storage spaces respectively represent letters a-z from low order to high order, and all bits of the storage spaces are defaulted to be marked as 0;
s2, creating a character mapping relation, mapping characters into letters, and marking the corresponding positions of the letters mapped by the characters in the storage space as 1;
s3, according to the steps S1-S2, creating a first digit mark for the character corresponding to each existing contact;
s4, according to the steps S1-S2, creating a second bitflag for the character input by the user;
and 5, performing and operation on the second place marker and each first place marker respectively to obtain an operation result, wherein if the operation result is the same as the second place marker, the contact corresponding to the first place marker operated with the second place marker is the result of the fuzzy search of the user.
the invention also provides a fuzzy search device for the contact, which comprises:
the device comprises a presetting module, a storage module and a control module, wherein the presetting module is used for presetting more than one storage space with more than 26 bits, the storage spaces respectively represent letters a-z from low bits to high bits, and all bits of the storage spaces are defaulted to be marked as 0;
the first creation module is used for creating a character mapping relation, mapping characters into letters and marking the corresponding positions of the letters mapped by the characters in the storage space as 1;
The second establishing module is used for establishing a first bit mark for the character corresponding to each existing contact according to the preset module and the first establishing module;
the third establishing module is used for establishing a second place marker for the characters input by the user according to the preset module and the first establishing module;
and the operation module is used for respectively performing AND operation on the second place marker and each first place marker to obtain an operation result, and if the operation result is the same as the second place marker, the contact corresponding to the first place marker operated with the second place marker is a fuzzy search result of the user.
The invention has the beneficial effects that: according to the method, through presetting a storage space and establishing a character mapping relation, bit marks are established for the characters corresponding to each contact person and the characters input by a user, and the bit marks established for the characters input by the user and the bit marks established for the characters corresponding to the contact persons are subjected to AND operation, so that the result of fuzzy search of the user is obtained. Compared with the existing searching method, the method converts the character string matching mode into the operation for searching, utilizes the characteristic of high efficiency of CPU bit operation, shortens the searching time and improves the efficiency of fuzzy searching.
Drawings
FIG. 1 is a flow chart diagram of an embodiment of a contact fuzzy search method provided by the present invention;
FIG. 2 is a block diagram of a contact fuzzy search apparatus according to an embodiment of the present invention;
FIG. 3 is a block diagram of a first creating module provided in the present invention;
FIG. 4 is a diagram illustrating the corresponding bit labels of letters in a memory space;
Description of reference numerals:
1. presetting a module;
2. A first creation module; 21. an identification unit; 22. a conversion unit; 23. a first acquisition unit;
24. a second acquisition unit; 25. a marking unit; 26. a repeating unit;
3. a second creation module; 4. a receiving module; 5. a third creation module; 6. an operation module; 7. a statistical module; 8. a sorting module; 9. and a pushing module.
Detailed Description
In order to explain technical contents, achieved objects, and effects of the present invention in detail, the following description is made with reference to the accompanying drawings in combination with the embodiments.
the most key concept of the invention is as follows: by creating bit marks for the characters corresponding to each contact and the characters input by the user, and performing AND operation on the bit marks created for the characters input by the user and the bit marks created for the characters corresponding to the contacts, the search time is shortened and the fuzzy search efficiency is improved by utilizing the characteristic of high efficiency of CPU bit operation.
Referring to fig. 1 to 4 of the drawings,
As shown in fig. 1, the present invention provides a contact fuzzy search method, which comprises:
s1, presetting more than one storage space with more than 26 bits, wherein the storage spaces respectively represent letters a-z from low order to high order, and all bits of the storage spaces are defaulted to be marked as 0;
S2, creating a character mapping relation, mapping characters into letters, and marking the corresponding positions of the letters mapped by the characters in the storage space as 1;
s3, according to the steps S1-S2, creating a first digit mark for the character corresponding to each existing contact;
S4, according to the steps S1-S2, creating a second bitflag for the character input by the user;
And 5, performing and operation on the second place marker and each first place marker respectively to obtain an operation result, wherein if the operation result is the same as the second place marker, the contact corresponding to the first place marker operated with the second place marker is the result of the fuzzy search of the user.
According to the description, the bit marks are created for the characters corresponding to each contact and the characters input by the user, and the bit marks created for the characters input by the user and the bit marks created for the characters corresponding to the contacts are subjected to AND operation, so that the search time is shortened and the fuzzy search efficiency is improved by utilizing the characteristic of high efficiency of CPU bit operation.
further, mapping the characters to letters specifically includes:
Identifying the type of the character to obtain the character type;
and if the character type is a Chinese character, converting the Chinese character into a corresponding letter according to a preset Chinese character coding comparison table.
as can be seen from the above description, if the user inputs letters, the mapping of the characters input by the user to the letters can be avoided by recognizing the character type, which can reduce the search time.
further, marking a bit corresponding to the letter mapped by the character in the storage space as 1, specifically:
S21, acquiring each letter mapped by the character to obtain a letter set;
S22, sequentially acquiring a letter in the letter set;
s23, if the corresponding bit of the letter in the storage space is marked as 0, marking the corresponding bit of the letter in the storage space as 1;
S24, repeating the steps S22 to S23 until the corresponding bits of the letters in the letter set in the storage space are marked as 1.
As can be seen from the above description, by determining the corresponding bit marks of the letters in the storage space, multiple times of marking on the same letter is avoided.
further, the method also comprises the following steps:
Counting the communication times of the user and each contact person;
sequencing the contacts in the fuzzy search result of the user according to the communication times to obtain a recommendation ordered set;
and pushing the recommendation ordered set.
According to the description, the searched contacts are sequenced according to the communication times of the user and each contact, so that the searching accuracy of the user can be improved, and the searching efficiency is improved.
further, before the step of S4, the method further includes:
Receiving characters input by a user through a keyboard or a touch screen.
as can be seen from the above description, several simple characters input by the user through the keyboard or the touch screen are received, so that the user does not need to search the required contacts in the address list one by one.
As shown in fig. 2 and fig. 3, the present invention also provides a contact fuzzy search apparatus, comprising:
the system comprises a presetting module 1, a storage module and a control module, wherein the presetting module 1 is used for presetting more than one storage space with more than 26 bits, the storage spaces respectively represent letters a-z from low bits to high bits, and all bits of the storage spaces are defaulted to be marked as 0;
The first creating module 2 is configured to create a character mapping relationship, map a character into a letter, and mark a corresponding bit of the letter mapped by the character in the storage space as 1;
the second creating module 3 is used for creating a first place mark for the character corresponding to each existing contact according to the preset module and the first creating module;
a third creating module 5, configured to create a second place marker for the character input by the user according to the preset module and the first creating module;
and the operation module 6 is configured to perform and operation on the second place marker and each first place marker respectively to obtain an operation result, and if the operation result is the same as the second place marker, a contact corresponding to the first place marker which is operated with the second place marker is a result of fuzzy search for the user.
It can be known from the above description that the fuzzy search device for the contact provided by the present invention establishes a bit marker for the character corresponding to each contact and the character input by the user, and performs and operation on the bit marker established for the character input by the user and the bit marker established for the character corresponding to the contact, and utilizes the characteristic of high efficiency of CPU bit operation, thereby shortening the search time and improving the efficiency of fuzzy search.
Further, the first creating module 2 includes:
the identification unit 21 is used for identifying the type of the character to obtain the character type;
and the conversion unit 22 is used for converting the Chinese characters into corresponding letters according to a preset Chinese character coding comparison table.
As can be seen from the above description, the first creating module provided by the present invention can avoid re-mapping the alphabet input by the user to the alphabet by recognizing the character type, so as to reduce the search time.
Further, the first creating module 2 further includes:
The first obtaining unit 23 is configured to obtain each letter mapped by a character to obtain a letter set;
A second obtaining unit 24, configured to sequentially obtain a letter in the letter set;
a marking unit 25, configured to mark a corresponding bit of the letter in the storage space as 1;
a repeating unit 26, configured to repeatedly execute the second obtaining unit and the marking unit until corresponding bits of the letters in the letter set in the storage space are all marked as 1.
As can be seen from the above description, the first creating module provided in the present invention can also avoid marking the same letter multiple times by determining the corresponding bit mark of the letter in the storage space.
Further, still include:
the statistical module 7 is used for counting the communication times of the user and each contact;
the sorting module 8 is used for sorting the contacts in the fuzzy search result of the user according to the communication times to obtain a recommended ordered set;
And the pushing module 9 is used for pushing the recommendation ordered set.
according to the above description, the fuzzy search device for the contacts provided by the invention can also sequence the searched contacts according to the communication times of the user and each contact, so that the search accuracy of the user can be improved, and the search efficiency is improved.
further, still include:
And the receiving module 4 is used for receiving characters input by a user through a keyboard or a touch screen.
The contact fuzzy search device provided by the invention can receive a plurality of simple characters input by a user through a keyboard or a touch screen, quickly search out contacts meeting conditions, and enable the user not to search contacts needed by the user one by one in an address list.
The first embodiment of the invention is as follows:
The embodiment provides a contact fuzzy search method, which comprises the following steps:
S1, presetting more than one storage space with more than 26 bits, wherein the storage spaces respectively represent letters a-z from low order to high order, and all bits of the storage spaces are defaulted to be marked as 0;
S2, creating a character mapping relation, and mapping characters into letters;
wherein, mapping characters into letters specifically includes:
identifying the type of the character to obtain the character type;
and if the character type is a Chinese character, converting the Chinese character into a corresponding letter according to a preset Chinese character coding comparison table.
for example, mapping contact names in a piece of communication software to letters: chenming (cheming), Chenhonghe (chenhonghe), Zhongliang (zhongliangde).
Marking the corresponding bit of the letter mapped by the character in the storage space as 1 comprises the following steps:
S21, acquiring each letter mapped by the character to obtain a letter set;
s22, sequentially acquiring a letter in the letter set;
s23, if the corresponding bit of the letter in the storage space is marked as 0, marking the corresponding bit of the letter in the storage space as 1;
s24, repeating the steps S22 to S23 until the corresponding bits of the letters in the letter set in the storage space are marked as 1.
for example, the corresponding bit of each letter in the letter set "check" in the preset storage space is labeled as 1, as shown in fig. 4.
s3, according to the steps S1-S2, creating a first bitflag for the characters corresponding to each existing contact, and converting the first bitflags into corresponding integers;
For example, the first place stamp created for the legend translates to an integer of 12756, the first place stamp created for the Chenhong river translates to an integer of 24788, and the first place stamp created for the ChengDel translates to an integer of 33581529.
Table 1 is the contact name and its mapped letter and integer converted by the first digit label.
name (I) letters integer number of
Chen Ming chenming 12756
chenhong river chenhonghe 24788
zhongliangde zhongliangde 33581529
s4, according to the steps S1-S2, creating a second bitflag for the character input by the user, and converting the second bitflag into a corresponding integer;
For example, if the user enters "chen", the created second bitflag is converted to an integer 8340; or the user enters "zld," the corresponding integer is 33556488.
and 5, performing and operation on the second place marker converted integer and each first place marker converted integer respectively to obtain an operation result, wherein if the operation result is the same as the second place marker converted integer, the contact corresponding to the first place marker operated by the second place marker converted integer is the result of fuzzy search of the user.
for example, 8340(chen) and 12756 (Chenming), 24788 (Chenhong river) and 33581529 (clock good de) are respectively subjected to AND operation to obtain 8340, 8340 and 8400, and then the Chenming and the Chenhong river are the results of the fuzzy search of the user; or 33556488(zld) and 12756 (Chenming), 24788 (Chenhong river) and 33581529 (Chenglade) respectively to obtain 0, 0 and 33556488, and then the Chenglade is the result of the fuzzy search of the user.
the second embodiment of the invention is as follows:
the embodiment provides a fuzzy search device for contacts, which comprises a preset module 1, a first creating module 2, a second creating module 3, a receiving module 4, a third creating module 5, an operation module 6, a statistic module 7, a sorting module 8 and a pushing module 9;
wherein the first creating module 2 comprises: a recognition unit 21, a conversion unit 22, a first acquisition unit 23, a second acquisition unit 24, a marking unit 25, a repetition unit 26;
the presetting module 1 presets more than one storage space with more than 26 bits, wherein the storage spaces respectively represent letters a-z from low bits to high bits, and all bits of the storage spaces are defaulted to be marked as 0;
the first creating module 2 creates a character mapping relationship, maps characters into letters, and marks the corresponding bits of the letters mapped by the characters in the storage space as 1, specifically:
Identifying the type of the character by the identifying unit 21; if the character is a Chinese character, the conversion unit 22 converts the Chinese character into a corresponding letter according to a preset Chinese character coding comparison table; the first obtaining unit 23 obtains each letter mapped by the character to obtain a letter set; the second obtaining unit 24 sequentially obtains the letters in the letter set; the marking unit 25 marks the corresponding bit of the letter in the storage space as 1; the repeating unit 26 repeats the second obtaining unit and the marking unit, and marks all corresponding bits of the letters in the letter set in the storage space as 1;
the second creating module 3 creates a first place mark for the character corresponding to each existing contact according to the preset module and the first creating module;
The receiving module 4 receives characters input by a user through a keyboard or a touch screen; and the third creating module 5 creates a second bit marker for the character according to the preset module and the first creating module;
The operation module 6 performs and operation on the second place marker and each first place marker respectively to obtain an operation result, and if the operation result is the same as the second place marker, a contact corresponding to the first place marker operated with the second place marker is obtained;
The statistical module 7 is used for counting the communication times of the user and each contact; the contact persons searched according to the characters input by the user are sorted according to the communication times by the sorting module 8, and a recommendation ordered set is obtained; and pushing the recommendation ordered set through the pushing module 9.
In summary, according to the method and the device for fuzzy search of contacts provided by the present invention, by presetting a storage space and creating a character mapping relationship, bit labels are created for the characters corresponding to each contact and the characters input by the user, and the bit labels created for the characters input by the user and the bit labels created for the characters corresponding to the contacts are and-operated, so as to obtain the result of fuzzy search of the user. Compared with the existing searching method, the method converts the character string matching mode into the operation for searching, utilizes the characteristic of high efficiency of CPU bit operation, shortens the searching time and improves the efficiency of fuzzy searching. Meanwhile, the contact persons meeting the conditions are quickly searched by receiving a plurality of simple characters input by the user through a keyboard or a touch screen, the user does not need to search the contact persons needed by the user in the address list one by one, the searched contact persons are sequenced according to the communication times of the user and each contact person, the searching precision of the user is improved, and therefore the fuzzy searching efficiency can be further improved.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all equivalent changes made by using the contents of the present specification and the drawings, or applied directly or indirectly to the related technical fields, are included in the scope of the present invention.

Claims (10)

1. a contact fuzzy search method is characterized by comprising the following steps:
s1, presetting a storage space with more than 26 bits, wherein the storage space respectively represents letters a-z from low order to high order, and defaulting that all bits of the storage space are marked as 0;
s2, creating a character mapping relation, mapping characters into letters, and marking the corresponding positions of the letters mapped by the characters in the storage space as 1;
s3, according to the steps S1-S2, creating a first digit mark for the character corresponding to each existing contact;
S4, according to the steps S1-S2, creating a second bitflag for the character input by the user;
And 5, performing and operation on the second place marker and each first place marker respectively to obtain an operation result, wherein if the operation result is the same as the second place marker, the contact corresponding to the first place marker operated with the second place marker is the result of the fuzzy search of the user.
2. the contact fuzzy search method according to claim 1, wherein the characters are mapped to letters, specifically:
Identifying the type of the character to obtain the character type;
And if the character type is a Chinese character, converting the Chinese character into a corresponding letter according to a preset Chinese character coding comparison table.
3. The fuzzy search method for contacts according to claim 1, wherein a bit corresponding to a letter mapped by a character in the storage space is marked as 1, specifically:
s21, acquiring each letter mapped by the character to obtain a letter set;
S22, sequentially acquiring a letter in the letter set;
s23, if the corresponding bit of the letter in the storage space is marked as 0, marking the corresponding bit of the letter in the storage space as 1;
s24, repeating the steps S22 to S23 until the corresponding bits of the letters in the letter set in the storage space are marked as 1.
4. the fuzzy contact search method of claim 1, further comprising:
counting the communication times of the user and each contact person;
Sequencing the contacts in the fuzzy search result of the user according to the communication times to obtain a recommendation ordered set;
and pushing the recommendation ordered set.
5. the contact fuzzy search method of claim 1, further comprising, before the step of S4:
Receiving characters input by a user through a keyboard or a touch screen.
6. a contact fuzzy search apparatus, comprising:
the device comprises a presetting module, a storage module and a control module, wherein the presetting module is used for presetting a storage space with more than 26 bits, the storage space respectively represents letters a-z from low order to high order, and all bits of the storage space are defaulted to be marked as 0;
the first creation module is used for creating a character mapping relation, mapping characters into letters and marking the corresponding positions of the letters mapped by the characters in the storage space as 1;
The second establishing module is used for establishing a first bit mark for the character corresponding to each existing contact according to the preset module and the first establishing module;
The third establishing module is used for establishing a second place marker for the characters input by the user according to the preset module and the first establishing module;
and the operation module is used for respectively performing AND operation on the second place marker and each first place marker to obtain an operation result, and if the operation result is the same as the second place marker, the contact corresponding to the first place marker operated with the second place marker is a fuzzy search result of the user.
7. the apparatus according to claim 6, wherein the first creating module comprises:
the identification unit is used for identifying the type of the character to obtain the character type;
And the conversion unit is used for converting the Chinese characters into corresponding letters according to a preset Chinese character coding comparison table.
8. the apparatus according to claim 6, wherein the first creating module further comprises:
The first acquisition unit is used for acquiring each letter mapped by the character to obtain a letter set;
the second acquisition unit is used for sequentially acquiring a letter in the letter set;
the marking unit is used for marking the corresponding bit of the letter in the storage space as 1;
and the repeating unit is used for repeatedly executing the second acquiring unit and the marking unit until corresponding bits of the letters in the letter set in the storage space are marked as 1.
9. the fuzzy contact search device of claim 6, further comprising:
The statistical module is used for counting the communication times of the user and each contact person;
The sorting module is used for sorting the contacts in the fuzzy search result of the user according to the communication times to obtain a recommendation ordered set;
and the pushing module is used for pushing the recommendation ordered set.
10. The fuzzy contact search device of claim 6, further comprising:
and the receiving module is used for receiving characters input by a user through a keyboard or a touch screen.
CN201710373200.5A 2017-05-24 2017-05-24 fuzzy search method and device for contact Active CN107341177B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710373200.5A CN107341177B (en) 2017-05-24 2017-05-24 fuzzy search method and device for contact

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710373200.5A CN107341177B (en) 2017-05-24 2017-05-24 fuzzy search method and device for contact

Publications (2)

Publication Number Publication Date
CN107341177A CN107341177A (en) 2017-11-10
CN107341177B true CN107341177B (en) 2019-12-06

Family

ID=60221221

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710373200.5A Active CN107341177B (en) 2017-05-24 2017-05-24 fuzzy search method and device for contact

Country Status (1)

Country Link
CN (1) CN107341177B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1607501A (en) * 2003-09-02 2005-04-20 微软公司 Branding framework
CN101039478A (en) * 2007-04-17 2007-09-19 华为技术有限公司 Method and apparatus for searching information
CN101216748A (en) * 2007-12-29 2008-07-09 深圳华为通信技术有限公司 Input method and device
CN103294776A (en) * 2013-05-13 2013-09-11 浙江大学 Smartphone address book fuzzy search method
CN106326360A (en) * 2016-08-10 2017-01-11 武汉科技大学 Fuzzy multi-keyword retrieval method of encrypted data in cloud environment

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1607501A (en) * 2003-09-02 2005-04-20 微软公司 Branding framework
CN101039478A (en) * 2007-04-17 2007-09-19 华为技术有限公司 Method and apparatus for searching information
CN101216748A (en) * 2007-12-29 2008-07-09 深圳华为通信技术有限公司 Input method and device
CN103294776A (en) * 2013-05-13 2013-09-11 浙江大学 Smartphone address book fuzzy search method
CN106326360A (en) * 2016-08-10 2017-01-11 武汉科技大学 Fuzzy multi-keyword retrieval method of encrypted data in cloud environment

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
基于Android系统的联系人最大匹配检索算法设计与实现;王超;《自动化与信息工程》;20131215;第10-14页 *
基于汉语拼音的模糊查询及其在图书馆管理系统中的应用;靳小倩 等;《计算机应用与软件》;20110515;第42-44页 *

Also Published As

Publication number Publication date
CN107341177A (en) 2017-11-10

Similar Documents

Publication Publication Date Title
CN109885692B (en) Knowledge data storage method, apparatus, computer device and storage medium
CN113569833A (en) Text document-based character recognition method, device, equipment and storage medium
CN111581229A (en) SQL statement generation method and device, computer equipment and storage medium
CN111801665B (en) Hierarchical Locality Sensitive Hash (LSH) partition index for big data applications
CN112380238B (en) Database data query method and device, electronic equipment and storage medium
CN102063482A (en) High-efficiency contact searching method of handheld device
CN104579360A (en) Method and equipment for data processing
CN106251164A (en) Method and system are recommended at a kind of scenic spot
CN111782595A (en) Mass file management method and device, computer equipment and readable storage medium
CN111553150A (en) Method, system, device and storage medium for analyzing and configuring automatic API (application program interface) document
US20210026893A1 (en) System and method for improving geocoding performance
CN113656547A (en) Text matching method, device, equipment and storage medium
CN104598573A (en) Method for extracting life circle of user and system thereof
CN110263123B (en) Method and device for predicting organization name abbreviation and computer equipment
CN101465905B (en) System and method for frisking mail address
CN112632264A (en) Intelligent question and answer method and device, electronic equipment and storage medium
CN109344276B (en) Image fingerprint generation method, image similarity comparison method and storage medium
CN107341177B (en) fuzzy search method and device for contact
CN105589862A (en) License plate data index structure building method, retrieval method and device
CN111178349A (en) Image identification method, device, equipment and storage medium
Skylaki et al. Legal entity extraction using a pointer generator network
WO2012152039A1 (en) Method and device for determining candidate character in handwriting input
Mishra et al. Fast pattern matching in compressed text using wavelet tree
CN102981607A (en) Computer-implemented method of arranging text items in a predefined order
CN113868389B (en) Data query method and device based on natural language text and computer equipment

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
GR01 Patent grant
GR01 Patent grant