CN103294776B - Smartphone address book fuzzy search method - Google Patents
Smartphone address book fuzzy search method Download PDFInfo
- Publication number
- CN103294776B CN103294776B CN201310173227.1A CN201310173227A CN103294776B CN 103294776 B CN103294776 B CN 103294776B CN 201310173227 A CN201310173227 A CN 201310173227A CN 103294776 B CN103294776 B CN 103294776B
- Authority
- CN
- China
- Prior art keywords
- matching
- match
- key
- phonetic
- keyword
- 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
Links
Abstract
The invention discloses a smartphone address book fuzzy search method including preprocessing data of contacts recorded in a smartphone address book, acquiring spelling of names of the contacts and corresponding digital sequences of a thumb keyboard according to a spelling code table, writing the key information including the spellings, the digital sequences, phone numbers and the like into a memory while backing up the key information to a designed buffer, respectively matching different fields of the contacts in the memory on the basis of three classifications by judging whether including Chinese characters, letters or numbers according to the given search keywords, and finally realizing fuzzy matching of the keywords and the spellings of the names by a modified character string sequence matching algorithm. By the smartphone address book fuzzy search method, the address book can be searched globally according to optional keywords, the digital search of the thumb keyboard is supported, names, full spellings, shorthand spellings, part spellings, phone numbers, mailboxes of the contacts can be in fuzzy search, the search results can be output in a weighted ranking manner according to specific matching reasons, and accordingly, the smartphone address book fuzzy search method is a convenient and efficient diversified operating method for users.
Description
Technical field
The present invention relates to the technical field of information processing of intelligent mobile phone terminal, particularly address book contact intelligent search.
Background technology
With the development of Intelligent mobile equipment system, people to the demand of smart mobile phone also more and more higher, including more beautifying
Interface, more succinctly efficiently operate, more multi-functional application software etc..Cell phone address book as the most basic application of mobile phone,
Play the processes such as huge effect, telephonic communication, transmitting-receiving note, transmission mail in daily life to be required for calling connection
It is people's telephone directory, and the address book function that at present mobile phone operating system is carried is weaker, especially in terms of contact person's search
Consumer's Experience it is seriously delayed, locating contact people is much inconvenient when causing user to send short messages, make a phone call.
Database full-text search retrieval is that big data text is indexed, and the word to be searched is carried out in the index set up
Which text data search, position including the word to be searched for；Whole work of full-text search are exactly to set up index and in index
Middle search positioning, all of work is carried out all around the two；The method of participle is substantially binary participle method, maximum
Matching method and statistical method, the data structure of index is substantially using the structure of inverted index.Text searching method is mainly applied
In large data text, it does not simultaneously apply to the less scene of this simple structure of address list, data volume.Additionally, it also need to compared with
Big memory space, as the renewal Dynamic Maintenance of address list is indexed, overall cost is too big, uses underaction.
Traditional address list search is used carries out simple characters to being input into key wordses and name of contact person and number
String matching, does not consider the special search such as spelling, simplicity and the part phonetic of name.Additionally, the subsequence of character string be from
Initial sequence by remove some elements but do not destroy remaining element relative position and the new sequence that formed, it is description two
The working standard of string approximate matching, in formal mode for, give sequence X=<x1,x2,x3,…,xm>,
Another sequence Z=<z1,z2,z3,…,zk>It is the subsequence of X, if there is a strictly increasing following table sequence of X<i1,
i2,…,ik>So that to all of j=1,2 ..., k.Traditional subsequence matching algorithm do not account for phonetic initial consonant and
Simple or compound vowel of a Chinese syllable, does not enter the matching of Mobile state participle, it is therefore desirable to carry out certain transformation to phonetic.
The property easy to use of thumb keyboard attracts a large amount of smart phone users, and the intelligence inquiry for providing thumb keyboard is
The requisite demand of user, therefore how to give people to provide more convenient, more efficient address list search operation method and user
Experience is problem demanding prompt solution.
The content of the invention
The present invention is directed to the problems referred to above, there is provided a kind of method that intelligent mobile phone address list is searched for generally, it is therefore an objective to convenient, height
The address list search operation method of effect, will support to name of contact person (spelling, simplicity, part phonetic, thumb keyboard numeral sequence
Row), phone number, the fuzzy matching of the determinant attribute such as mailbox and positioning, provide the user with faster, more preferable Consumer's Experience.
To achieve these goals, the present invention is employed the following technical solutions：
A kind of method that intelligent mobile phone address list is searched for generally, comprises the following steps：
1) native contact book contact data is read by open interface, rejects redundant data, only leave and take key message, closed
Key information includes name of contact person, phone number and mailbox；
2) All Contacts' information is pre-processed by information pre-processor, for the Chinese in name, by looking into
Encoding of chinese characters table extracts phonetic, and polyphone then corresponds to a plurality of record, while phonetic is transcoded into into the corresponding digital sequence of thumb keyboard
Row, by above-mentioned all of record write internal memory and the buffer for designing；
3) to the search key key being input into, first whether query caching device has corresponding record, directly fixed if hit
Position, otherwise global search address list, are three types by keyword key point：A) Chinese character is contained；B) Chinese character is not contained,
Containing English alphabet and numeral；C) pure digi-tal is only included；
4) for given keyword key carries out matching search by searching for adaptation, if keyword belongs to b classifications,
Matching object is name of contact person phonetic；If belonging to c classifications, matching object is thumb keyboard Serial No.；Search adaptation
Concrete matched rule：Name phonetic is converted to into a phonetic array, each letter of keyword is traveled through, by letter and spelling
Sound word is matched successively, if current letter is matched, continues to match key alphabetical or next words next with current word
First letter, if all of keyword letter has corresponding matching, the match is successful, and otherwise it fails to match；
5) by step 3), 4) all contact persons matched with keyword key are obtained, by weighting sorting unit according to matching
Priority is weighted and sorts and export.
Further, the step 3) in, for a matching objects are name of contact person；For b matching objects are contact person's surname
Name phonetic and mailbox；For c matching objects are contact phone number thumb keyboard Serial No. corresponding with name；For b, c
Step 4 should be adopted) in phonetic fuzzy matching algorithm fuzzy matching is carried out to Pinyin coding and thumb keyboard Serial No., search for
When, inquire about in both the buffers first, if hitting or there is current keyword prefix, binary search is carried out in former result.
Further, the step 4) in, improved character string subsequence matching algorithm is employed, specific algorithm thought is retouched
State for：To given keyword key and name phonetic pinyin, first pinyin is separated into into array pinyin [N] with space character,
It is the phonetic array index for starting to match to define s, and k is the key inferiors for being currently needed for matching, and i is the phonetic of current matching
Word subscript, j is the inferior of current word；
A. s=0, k=0, i=s, j=0 are initialized, i.e., from the of keyword first letter and phonetic first word
One letter starts matching；
B. k==key.length is judged, if true, the match is successful, algorithm terminates；If false, turn c；
C. key [k]==pinyin [i] [j] is judged, if true turns d, if false turns f；
D.k++, j++, that is, attempt matching keyword next alphabetical next with current pinyin word alphabetical；
E. j is judged<Whether pinyin [i] .length, i.e., judge in advance current word all matchings, if true
Turn b to continue to match the next one, false turns g；
F. judge whether i-th phonetic has matching, if true turns g, false then s++, k=0, i=s, j=0 simultaneously turn b,
Start to match again from s-th pinyin word；
G.i++, j=0, that is, attempt matching keyword with next word first letter；
H. i is judged<Pinyin.length, turns b if true, and then it fails to match for false, and algorithm terminates；
Described according to algorithm above, can accurately judge whether key and pinyin [N] match, in algorithmic procedure, use one
Individual match [N] array recording keys match details with each phonetic, accurate according to match arrays after algorithm terminates
True description algorithmic match reason, for thumb keyboard Serial No., the simply ephemeral data used in algorithmic procedure, Yong Huye
Should be according to match arrays Query to specifically to the fuzzy matching of pinyin.
Further, the step 5) in, the matching priority can be with self-defined.
Further, the step 5) in, matching priority is：Match completely>Part matches；Spelling>Simplicity>Spell part
Sound；Name matches>Numbers match>Mailbox is matched.
Further, to the keyword key Search Results record for having searched, should be stored in buffer, next time, search was new
During keyword, query caching device is answered first, if keyword hits or there is key prefix, directly in the result note of caching
Binary search is carried out on record.
The present invention compared with prior art, has the advantages that：
The practical simple, simple operation of method provided by the present invention, search it is efficient, it support Chinese character, telephone number,
Mailbox is searching for contact person；Support searches for contact person generally by initials, spelling, part phonetic.
Further, support that the reversed phonetic of looking into of thumb keyboard input digital direct searches for contact person generally.
Further, can be given specifically to searching for contact person's result by improved character string subsequence matching algorithm
Matching reason.
Further, support that the reversed phonetic of looking into of thumb keyboard input digital direct searches for contact person generally.
Further, Search Results are carried out with record buffer memory, binary search efficiency is higher.
Description of the drawings
The structural representation that Fig. 1 is searched for generally for address list.
Fig. 2 is the schematic flow sheet for searching for address book contact generally by keyword.
Fig. 3 is improved character string subsequence matching algorithm flow schematic diagram.
Specific embodiment
Invention is described in detail with reference to embodiment and accompanying drawing.
What the present invention was given is a kind of method that intelligent mobile phone address list searches for contact person generally, is devised as shown in Figure 1
Searching structure schematic diagram, specifically include：
Information pre-processor：Obtain and to contact person's information pre-processing, filter redundant data, Pinyin coding is carried out to name
Deng.
Buffer：Pretreated associated person information is cached, while caching to keyword-Search Results.
Search adaptation：To giving search key, according to all key messages of its categorical match contact person, it have invoked
The subsequence matching algorithm transformed.
Weighting sorting unit：To Search Results according to self-defining priority rule, global weighting sequence output is carried out.
Keyword as shown in Figure 2 searches for the schematic flow sheet of address book contact generally and can be seen that a reality of the invention
Applying the searching method in example mainly includes below scheme：
1) interface provided by mobile phone operating system, reads native contact book contact data, rejects redundant data, only
Leave and take the key messages such as name of contact person, phone number, mailbox.
2) personal information of all address book contacts is pre-processed, especially, to name of contact person by looking into the Chinese
Word Pinyin coding table extracts phonetic, and space-separated is used between each phonetic transcriptions of Chinese characters, if there is polyphone in name, is transcoded into many
Bar is recorded, while pinyin translations are maintained in into the corresponding Serial No. of thumb keyboard to the above-mentioned associated person information for processing
In internal memory, while backup in the buffer for having designed, search next time can direct record in query caching device.
Table 1 is the corresponding thumb keyboard numeral transcoding table of phonetic alphabet.
3)
| Phonetic alphabet | Thumb keyboard numeral |
| A, b, c | 2 |
| D, e, f | 3 |
| G, h, i | 4 |
| J, k, l | 5 |
| M, n, o | 6 |
| P, q, r, s | 7 |
| T, u, v | 8 |
| X, y, z | 9 |
4) when searching for address book contact, search key is input into, keyword is divided into into three kinds of classifications and is considered：A) in containing
Chinese character；B) Chinese character is not contained, comprising English alphabet；C) pure digi-tal is only included.For a), keyword includes Chinese character,
And only having in associated person information in the original name field of unprocessed mistake containing Chinese, therefore only by keyword and need to may join
It is people's name string matching；For b), keyword includes English alphabet, the field that may meet should be name of contact person
Phonetic or mailbox, for phonetic situation, it is considered to for the spelling of name of contact person, simplicity, one kind of part phonetic, can adopt
The matching algorithm of keyword and name spelling in step 4 is processed, if mailbox, then only needs simple string matching i.e.
Can；For c), keyword only includes pure digi-tal, is considered as two kinds of situations of phone number and thumb keyboard Serial No., the former is only
Need to carry out substring to keyword and contact number to match, the latter is then using the keyword and thumb keyboard number of step 4
The matching algorithm of word sequence.
5) to given keyword key and name phonetic pinyin (pure digi-tal and thumb keyboard Serial No. matching situation
It is similar), first name phonetic is separated into into array pinyin [N] with space character, match key and pinyin [N]. specifically transformed
Phonetic matching algorithm, i.e., improved character string subsequence matching algorithm flow is as shown in figure 3, specific as follows：S is defined to start
The phonetic array index of matching, k is the key inferiors for being currently needed for matching, and i is the pinyin word subscript of current matching, and j is
The inferior of current word.
A. s=0, k=0, i=s, j=0 are initialized, i.e., from the of first keyword letter and phonetic first word
One letter starts matching.
B. k==key.length is judged, if true, the match is successful, algorithm terminates；If false, turn c.
C. key [k]==pinyin [i] [j] is judged, if true turns d, if false turns f.
D.k++, j++, that is, attempt matching keyword next alphabetical next with current pinyin word alphabetical.
E. j is judged<Whether pinyin [i] .length, i.e., judge in advance current word all matchings, if true
Turn 2 to continue to match the next one, false turns g.
F. judge whether i-th phonetic has matching, if true turns g, false then s++, k=0, i=s, j=0 simultaneously turn b,
Start to match again from s-th pinyin word.
G.i++, j=0, that is, attempt matching keyword with next word first letter.
H. i is judged<Pinyin.length, turns b if true, and then it fails to match for false, and algorithm terminates.
Described according to algorithm above, can accurately judge whether key and pinyin [N] match, in algorithmic procedure, we
Details can be matched with match [N] array recording key and each phonetic, after algorithm terminates, can be with root
According to match accurate description algorithmic match reasons, further for thumb keyboard Serial No., it is used in algorithmic procedure
Ephemeral data, for user also should be according to match arrays Query to specifically to the fuzzy matching of pinyin.
6) by step 3), 4) all contact persons matched with keyword key have been drawn, according to the reason for matching
(match) result is ranked up, priority can be self-defined as needed, in the present invention preferably embodiment, priority is fixed
Justice is as follows：Match completely>Part matches；Spelling>Simplicity>Part phonetic；Name matches>Numbers match>Mailbox.
In order to improve search efficiency, we are stored in the record of search key key Search Results in buffer, so under
During the new keyword of secondary search, first can inquire about in both the buffers, when such as keyword hits or there is prefix key, can be
Binary search is carried out on the result record of caching, this will greatly improve search efficiency.
Although the present invention is disclosed as above with preferred embodiment, it is not for limiting the present invention, any this area
Technical staff without departing from the spirit and scope of the present invention, may be by the methods and techniques content of the disclosure above to this
Bright technical scheme makes possible variation and modification, therefore, every content without departing from technical solution of the present invention, according to the present invention
Technical spirit to any simple modification made for any of the above embodiments, equivalent variations and modification, belong to technical solution of the present invention
Protection domain.
Claims (6)
1. a kind of method that intelligent mobile phone address list is searched for generally, it is characterised in that comprise the following steps：
1) native contact book contact data is read by open interface, rejects redundant data, only leave and take key message, key letter
Breath includes name of contact person, phone number and mailbox；
2) All Contacts' information is pre-processed by information pre-processor, for the Chinese in name, by looking into Chinese character
Coding schedule extracts phonetic, and polyphone then corresponds to a plurality of record, while phonetic is transcoded into into the corresponding Serial No. of thumb keyboard, will
In above-mentioned all of record write internal memory and the buffer that designs；
3) to the search key key being input into, first whether query caching device has corresponding record, directly positions if hit,
Otherwise global search address list, is three types by keyword key point：A) Chinese character is contained；B) Chinese character is not contained, is contained
English alphabet and numeral；C) pure digi-tal is only included；
4) for given keyword key carries out matching search by searching for adaptation, if keyword belongs to b classifications, match
Object is name of contact person phonetic；If belonging to c classifications, matching object is thumb keyboard Serial No.；The tool of search adaptation
Body matched rule：Name phonetic is converted to into a phonetic array, each letter of keyword is traveled through, by letter and phonetic list
Word is matched successively, if current letter matching, continues to match the first of key and the next letter of current word or next word
Individual letter, if all of keyword letter has corresponding matching, the match is successful, and otherwise it fails to match；
5) by step 3), 4) obtain all contact persons matched with keyword key, it is preferential according to matching by weighting sorting unit
Level is weighted and sorts and export.
2. the method that according to claim 1 address list is searched for generally, it is characterised in that the step 3) in, for a matchings
Object is name of contact person；For b matching objects are name of contact person phonetic and mailbox；For c matching objects are contact person's electricity
Words number thumb keyboard Serial No. corresponding with name；For b, c should adopt step 4) in fuzzy matching algorithm to phonetic compile
Code and thumb keyboard Serial No. carry out fuzzy matching, during search, inquire about in both the buffers first, if hit or presence are currently closed
Key word prefix, then carry out binary search in former result.
3. the method that according to claim 1 address list is searched for generally, it is characterised in that the step 4) in, employ and change
Character string subsequence matching algorithm after making, specific algorithm thought is described as：To given keyword key and name phonetic
Pinyin, is first separated into array pinyin [N] by pinyin with space character, and it is the phonetic array index for starting to match to define s, k
For the key inferiors for being currently needed for matching, i is the pinyin word subscript of current matching, and j is the inferior of current word；
A. s=0, k=0, i=s, j=0 are initialized, i.e., from first of keyword first letter and phonetic first word
Letter starts matching；
B. k==key.length is judged, if true, the match is successful, algorithm terminates；If false, turn c；
C. key [k]==pinyin [i] [j] is judged, if true turns d, if false turns f；
D.k++, j++, that is, attempt matching keyword next alphabetical next with current pinyin word alphabetical；
E. j is judged<Pinyin [i] .length, i.e., judge in advance current word whether all matchings, if true turn b after
Continuous matching is next, and false turns g；
F. judge whether i-th phonetic has matching, if true turns g, false then s++, k=0, i=s, j=0 simultaneously turn b, from
S pinyin word starts to match again；
G.i++, j=0, that is, attempt matching keyword with next word first letter；
H. i is judged<Pinyin.length, turns b if true, and then it fails to match for false, and algorithm terminates；
Described according to algorithm above, can accurately judge whether key and pinyin [N] match, in algorithmic procedure, with one
Match [N] array recording keys match details with each phonetic, accurate according to match arrays after algorithm terminates
Description algorithmic match reason, for thumb keyboard Serial No., the simply ephemeral data used in algorithmic procedure, user also should
According to match arrays Query to specifically to the fuzzy matching of pinyin.
4. the method that according to claim 1 address list is searched for generally, it is characterised in that the step 5) in, the matching
Priority can be with self-defined.
5. the method that address list according to claim 4 is searched for generally, it is characterised in that the step 5) in, match excellent
First level is：Match completely>Part matches；Spelling>Simplicity>Part phonetic；Name matches>Numbers match>Mailbox is matched.
6. the method that the address list according to claim 1-5 any one is searched for generally, it is characterised in that to searching
Keyword key Search Results record, should be stored in buffer, during the new keyword of search next time, query caching device is answered first,
If keyword hits or there is key prefix, directly binary search is carried out on the result record of caching.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310173227.1A CN103294776B (en) | 2013-05-13 | 2013-05-13 | Smartphone address book fuzzy search method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310173227.1A CN103294776B (en) | 2013-05-13 | 2013-05-13 | Smartphone address book fuzzy search method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103294776A CN103294776A (en) | 2013-09-11 |
| CN103294776B true CN103294776B (en) | 2017-04-12 |
Family
ID=49095638
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310173227.1A Active CN103294776B (en) | 2013-05-13 | 2013-05-13 | Smartphone address book fuzzy search method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103294776B (en) |
Families Citing this family (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103617204B (en) * | 2013-11-15 | 2017-01-25 | 福建星网锐捷通讯股份有限公司 | Contact fast searching method based on android system |
| CN104077418A (en) * | 2014-07-18 | 2014-10-01 | 广州市久邦数码科技有限公司 | Mobile terminal application program searching method and system |
| CN105718487A (en) * | 2014-12-04 | 2016-06-29 | 东莞宇龙通信科技有限公司 | Special contact person searching method and searching system |
| CN104699775A (en) * | 2015-03-10 | 2015-06-10 | 广州市久邦数码科技有限公司 | Contact person dialing searching method and system thereof for mobile terminal |
| CN104994208B (en) * | 2015-07-08 | 2018-04-06 | 苏州思必驰信息科技有限公司 | Contact person information of mobile terminal extracting method and system |
| CN105915685B (en) * | 2016-06-02 | 2019-01-18 | 重庆神指奇动网络有限公司 | A kind of smart phone Dialing Method and its system |
| CN106446062A (en) * | 2016-09-05 | 2017-02-22 | 惠州市德赛西威汽车电子股份有限公司 | Retrieval system and method for continuous characters and fuzzy characters |
| CN106782517A (en) * | 2016-12-15 | 2017-05-31 | 咪咕数字传媒有限公司 | A kind of speech audio keyword filter method and device |
| CN108572998A (en) * | 2017-03-14 | 2018-09-25 | 北京橙鑫数据科技有限公司 | A kind of data search method and device for electronic card data |
| CN107341177B (en) * | 2017-05-24 | 2019-12-06 | 福建网龙计算机网络信息技术有限公司 | fuzzy search method and device for contact |
| CN109116997A (en) * | 2017-06-23 | 2019-01-01 | 北京国双科技有限公司 | A kind of searching method and device based on phonetic |
| CN107679122B (en) * | 2017-09-20 | 2021-04-30 | 福建网龙计算机网络信息技术有限公司 | Fuzzy search method and terminal |
| CN110019649A (en) * | 2017-12-25 | 2019-07-16 | 北京新媒传信科技有限公司 | A kind of method and device established, search for index tree |
| CN111314540B (en) * | 2018-11-26 | 2021-07-27 | 卓望数码技术（深圳）有限公司 | Address book searching method, device, equipment and readable storage medium |
| CN111382322B (en) * | 2018-12-27 | 2023-06-13 | 北京猎户星空科技有限公司 | Method and device for determining similarity of character strings |
| CN110475028A (en) * | 2019-08-26 | 2019-11-19 | 广州讯鸿网络技术有限公司 | A kind of T9 searching method, electronic equipment and the storage medium of millions contact person |
| CN110781209B (en) * | 2019-09-29 | 2022-04-22 | 苏州浪潮智能科技有限公司 | Method and device for quickly querying data |
| CN112153206B (en) * | 2020-09-23 | 2022-08-09 | 阿波罗智联(北京)科技有限公司 | Contact person matching method and device, electronic equipment and storage medium |
| CN112163007B (en) * | 2020-09-28 | 2023-11-17 | 惠州市德赛西威智能交通技术研究院有限公司 | Method and system for quickly matching and searching contacts |
| CN112527819A (en) * | 2020-12-08 | 2021-03-19 | 北京百度网讯科技有限公司 | Address book information retrieval method and device, electronic equipment and storage medium |
| CN112764851A (en) * | 2021-01-14 | 2021-05-07 | 青岛海信传媒网络技术有限公司 | Display method and display equipment for legal statement content |
| CN113094470B (en) * | 2021-04-08 | 2022-05-24 | 蔡堃 | Text searching method and system |
| CN113641731B (en) * | 2021-08-17 | 2023-05-02 | 成都知道创宇信息技术有限公司 | Fuzzy search optimization method, device, electronic equipment and readable storage medium |
| CN116010562B (en) * | 2023-03-28 | 2023-07-07 | 之江实验室 | Name matching method, device, equipment and medium based on multiple data sources |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101426053A (en) * | 2008-10-24 | 2009-05-06 | 深圳市金立通信设备有限公司 | System and method for fast searching phone book and call record when standby |
| US7865842B2 (en) * | 2005-07-14 | 2011-01-04 | International Business Machines Corporation | Instant messaging real-time buddy list lookup |
| CN102156757A (en) * | 2011-05-19 | 2011-08-17 | 重庆国虹科技发展有限公司 | Android system-based method for intelligently retrieving mobile phone contact |
| CN102542000A (en) * | 2011-12-07 | 2012-07-04 | 北京风灵创景科技有限公司 | Method and equipment for retrieving contacts |
-
2013
- 2013-05-13 CN CN201310173227.1A patent/CN103294776B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7865842B2 (en) * | 2005-07-14 | 2011-01-04 | International Business Machines Corporation | Instant messaging real-time buddy list lookup |
| CN101426053A (en) * | 2008-10-24 | 2009-05-06 | 深圳市金立通信设备有限公司 | System and method for fast searching phone book and call record when standby |
| CN102156757A (en) * | 2011-05-19 | 2011-08-17 | 重庆国虹科技发展有限公司 | Android system-based method for intelligently retrieving mobile phone contact |
| CN102542000A (en) * | 2011-12-07 | 2012-07-04 | 北京风灵创景科技有限公司 | Method and equipment for retrieving contacts |
Non-Patent Citations (1)
| Title |
|---|
| 几种模式匹配算法的效率分析;巫喜红;《大庆师范学院学报》;20070430;第27卷(第2期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103294776A (en) | 2013-09-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103294776B (en) | Smartphone address book fuzzy search method | |
| CN109670163B (en) | Information identification method, information recommendation method, template construction method and computing device | |
| US7769804B2 (en) | Server side search with multi-word word wheeling and wildcard expansion | |
| CN100578539C (en) | Automatic question-answering method and system | |
| US7277029B2 (en) | Using language models to expand wildcards | |
| KR100714769B1 (en) | Scalable neural network-based language identification from written text | |
| CN100595760C (en) | Method for gaining oral vocabulary entry, device and input method system thereof | |
| CN103064530B (en) | input processing method and device | |
| US7415409B2 (en) | Method to train the language model of a speech recognition system to convert and index voicemails on a search engine | |
| CN107562831A (en) | A kind of accurate lookup method based on full-text search | |
| CN107273359A (en) | A kind of text similarity determines method | |
| US20070164782A1 (en) | Multi-word word wheeling | |
| CN102609500A (en) | Question push method, question answering system using same and search engine | |
| WO2021036439A1 (en) | Method for responding to complaint, and device | |
| CN112527983A (en) | Man-machine natural interaction service system for personalized government affairs | |
| CN105956023A (en) | Method and system for rarely-used character library network application | |
| CN101539433A (en) | Searching method with first letter of pinyin and intonation in navigation system and device thereof | |
| CN102999639A (en) | Speech recognition character index based method and system for searching | |
| CN101458682A (en) | Mapping method based on Chinese character and Japanese Chinese character and use thereof | |
| CN100359445C (en) | Chinese character input method using phrase association and voice prompt for mobile information terminal | |
| CN103488305A (en) | Chinese input method system with simplified and traditional Chinese contrasts | |
| CN115048488A (en) | Patent abstract automatic generation method and storage medium | |
| Wang et al. | Accurate Braille-Chinese translation towards efficient Chinese input method for blind people | |
| Scheffler et al. | Mapping German tweets to geographic regions | |
| CN101436205A (en) | Method and apparatus for enquiring unique word by explanation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |