CN103294776A

CN103294776A - Smartphone address book fuzzy search method

Info

Publication number: CN103294776A
Application number: CN2013101732271A
Authority: CN
Inventors: 尹建伟; 姚陶钧; 李莹; 邓水光; 吴健; 吴朝晖
Original assignee: SUZHOU LONGTANG INFORMATION TECHNOLOGY Co Ltd; Zhejiang University ZJU
Current assignee: SUZHOU LONGTANG INFORMATION TECHNOLOGY Co Ltd; Zhejiang University ZJU
Priority date: 2013-05-13
Filing date: 2013-05-13
Publication date: 2013-09-11
Anticipated expiration: 2033-05-13
Also published as: CN103294776B

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, simplified spelling, partial pinyin, mobile phone number, email address, 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

The method that a kind of smart mobile phone address list is searched for generally

Technical field

The present invention relates to the technical field of information processing of intelligent mobile phone terminal, particularly the address book contact intelligent search.

Background technology

Along with the development of intelligent mobile device system, people are also more and more higher to the demand of smart mobile phone, comprise the interface of more beautifying, more succinct operation efficiently, multi-purpose application software etc.Cell phone address book is as the most basic application of mobile phone, in daily life, bring into play enormous function, processes such as telephonic communication, transmitting-receiving note, transmission mail all need to call the contact phone book, and the address list function ratio that present mobile phone operating system carries is weak, especially experience serious hysteresis the user aspect contact person's search, cause the user send short messages, when making a phone call positioning contact much inconvenience.

The database full-text search is that big data text is carried out index, in the index of setting up the word that will search is searched for, and locatees which text data and comprises the word that will search for; Whole work of full-text search are exactly to set up index and search for the location in index, and all work is all carried out around these two; The method of participle is that binary is divided morphology, maximum matching method and statistical method basically, and the indexed data structure adopts the structure of inverted index basically.Text searching method is mainly used in the large data text, this simple in structure, scene that data volume is less of it and inapplicable address list.In addition, it also needs bigger storage space, and along with the renewal Dynamic Maintenance index of address list, overall cost is too big, uses underaction.

What traditional address list search was adopted is to carry out simple characters string coupling to importing key words and name of contact person and number, does not consider the special search such as spelling, simplicity and part phonetic of name.In addition, the subsequence of character string be from initial sequence by removing some element but do not destroy the new sequence that the relative position of remaining element forms, it is the working standard of describing two similar couplings of character string, in formal mode, a given sequence X=＜x ₁, x ₂, x ₃..., x _m, another sequence Z=＜z ₁, z ₂, z ₃..., z _kBe the subsequence of X, if exist XA strictly increasing following table sequence＜i ₁, i ₂..., i _k, make to all j=1,2 ..., k has.Traditional subsequence matching algorithm is not considered initial consonant and the simple or compound vowel of a Chinese syllable of phonetic, phonetic is not carried out dynamic participle coupling, therefore need carry out certain transformation.

The simple ease for use of thumb keyboard is attracting a large amount of smart mobile phone users, and the intelligence inquire that thumb keyboard the is provided requisite demand that is the user, therefore how to people provide more convenient, more efficiently address list search operation method and user to experience be problem demanding prompt solution.

Summary of the invention

The present invention is directed to the problems referred to above, the method that provides a kind of smart mobile phone address list to search for generally, purpose is convenient, address list search operation method efficiently, to support fuzzy matching and location to determinant attributes such as name of contact person (spelling, simplicity, part phonetic, thumb keyboard Serial No.), phone number, mailboxes, and provide faster, better user to experience to the user.

To achieve these goals, the present invention is by the following technical solutions:

The method that a kind of smart mobile phone address list is searched for generally may further comprise the steps:

1) reads the native contact book contact data by open interface, reject redundant data, only leave and take key messages such as name of contact person, phone number, mailbox;

2) by the information pretreater All Contacts's information is carried out pre-service, for the Chinese in the name, extract phonetic by looking into the encode Chinese characters for computer table, polyphone is corresponding many records then, simultaneously phonetic is transcoded into the Serial No. of thumb keyboard correspondence, in above-mentioned all record write memory and the buffer that designs;

3) to the search key key of input, at first whether the query caching device has corresponding record, directly locate if hit then, otherwise the global search address list is divided into three types with key word key: a) contain Chinese character; B) do not contain Chinese character, contain English alphabet and numeral; C) only comprise pure digi-tal;

4) carry out match search for given key word key by the search adaptation, if key word belongs to the b classification, then match objects is name of contact person phonetic; If belong to the c classification, then match objects is the thumb keyboard Serial No.; The concrete matched rule of search adaptation: name phonetic is converted to a phonetic array, each letter of traversal key word, letter and phonetic word are mated successively, if current letter coupling, then continue first letter of the next letter of coupling key and current word or next word, if all key word letters have corresponding coupling, then the match is successful, otherwise it fails to match;

5) obtain the contact person of all and key word key coupling by step 3, four, be weighted ordering and output by the weighting sorting unit according to coupling priority.

Further, in the described step 3), be name of contact person for a match objects; Be name of contact person phonetic and mailbox for the b match objects; Be the corresponding thumb keyboard Serial No. of contact phone number and name for the c match objects; Should adopt the phonetic fuzzy matching algorithm in the step 4) that Pinyin coding and thumb keyboard Serial No. are carried out fuzzy matching for b, c, during search, at first in buffer, inquire about, as if hitting or having current key word prefix, then in former result, carry out binary search.

Further, in the described step 4), specific algorithm thought is described as: to given key word key and name phonetic pinyin, earlier pinyin is separated into array pinyin[N with space character], definition s is the phonetic array index that begins to mate, k is the current key inferior that needs coupling, and i is the phonetic word subscript of current coupling, and j is the inferior of current word;

A. initialization s=0, k=0, i=s, j=0, namely first letter from first letter of key word and first word of phonetic begins coupling;

B. judge k==key.length, if true, then the match is successful, and algorithm stops; If false then changes 3;

C. judge key[k]==pinyin[i] [j], if true changes 4, if false changes 6;

D. k++, j++, it is next alphabetical with current phonetic word namely to attempt the next letter of coupling key word;

E. judge j＜pinyin[i] .length, judge in advance namely whether current word all mates, if changeing 2, true continues the coupling next one, false commentaries on classics 7;

F. judge whether i phonetic has coupling, if true changes then s++ of 7, false, k=0, i=s, j=0 also changes 2, mates again since s phonetic word;

G. i++, j=0 namely attempts coupling key word and first letter of next word;

H. judge i＜pinyin.length, if true then change 2, false then it fails to match, algorithm stops;

According to above arthmetic statement, can accurately judge key and pinyin[N] whether mate, in algorithmic procedure, can be with a match[N] the coupling details of array recording key and each phonetic, after algorithm finishes, according to match accurate description algorithmic match reason, for the thumb keyboard Serial No., employed ephemeral data in the algorithmic procedure just, the user also should oppositely inquire specifically fuzzy matching to pinyin according to the match array.

Further, in the described step 5), described coupling priority can be self-defined.

Further, in the described step 5), coupling priority is: mate fully〉the part coupling; Spelling〉simplicity〉part phonetic; Name matches〉numbers match〉the mailbox coupling.

Further, the key word key+ Search Results record to having searched should deposit in the buffer, next time is when searching for new key word, at first answer the query caching device, if key word hits or when having the key word prefix, directly carry out binary search on the outcome record of buffer memory.

The present invention compared with prior art has following beneficial effect:

Practical simple, the simple operation of method provided by the present invention, search efficiently, its supports Chinese character, telephone number, mailbox to search for the contact person; Support is searched for the contact person generally by name initial, spelling, part phonetic.

Further, support the thumb keyboard input digit directly the anti-phonetic of looking into search for the contact person generally.

Further, can provide concrete coupling reason to search contact person result by improved character string subsequence matching algorithm.

Further, Search Results is carried out record buffer memory, binary search efficient is higher.

Description of drawings

The structural representation that Fig. 1 searches for generally for address list.

Fig. 2 is for searching for the schematic flow sheet of address book contact generally by key word.

Fig. 3 is improved character string subsequence matching algorithm schematic flow sheet.

Embodiment

Come invention is described in detail below in conjunction with embodiment and accompanying drawing.

What the present invention provided is that a kind of smart mobile phone address list is searched for contact person's method generally, has designed searching structure synoptic diagram as shown in Figure 1, specifically comprises:

Information pretreater: obtain and to the associated person information pre-service, filter redundant data, name is carried out Pinyin coding etc.

Buffer: pretreated associated person information is carried out buffer memory, simultaneously key word-Search Results is carried out buffer memory.

The search adaptation: to given search key, according to its all key messages of classification matching associated person, it has called transformed subsequence matching algorithm.

Weighting sorting unit: Search Results according to self-defining priority rule, is carried out overall weighting ordering output.

The schematic flow sheet that address book contact searched for generally in the key word as shown in Figure 2 searching method in the one embodiment of the invention as can be seen mainly comprises following flow process:

1) interface that provides by mobile phone operating system reads the native contact book contact data, rejects redundant data, only leaves and takes key messages such as name of contact person, phone number, mailbox.

2) personal information of all address book contacts is carried out pre-service, especially, name of contact person is extracted phonetic by looking into the Chinese-character sound dissection encode table, use space-separated between each phonetic transcriptions of Chinese characters, if there is polyphone in the name, then be transcoded into many records, simultaneously pinyin translations is become the Serial No. of thumb keyboard correspondence, associated person information to above-mentioned processing is maintained in the internal memory, backups to simultaneously in the buffer that has designed, and next search is record in the query caching device directly.

Table 1 is the thumb keyboard numeral transcoding table of phonetic alphabet correspondence.

3）

When 4) searching for address book contact, the inputted search key word is divided into three kinds with key word and considers: a) contains Chinese character; B) do not contain Chinese character, comprise English alphabet; C) only comprise pure digi-tal.For a), key word comprises Chinese character, may contain Chinese and have only in the associated person information in the original name field of unprocessed mistake, therefore only needs key word and name of contact person string matching are got final product; For b), key word comprises English alphabet, the field that may meet should be phonetic or the mailbox of name of contact person, for the phonetic situation, be thought of as spelling, simplicity, part phonetic a kind of of name of contact person, can adopt the matching algorithm of key word in the step 4 and name spelling to handle, if mailbox then only needs a simple string matching to get final product; For c), key word only comprises pure digi-tal, should consider two kinds of situations of phone number and thumb keyboard Serial No., the former only need carry out the substring coupling to key word and contact number, and the latter then adopts the key word of step 4 and the matching algorithm of thumb keyboard Serial No..

5) similar to given key word key and name phonetic pinyin(pure digi-tal and thumb keyboard Serial No. coupling situation), earlier name phonetic is separated into array pinyin[N with space character], coupling key and pinyin[N].

Concrete transformed phonetic matching algorithm, be improved character string subsequence matching algorithm flow process as shown in Figure 3, specific as follows: definition s is the phonetic array index that begins to mate, k is the current key inferior that needs coupling, i is the phonetic word subscript of current coupling, and j is the inferior of current word.

A. initialization s=0, k=0, i=s, j=0, namely first letter from first key word letter and first word of phonetic begins coupling.

B. judge k==key.length, if true, then the match is successful, and algorithm stops; If false then changes 3.

C. judge key[k]==pinyin[i] [j], if true changes 4, if false changes 6.

D. k++, j++, it is next alphabetical with current phonetic word namely to attempt the next letter of coupling key word.

E. judge j＜pinyin[i] .length, judge in advance namely whether current word all mates, if changeing 2, true continues the coupling next one, false commentaries on classics 7.

F. judge whether i phonetic has coupling, if true changes then s++ of 7, false, k=0, i=s, j=0 also changes 2, mates again since s phonetic word.

G. i++, j=0 namely attempts coupling key word and first letter of next word.

H. judge i＜pinyin.length, if true then change 2, false then it fails to match, algorithm stops.

According to above arthmetic statement, can accurately judge key and pinyin[N] whether mate, in algorithmic procedure, we can be with a match[N] the coupling details of array recording key and each phonetic, after algorithm finishes, can be according to match accurate description algorithmic match reason, in addition for the thumb keyboard Serial No., it is employed ephemeral data in the algorithmic procedure, also should oppositely inquire specifically fuzzy matching to pinyin according to the match array for the user.

6) by step 3), 4) contact person that drawn all and key word key coupling, reason (match) according to coupling sorts to the result, priority can be self-defined as required, and among the embodiment, priority definition is as follows preferably in the present invention: coupling fully〉the part coupling; Spelling〉simplicity〉part phonetic; Name matches〉numbers match〉mailbox.

In order to improve search efficiency, we deposit the record of search key key-Search Results in the buffer in, when search for new key word next time like this, can in buffer, inquire about earlier, hit or when having prefix key as key word, can carry out binary search on the outcome record of buffer memory, this will improve search efficiency greatly.

Though the present invention with preferred embodiment openly as above; but it is not to limit the present invention; any those skilled in the art without departing from the spirit and scope of the present invention; can utilize method and the technology contents of above-mentioned announcement that technical solution of the present invention is made possible change and modification; therefore; every content that does not break away from technical solution of the present invention; to any simple modification, equivalent variations and modification that above embodiment does, all belong to the protection domain of technical solution of the present invention according to technical spirit of the present invention.

Claims

1. A method for smart phone address book fuzzy search, is characterized in that, comprises 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 such as the contact name, mobile phone number, and email address;

2) Preprocess all contact information through the information preprocessor. For the Chinese in the name, pinyin is extracted by checking the Chinese character encoding table, and polyphonic characters correspond to multiple records. At the same time, the pinyin is transcoded into a sequence of numbers 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 cache, 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), and use the weighted sorter to perform weighted sorting according to the matching priority and output.

2. The method for fuzzy search of address book according to claim 1, characterized in that in step 3), the matching object for a is the name of the contact; the matching object for b is the pinyin and email address of the contact name; for c matching The object is the corresponding thumb keyboard number sequence of the contact phone number and name; for b and c, the fuzzy matching algorithm in step 4) should be used to fuzzy match the pinyin code and the thumb keyboard number sequence. When searching, first query in the cache, If it matches or exists the current keyword prefix, a second search will be performed in the original result.

3. The method for fuzzy search of the address book according to claim 1, characterized in that, in said step 4), a modified character string subsequence matching algorithm is used, and the specific algorithm idea is described as: for a given keyword Key and name pinyin, first separate pinyin with a space character into an array pinyin[N], 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 is the subscript of the current matching pinyin word Subscript, j is the letter subscript of the current word;

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

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

c. Judge key[k]==pinyin[i][j], if true turn to 4, if false turn to 6;

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 the current word has been matched, if true, turn to 2 and continue to match the next one, and false to turn to 7;

f. Determine whether there is a match for the i-th pinyin, if true turn to 7, false then s++, k=0, i=s, j=0 and turn to 2, and start matching 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. Judging i<pinyin.length, if true, turn to 2, 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 can be used to record the matching details between the keyword and each pinyin. After the algorithm is finished, it can be accurately described according to the match 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.

4. The method for fuzzy search of address book according to claim 1, characterized in that, in the step 5), the matching priority can be customized.

5. The method for fuzzy search of address book according to claim 4, characterized in that, in step 5), the matching priority is: complete match>partial match; full spelling>simplified pinyin>partial pinyin; name match> Number Match > Email Match.

6. according to the method for the address book fuzzy search described in any one of claim 1-5, it is characterized in that, to the keyword key+search result record that has been searched, should be stored in the cache memory, search new key next time When searching for a word, the cache should be queried first, and if the keyword hits or there is a keyword prefix, a secondary search is performed directly on the cached result record.