CN103294776B - Smartphone address book fuzzy search method - Google Patents

Abstract

The invention discloses a fuzzy search method for the address book of a smart phone. Firstly, the contact data of the mobile phone address book is preprocessed, and the pinyin of the contact name and the corresponding thumb keyboard number sequence are obtained by checking the pinyin coding table, and then the pinyin and the number sequence are obtained. , mobile phone number and other key information are written into the memory, and backed up to the designed buffer at the same time, for a given search keyword, according to whether it contains Chinese characters, letters, numbers, match each field of the contact in the memory in three categories, and use A modified string subsequence matching algorithm realizes fuzzy matching between keywords and pinyin of names. The present invention can globally search the address book for any keyword, supports digital search on the thumb keyboard, can fuzzily match the contact name, full spelling, simple spelling, partial pinyin, mobile phone number, mailbox, etc., and at the same time sorts the search results according to the specific matching reasons. output, bringing more convenient and efficient diversified operation methods to users.

Description

A method for fuzzy search of smart phone address book

technical field

The invention relates to the technical field of information processing of a smart phone terminal, in particular to an intelligent search for contacts in an address book.

Background technique

With the development of smart mobile device systems, people's demand for smart phones is getting higher and higher, including more beautified interfaces, simpler and faster operations, and more functional application software. As the most basic application of mobile phones, the mobile phone address book plays a huge role in people's daily life. The process of telephone communication, sending and receiving text messages, and sending emails all need to call the contact phone book. It is relatively weak, especially the user experience in contact search is seriously lagging behind, which causes a lot of inconvenience for users to locate contacts when sending text messages and making calls.

The full-text search of the database is to index the big data text, search for the word to be searched in the established index, and locate which text data contains the word to be searched; all the work of the full-text search is to build an index and search and locate in the index, all The work is carried out around these two; the method of word segmentation is basically binary word segmentation method, maximum matching method and statistical method, and the data structure of the index basically adopts the structure of the inverted index. The full-text retrieval method is mainly applied to large data texts, and it is not suitable for a scene with a simple structure and a small amount of data such as an address book. In addition, it also requires a large storage space, and the index is dynamically maintained as the address book is updated. The overall cost is too high and it is not flexible enough to use.

The traditional address book search uses a simple string matching of input keywords and contact names and numbers, and does not consider special searches such as full spelling, simplified pinyin, and partial pinyin of names. In addition, the subsequence of a string is a new sequence formed from the original sequence by removing some elements without destroying the relative positions of the remaining elements. It is a common standard for describing similar matching of two strings, in a formal way , Given a sequence X=<x1,x2,x3,…,xm>, another sequence Z=<z1,z2,z3,…,zk> is a subsequence of X, if there is a strictly increasing table of X Sequence <i1,i2,...,ik> such that for all j=1,2,...,k. The traditional subsequence matching algorithm does not take into account the initials and finals of Pinyin, and does not perform dynamic word segmentation matching on Pinyin, so certain modifications are required.

The ease of use of the thumb keyboard attracts a large number of smartphone users, and providing intelligent query of the thumb keyboard is an indispensable requirement for users. Therefore, how to provide people with a more convenient and efficient address book search operation method and user experience is an urgent need solved problem.

Contents of the invention

The present invention is aimed at above-mentioned problem, provides a kind of method of smart phone address book fuzzy search, purpose is convenient, efficient address book search operation method, will support contact name (full spelling, simple spelling, partial pinyin, thumb keyboard number sequence) ), mobile phone number, email and other key attributes to provide users with faster and better user experience.

In order to achieve the above object, the present invention adopts the following technical solutions:

A method for fuzzy search of smart phone address book, comprising the following steps:

1) Read the contact data of the local address book through the open interface, eliminate redundant data, and only keep key information, including contact name, mobile phone number and email address;

2) Preprocess all contact information through the information preprocessor. For the Chinese in the name, extract the pinyin by looking up the Chinese character encoding table, and the polyphonic characters correspond to multiple records, and at the same time transcode the pinyin into the number sequence corresponding to the thumb keyboard , write all the above records into the memory and the designed buffer;

3) For the input search keyword key, first check whether there is a corresponding record in the buffer, if it is hit, locate it directly, otherwise search the address book globally, and divide the keyword key into three types: a) contain Chinese characters; b) Does not contain Chinese characters, but contains English letters and numbers; c) only contains pure numbers;

4) For a given keyword key, use the search matcher to perform a matching search. If the keyword belongs to the b category, the matching object is the pinyin of the contact name; if it belongs to the c category, the matching object is the thumb keyboard number sequence; the search matcher The specific matching rules: convert the pinyin of the name into a pinyin array, traverse each letter of the keyword, and match the letters with the pinyin word in turn. If the current letter matches, continue to match the key with the next letter of the current word or the next word The first letter, if all keyword letters have corresponding matches, the match is successful, otherwise the match fails;

5) Obtain all contacts matching the keyword key through steps 3) and 4), perform weighted sorting according to the matching priority through the weighted sorter and output.

Further, in the step 3), for a matching object is the contact name; for b matching object is the contact name pinyin and mailbox; for c matching object is the corresponding thumb keyboard number sequence of the contact phone number and name; for b, C should adopt the phonetic fuzzy matching algorithm in step 4) to carry out fuzzy matching to the phonetic code and the thumb keyboard number sequence, when searching, at first inquire in the buffer, if hit or exist current keyword prefix, then carry out secondary in the original result search.

Further, in the step 4), a modified character string subsequence matching algorithm is adopted, and the specific algorithm idea is described as: for a given keyword key and name pinyin pinyin, first separate pinyin into an array pinyin[ N], define s as the subscript of the pinyin array that starts to match, k is the subscript of the key letter that needs to be matched currently, i is the subscript of the currently matched pinyin word, and j is the subscript of the letter of the current word;

a. initialization s=0, k=0, i=s, j=0, promptly begin to match from the first letter of keyword first letter and the first letter of pinyin first word;

b. Judging k==key.length, if true, the matching is successful, and the algorithm is terminated; if false, then go to c;

c. Judging key[k]==pinyin[i][j], if true turn to d, if false turn to f;

d.k++, j++, that is, try to match the next letter of the keyword with the next letter of the current pinyin word;

e. Judging j<pinyin[i].length, that is, judging in advance whether all the current words have been matched, if true, turn to b to continue to match the next one, and false to g;

f. Judging whether the i-th pinyin has a match, if true turns to g, false then s++, k=0, i=s, j=0 and turns to b, and starts to re-match from the s-th pinyin word;

g.i++, j=0, that is, try to match the keyword and the first letter of the next word;

h. Judging i<pinyin.length, if true, turn to b, if false, the matching fails, and the algorithm terminates;

According to the above algorithm description, it can be accurately judged whether the key and pinyin[N] match. During the algorithm process, a match[N] array is used to record the matching details between the keyword and each pinyin. After the algorithm is finished, it is accurately described according to the match array The reason for the algorithm matching is that the number sequence of the thumb keyboard is only temporary data used in the algorithm process, and the user should also reversely query the specific fuzzy match for pinyin according to the match array.

Further, in the step 5), the matching priority can be customized.

Further, in the step 5), the matching priority is: complete match>partial match; full pinyin>simplified pinyin>partial pinyin; name match>number match>mailbox match.

Further, the search result record of the keyword key that has been searched should be stored in the cache. When searching for a new keyword next time, the cache should be queried first. If the keyword hits or there is a keyword prefix, directly in the cache A secondary search is performed on top of the cached result records.

Compared with the prior art, the present invention has the following beneficial effects:

The method provided by the invention is practical and simple, convenient to operate and efficient to search, and it supports searching contacts by Chinese characters, telephone numbers and mailboxes;

Furthermore, it supports the thumb keyboard to input numbers and directly reverse pinyin to search contacts fuzzily.

Further, the modified character string subsequence matching algorithm can give specific matching reasons for the contact search results.

Furthermore, it supports the thumb keyboard to input numbers and directly reverse pinyin to search contacts fuzzily.

Further, the search results are recorded and cached, so that the secondary search is more efficient.

Description of drawings

FIG. 1 is a structural schematic diagram of fuzzy search in an address book.

Fig. 2 is a flow diagram of fuzzy search for contacts in the address book by keywords.

Fig. 3 is a flow diagram of the modified string subsequence matching algorithm.

detailed description

The invention will be described in detail below in conjunction with the embodiments and accompanying drawings.

The present invention provides a method for fuzzily searching contacts in the address book of a smart phone, and designs a schematic diagram of a search structure as shown in Figure 1, specifically including:

Information preprocessor: obtain and preprocess contact information, filter redundant data, encode names in pinyin, etc.

Cache: cache the pre-processed contact information, and cache the keyword-search results at the same time.

Search matcher: For a given search keyword, match all the key information of the contact according to its category, and it calls the modified subsequence matching algorithm.

Weighted sorter: According to the self-defined priority rules, the search results are globally weighted and sorted.

As shown in Figure 2, the schematic flow diagram of keyword fuzzy search for contacts in the address book can be seen that the search method in one embodiment of the present invention mainly includes the following flow:

1) Through the interface provided by the mobile phone operating system, read the contact data of the phone's address book, eliminate redundant data, and only retain key information such as the contact name, mobile phone number, and email address.

2) Preprocess the personal information of all contacts in the address book. In particular, extract the pinyin of the contact name by checking the Chinese character pinyin code table, and separate each Chinese character pinyin with a space. If there are polyphonic characters in the name, transcode At the same time, translate the pinyin into the number sequence corresponding to the thumb keyboard, maintain the above-mentioned processed contact information in the memory, and back it up to the designed buffer at the same time, the next time you search, you can directly query the buffer Record.

Table 1 is the thumb keyboard digital conversion table corresponding to the pinyin letters.

3)

phonetic alphabet thumb keyboard numbers 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 contacts in the address book, enter search keywords and divide keywords into three categories for consideration: a) contain Chinese characters; b) contain English letters without Chinese characters; c) contain only pure numbers. For a), the keyword contains Chinese characters, and only the unprocessed raw name field in the contact information may contain Chinese, so it is only necessary to match the keyword with the contact name string; for b), the key If the word contains English letters, the possible matching fields should be the pinyin or email address of the contact name. For the pinyin situation, consider one of the full pinyin, simplified pinyin, and partial pinyin of the contact name, and you can use the keywords in step 4 and The matching algorithm of the full name spelling, if it is a mailbox, only simple string matching is enough; for c), the keyword only contains pure numbers, two cases of mobile phone number and thumb keyboard number sequence should be considered, the former only needs Perform substring matching on the keyword and the contact number, and the latter uses the matching algorithm of the keyword and the thumb keyboard number sequence in step 4.

5) For a given keyword key and name pinyin (the matching of pure numbers and thumb keyboard number sequences is similar), firstly separate the name pinyin into an array pinyin[N] with a space character, and match the key and pinyin[N]. Specifically The modified pinyin matching algorithm, that is, the process of the modified string subsequence matching algorithm is shown in Figure 3, and the details are as follows: define s as the subscript of the pinyin array to start matching, k is the subscript of the key letter that needs to be matched currently, and i It is the subscript of the currently matched pinyin word, and j is the subscript of the letter of the current word.

a. Initialize s=0, k=0, i=s, j=0, that is, start to match the first letter of the keyword with the first letter of the first word in Pinyin.

b. Determine k==key.length, if true, the matching is successful, and the algorithm terminates; if false, go to c.

c. Judging key[k]==pinyin[i][j], if true, turn to d, if false, turn to f.

d.k++, j++, that is, try to match the next letter of the keyword with the next letter of the current pinyin word.

e. Judging j<pinyin[i].length, that is, judging in advance whether all the current words have been matched, if true, turn to 2 and continue to match the next one, and false to g.

f. Judge whether there is a match in the i-th pinyin, if true turn to g, false then s++, k=0, i=s, j=0 and turn to b, start to match again from the s-th pinyin word.

g.i++, j=0, that is, try to match the keyword with the first letter of the next word.

h. Determine if i<pinyin.length, if true, turn to b, if false, the matching fails, and the algorithm terminates.

According to the above algorithm description, we can accurately judge whether the key and pinyin[N] match. During the algorithm process, we can use a match[N] array to record the matching details of the keyword and each pinyin. After the algorithm is over, we can use the match Accurately describe the reason for the algorithm matching. In addition, for the thumb keyboard number sequence, it is only temporary data used in the algorithm process. For the user, the reverse query should be based on the match array to find the specific fuzzy match for pinyin.

6) by steps 3), 4) have drawn all contacts matching with the keyword key, sort the results according to the reason (match) of the match, the priority can be customized according to needs, in a better embodiment of the present invention , the priority is defined as follows: exact match>partial match; full pinyin>simplified pinyin>partial pinyin; name match>number match>email.

In order to improve the search efficiency, we store the records of the search keyword key search results in the cache, so that the next time you search for a new keyword, you can first query it in the cache, such as when the keyword hits or there is a prefix keyword, Secondary searches can be performed on top of cached result records, which will greatly improve search efficiency.

Although the present invention has been disclosed as above with preferred embodiments, it is not intended to limit the present invention, and any person skilled in the art can use the methods disclosed above and technical content to analyze the present invention without departing from the spirit and scope of the present invention. Possible changes and modifications are made in the technical solution. Therefore, any simple modifications, equivalent changes and modifications made to the above embodiments according to the technical essence of the present invention, which do not depart from the content of the technical solution of the present invention, all belong to the technical solution of the present invention. scope of protection.

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.