CN102737105A - Dict-tree generation method and searching method - Google Patents
Dict-tree generation method and searching method Download PDFInfo
- Publication number
- CN102737105A CN102737105A CN2012100950861A CN201210095086A CN102737105A CN 102737105 A CN102737105 A CN 102737105A CN 2012100950861 A CN2012100950861 A CN 2012100950861A CN 201210095086 A CN201210095086 A CN 201210095086A CN 102737105 A CN102737105 A CN 102737105A
- Authority
- CN
- China
- Prior art keywords
- dictionary tree
- numeral
- phonetic
- user
- tree
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/12—Use of codes for handling textual entities
- G06F40/126—Character encoding
- G06F40/129—Handling non-Latin characters, e.g. kana-to-kanji conversion
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/20—Natural language analysis
- G06F40/274—Converting codes to words; Guess-ahead of partial word inputs
Abstract
The invention discloses a dict-tree generation method and searching method, comprising the steps of converting contact person information into spellings; corresponding the spellings into numbers according to corresponding methods of T9 keyboard; marking a first spelling corresponding to each Chinese character in the contact person information in the numbers as an initial node; and generating the dict-tree and storing the dict-tree. The invention further discloses a dict-tree searching method. By means of the technical scheme, during dict-tree storage, occupied storage space is small, and during searching, search results can be quickly obtained, thereby lowering requirements of dict-tree storage on storage space, effectively reducing response time of searching, and improving user experience degree.
Description
Technical field
The present invention relates to information stores and search technique field, relate in particular to a kind of dictionary tree generation method and searching method.
Background technology
In smart mobile phone,, generally all can corresponding function of search be provided at dialing interface in order to let the user find the contact person more efficiently.And generally speaking the input of dialing interface all is digital and */# number, so, generally all adopt the corresponding relation of T9 to represent phonetic, adopt phonetic to come search contact then.
The corresponding relation of T9 is shown in table one:
Table one
| The dialing character | Letter | The dialing character | Letter | The dialing character | Letter |
| 1 | 2 | ABC | 3 | DEF | |
| 4 | GHI | 5 | JKL | 6 | MNO |
| 7 | PQRS | 8 | TUV | 9 | WXYZ |
| * | 0 | # |
For instance, the telephone number of supposing contact person's " Li Xiaoming " is 13912345678.If the user will search for this contact person " Li Xiaoming " at dialing interface; Just can import the numeral 5494266464 of the correspondence of LiXiaoMing; Through the coupling of T9 searching algorithm, just can search contact person's " Li Xiaoming " and show his telephone number and other information.
User's convenient searching for ease, T9 searching algorithm often need complicated more Matching Model.Such as wanting search contact " Li Xiaoming ", need input 5494266464 these 10 numerals, in order to simplify user's input, the T9 searching algorithm often allows the user directly to import 596 3 numerals of corresponding numeral of LXM just can the matching associated person Li Xiaoming.Equally, LiXM, LXiaoM, LXMing, LiXiaoM... or the like can match contact person's Li Xiaoming.
Generally speaking, for a contact person, often need to generate in advance pairing some coupling strings that can search this contact person, the input of simple match user is mated string with the contact person who generates in advance then, just can search this contact person.
There is significant disadvantages in this technical scheme, is example with contact person's " Li Xiaoming " still, needs the coupling string of generation a lot, amounts to 42, and is specific as follows:
L,?Li,?X,?Xi,?Xia,?Xiao,?M,?Mi,?Min,?Ming,?LiXiao,?LX,?LXi,?LXia,?LiX,?LiXi,?LiXia,?LXiao,?XiaoMing,?XM,?XMi,?XMin,?XiaoM,?XiaoMi,?XiaoMin,?XMing,?LiXiaoMing,?LXM,?LXMi,?LXMin,?LiXM,?LiXMi,?LiXMin,?LXiaoM,?LXiaoMi,?LXiaoMin,?LXMing,?LiXiaoM,?LiXiaoMi,?LiXiaoMin,?LiXMing,?LXiaoMing。
Index increases this numeral along with contact name's increase.If the user in storing contact in name also with on the contact person belong to company, post (this is the method that much human is preserved the contact person), will cause the coupling string a lot.It is estimated that suppose that an average contact person's " name " comprises 5 characters, on average the phonetic length of each character is 4, then can have 208 coupling strings.If there are 500 contact persons, then can there be 10.4 ten thousand coupling strings.(contact name is very long, when contact person's number is a lot) coupling string can exponential rising under the extreme case.
Lot of data can cause two consequences: the storage space that first needs are bigger, it two is to need long query times.Because search is carried out in mobile device, the storage space of mobile device and cpu resource all compare valuable.First consequence can be brought bigger waste, and second consequence then can be brought very big delay, increases the time of system responses user input, causes the user to think that input process is not smooth.
Summary of the invention
The objective of the invention is to propose a kind of dictionary tree generation method and searching method,, reduce storage space and shorten the response time in order to solve big storage space of the needs that in the T9 search, cause and the problem of response time owing to mass data.
For reaching this purpose, the present invention adopts following technical scheme:
A kind of dictionary tree generation method, this method comprises:
Convert associated person information into phonetic;
Said phonetic is corresponded to numeral according to the corresponded manner of T9 keyboard;
First said phonetic that each Chinese character is corresponding in the associated person information described in the said numeral is labeled as the initial node;
Generate dictionary tree, and storage.
Saidly convert associated person information into phonetic, comprising:
Convert said associated person information into spelling from Chinese character.
Said said phonetic is corresponded to numeral according to the corresponded manner of T9 keyboard, comprising:
Each letter in the said phonetic is become numeral according to the corresponded manner correspondence of T9 keyboard respectively, generate a numeric string.
Said first said phonetic with each Chinese character correspondence in the associated person information described in the said numeral is labeled as the initial node, comprising:
The letter of first said phonetic that each Chinese character is corresponding in the said associated person information is carried out mark;
After the corresponding one-tenth of said phonetic numeral, the alphabetical pairing figure notation of first said phonetic that said each Chinese character is corresponding is the initial node.
A kind of dictionary tree searching method is used for the dictionary tree that aforesaid dictionary tree generation method is generated, and this method comprises:
Use the 1st numeral of user's input to mate initial nodes all in all dictionary trees one by one, deposit the dictionary tree that matees in set L [1]; L is the tabulation of a set, and length is M; L [m] representes m set; Said M is the sum of the numeral of user's input;
M+1 numeral of use user input mated the next initial node of the initial that mated last time in the dictionary tree among the said set L [m] one by one, deposits the dictionary tree that matees in set L [m+1]; Said m=2,3 ... M;
Use m+1 numeral of user's input to mate among the said set L [m] the initial node and the node between the next initial node of coupling last time in the dictionary tree one by one, the dictionary tree that matees is deposited in gather L [m+k]; Said k is the initial node of last time coupling and the number of the node between the next initial node; Said m=1,2,3......M-k, M-k+1 ≤k ≤M.
By that analogy, finish, deposit the dictionary tree that matees in set L [M] until M numeral of user's input all mated;
If said set L [M] is not empty, then exporting the middle dictionary tree corresponding contact information of said set L [M] is Search Results; Otherwise if said set L [M] is empty, then output does not match, and does not have this and gets in touch artificial Search Results.
Said dictionary tree corresponding contact information is a Search Results, comprising:
With said dictionary tree corresponding contact information output, as Search Results.
Adopted technical scheme of the present invention, identified, obtained the initial node, generated dictionary tree and come storing contact information through first phonetic alphabet to each word in the associated person information.When searching for, through obtaining the numeral of user input, respectively with dictionary tree in the initial node mate, thereby accomplish search procedure fast.The scheme that the embodiment of the invention provides; In the storage dictionary tree, take less storage space, when searching for; Can obtain Search Results fast; Thereby reduce the requirement of the storage of dictionary tree, also can effectively reduce response time of searching for, improve user experience for storage space.
Description of drawings
Fig. 1 is a dictionary tree generation method principle flow chart provided by the invention in the specific embodiment of the invention;
Fig. 2 is a prior art dictionary tree generating structure synoptic diagram in the specific embodiment of the invention;
Fig. 3 is a searching method principle flow chart provided by the invention in the specific embodiment of the invention.
Embodiment
Further specify technical scheme of the present invention below in conjunction with accompanying drawing and through embodiment.
The main thought of technical scheme of the present invention is: in storing contact information, identify through first phonetic alphabet to each word in the associated person information, obtain the initial node, generate dictionary tree and come storing contact information.Carry out storing contact information with regard to all character strings of unnecessary generation like this, just can store all associated person informations and only need generate 9 dictionary trees.In searched for contact information, with the numeral of user input respectively with the dictionary tree of storage in the initial node mate, thereby the pairing dictionary tree of positioning contact information fast, thereby obtain Search Results fast.
Import the search procedure of complete associated person information for the user; Technical scheme of the present invention has also been set under the situation that can't mate the initial node; Perhaps can't adopt the initial node matching to accomplish under the situation of search; Mate other node between two initial nodes respectively, thereby the node in the complete coupling dictionary tree is guaranteed to obtain Search Results accurately.
In the technical scheme provided by the invention; With the corresponding dictionary tree of T9 input method is example; The process of the storage and the search of dictionary tree is described, in fact, for other input method; Can generate the corresponding dictionary tree line search of going forward side by side equally, needed only is to get final product by changing corresponding corresponding method into through T9 keyboard corresponding in the process that associated person information is corresponding with the dictionary tree self check.Technical scheme provided by the invention is equally applicable to other can come canned data through dictionary tree, and comes in the scheme of search information according to dictionary tree.
As shown in Figure 1, be dictionary tree generation method principle flow chart provided by the invention, specific as follows:
When the user storage associated person information, because associated person information is Chinese character or other form, step at first need convert associated person information to phonetic by Chinese character, particularly need convert the form of spelling to.This process, general mobile phone or other terminal can be accomplished through built-in input method converse routine.
After converting Chinese character into phonetic, also needing further become numeral according to the corresponded manner correspondence of T9 keyboard respectively with each letter in the phonetic, generates a numeric string.The T9 keyboard here is exactly the keyboard on mobile phone or other terminal, and concrete letter can be referring to the content of table one with the corresponding relation of numeral.
Here, the letter with first phonetic that each Chinese character is corresponding in the associated person information carries out mark; With after the corresponding one-tenth of the phonetic numeral, the alphabetical pairing figure notation of first phonetic that each Chinese character is corresponding is the initial node then.
Like this, the dictionary tree through mark initial node has just generated.As shown in Figure 2, be respectively the form of the dictionary tree that form and scheme provided by the invention generated of the dictionary tree that generates in the prior art, wherein, be that example is explained still with contact person's " Li Xiaoming ".Contrast can be known, only there are 9 such dictionary trees (having no the letter correspondence because of 0) in the dictionary tree that generates in the scheme provided by the invention in the total system.And every dictionary tree can be shared total prefix.Certainly, the poorest situation is that all associated person informations do not have total prefix, in this case, each associated person information need store one just passable from the root node to the leaf.If 500 associated person informations are arranged, with dictionary tree generation method of the prior art, on average need 10.4 ten thousand items, need 500 paths (worst case) from the root node to the leaf now at most, become original 0.48%.Under average case, these data can be littler.
Accordingly, the present invention provides a kind of dictionary tree searching method, is applicable to the dictionary tree that above-mentioned dictionary tree generation method generates, and as shown in Figure 3, its principle process is following:
Step 21 uses the 1st numeral of user's input to mate initial nodes all in all dictionary trees one by one, deposits the dictionary tree that matees in set L [1].
The L here is the tabulation of a set, and length is M (being M set), and L [m] representes m set, and said M is the sum of the numeral of user's input.
The principle of this step is to obtain the first numeral of user's input; Mate all initial nodes in the dictionary tree one by one; For example; The first digit of user's input is used for mating all initial nodes of dictionary tree, if coupling just is stored in this dictionary tree among the set L [1], obtains the position of dictionary tree and first occurrence of coupling.
Here, m=2,3......M, exactly after m numeral is matched to merit, this dictionary tree just has been stored among the set L [m], afterwards, needs the further follow-up numeral of coupling, m+1 numeral of user's input just.M+1 numeral of user's input mated the next initial node of the initial node that mated last time in the dictionary tree among the set L [m] one by one, deposits the dictionary tree that matees in set L [m+1].
Here, M is the sum of the numeral imported of user, just needs the numeral and the dictionary tree of match user input one by one, after M numeral of user's input all mated, with it fully the dictionary tree of coupling deposit in and gather L [M].
Here, after all numerals of user's input were all mated, if set L [M] is empty, i.e. expression did not have suitable matching result, and user's input error does not have this contact person.When set L [M] is not empty, represent to have suitable matching result, thereby need this result's output.
The output here needs to convert this dictionary tree corresponding characters string into associated person information and exports, as Search Results.
Special, in the above-mentioned searching method, only considered that user's input digit is the situation of associated person information initial; The situation of the input associated person information of failing to consider that the user is complete, perhaps the user has imported the situation of part associated person information, thereby; In the above-mentioned method, also comprise:
Use m+1 numeral of user's input to mate among the set L [m] the initial node and the node between the next initial node of coupling last time in the dictionary tree one by one, the dictionary tree that matees is deposited in gather L [m+k]; K is the initial node of last time coupling and the serial number of the node between the next initial node.
Here; If the numeral of user's input is the associated person information spelling; Rather than during corresponding digital of initial, in the process of search, just need carry out coupling one by one to all nodes afterwards of first initial node in the dictionary tree; The method of coupling be one by one with numeral (node) coupling after first initial node in the numeral of user input and the dictionary tree, and the result that can mate is kept at one and gathers among the L [m+k].The k here is not single value, but M-k+1 < ≤M accomplishes up to all numeral couplings of user input=k.Like this, can mate between all the digital and all dictionary trees with user's input, avoid the infull problem of only bringing of coupling with the initial node matching.
If set L [M] is not empty, then the dictionary tree corresponding contact information is a Search Results among the output set L [M]; Otherwise if set L [M] is empty, then output does not match, and does not have this and gets in touch artificial Search Results.
In fact; For Search Results accurately; Need the method for two kinds of above-mentioned couplings to combine, should mate second initial node in the dictionary tree, also will mate other node between two initial nodes; Must deposit the result in set L [M] then, the dictionary tree corresponding contact information output that will gather L [M] is net result.
In the above-mentioned searching method, above-mentioned estimation, the complexity of in the All Contacts, searching is O (log (M*N) * C), and the complexity of searching method of the prior art is O (2
M* N*C).So the complexity of method provided by the invention has also reduced doubly a lot, thereby the response time that can significantly reduce system.The C here is contact person's a number.
In sum, technical scheme of the present invention identifies through first phonetic alphabet to each word in the associated person information, obtains the initial node, generates dictionary tree and comes storing contact information.When searching for, through obtaining the numeral of user input, respectively with dictionary tree in the initial node mate, thereby accomplish search procedure fast.The scheme that the embodiment of the invention provides; In the storage dictionary tree, take less storage space, when searching for; Can obtain Search Results fast; Thereby reduce the requirement of the storage of dictionary tree, also can effectively reduce response time of searching for, improve user experience for storage space.
The above; Be merely the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, anyly is familiar with this technological people in the technical scope that the present invention disclosed; The variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection domain of claim.
Claims (8)
1. a dictionary tree generation method is characterized in that, this method comprises:
Convert associated person information into phonetic;
Said phonetic is corresponded to numeral according to the corresponded manner of T9 keyboard;
First said phonetic that each Chinese character is corresponding in the associated person information described in the said numeral is labeled as the initial node;
Generate dictionary tree, and storage.
2. the method for claim 1 is characterized in that, saidly converts associated person information into phonetic, comprising:
Convert said associated person information into spelling from Chinese character.
3. the method for claim 1 is characterized in that, said said phonetic is corresponded to numeral according to the corresponded manner of T9 keyboard, comprising:
Each letter in the said phonetic is become numeral according to the corresponded manner correspondence of T9 keyboard respectively, generate a numeric string.
4. the method for claim 1 is characterized in that, said first said phonetic with each Chinese character correspondence in the associated person information described in the said numeral is labeled as the initial node, comprising:
The letter of first said phonetic that each Chinese character is corresponding in the said associated person information is carried out mark;
After the corresponding one-tenth of said phonetic numeral, the alphabetical pairing figure notation of first said phonetic that said each Chinese character is corresponding is the initial node.
5. a dictionary tree searching method is used for the dictionary tree that dictionary tree generation method as claimed in claim 1 is generated, and it is characterized in that this method comprises:
Use the 1st numeral of user's input to mate initial nodes all in all dictionary trees one by one, deposit the dictionary tree that matees in set L [1]; L is the tabulation of a set, and length is M; L [m] representes m set; Said M is the sum of the numeral of user's input;
M+1 numeral of use user input mated the next initial node of the initial that mated last time in the dictionary tree among the said set L [m] one by one, deposits the dictionary tree that matees in set L [m+1]; Said m=2,3 ... M;
By that analogy, finish, deposit the dictionary tree that matees in set L [M] until M numeral of user's input all mated.
6. method as claimed in claim 5 is characterized in that, this method also comprises:
Use m+1 numeral of user's input to mate among the said set L [m] the initial node and the node between the next initial node of coupling last time in the dictionary tree one by one, the dictionary tree that matees is deposited in gather L [m+k]; Said k is the initial node of last time coupling and the number of the node between the next initial node; Said m=1,2,3......M-k, M-k+1 ≤k ≤M.
7. like claim 5 or 6 described methods, it is characterized in that the determination methods of Search Results comprises:
If said set L [M] is not empty, then exporting the middle dictionary tree corresponding contact information of said set L [M] is Search Results; Otherwise if said set L [M] is empty, then output does not match, and does not have this and gets in touch artificial Search Results.
8. like claim 5 or 6 described methods, it is characterized in that said dictionary tree corresponding contact information is a Search Results, comprising:
With said dictionary tree corresponding contact information output, as Search Results.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100950861A CN102737105A (en) | 2012-03-31 | 2012-03-31 | Dict-tree generation method and searching method |
| PCT/CN2013/073471 WO2013143493A1 (en) | 2012-03-31 | 2013-03-29 | Dictionary tree generation method and searching method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100950861A CN102737105A (en) | 2012-03-31 | 2012-03-31 | Dict-tree generation method and searching method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102737105A true CN102737105A (en) | 2012-10-17 |
Family
ID=46992609
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012100950861A Pending CN102737105A (en) | 2012-03-31 | 2012-03-31 | Dict-tree generation method and searching method |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102737105A (en) |
| WO (1) | WO2013143493A1 (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103123539A (en) * | 2012-11-16 | 2013-05-29 | 佳都新太科技股份有限公司 | Matching method of T9 keyboard numbers and Chinese |
| WO2013143493A1 (en) * | 2012-03-31 | 2013-10-03 | 北京小米科技有限责任公司 | Dictionary tree generation method and searching method |
| CN103823814A (en) * | 2012-11-19 | 2014-05-28 | 腾讯科技（深圳）有限公司 | Information processing method and information processing device |
| CN104199541A (en) * | 2014-08-08 | 2014-12-10 | 乐视网信息技术（北京）股份有限公司 | Searching method and device based on stroke input |
| CN105550214A (en) * | 2015-12-02 | 2016-05-04 | 广东欧珀移动通信有限公司 | Contact information matching method and device |
| CN106484865A (en) * | 2016-10-10 | 2017-03-08 | 哈尔滨工程大学 | One kind is based on four word chained list dictionary tree searching algorithm of DNA k mer index problem |
| CN106713273A (en) * | 2016-11-23 | 2017-05-24 | 中国空间技术研究院 | Protocol keyword identification method based on lexicographic tree pruning search |
| CN108595584A (en) * | 2018-04-18 | 2018-09-28 | 卓望数码技术（深圳）有限公司 | A kind of Chinese character output method and system based on numeral mark |
| CN108683933A (en) * | 2018-05-22 | 2018-10-19 | 广州视源电子科技股份有限公司 | Program searching method, device, television set and readable storage medium storing program for executing |
| CN109522550A (en) * | 2018-11-08 | 2019-03-26 | 和美（深圳）信息技术股份有限公司 | Text information error correction method, device, computer equipment and storage medium |
| CN110019649A (en) * | 2017-12-25 | 2019-07-16 | 北京新媒传信科技有限公司 | A kind of method and device established, search for index tree |
| CN110543575A (en) * | 2019-08-28 | 2019-12-06 | 浙江鸿泉车联网有限公司 | media file retrieval method and device of vehicle-mounted external storage equipment |
| CN112163007A (en) * | 2020-09-28 | 2021-01-01 | 惠州市德赛西威智能交通技术研究院有限公司 | Method and system for quickly matching and searching contact persons |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112612863B (en) * | 2020-12-23 | 2023-03-31 | 武汉大学 | Address matching method and system based on Chinese word segmentation device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1925515A (en) * | 2005-08-31 | 2007-03-07 | 海尔集团公司 | Method and system for enquiring telephone number |
| CN1979482A (en) * | 2006-11-08 | 2007-06-13 | 中国工商银行股份有限公司 | Specific text infor mation processing method based on key tree and system therefor |
| CN101753327A (en) * | 2008-12-17 | 2010-06-23 | 中兴通讯股份有限公司 | Method for rapidly positioning contact in instant communication |
| CN101833381A (en) * | 2010-05-19 | 2010-09-15 | 北京友录在线科技发展有限公司 | Pinyin reverse-tracing method for address list of handheld device |
| CN101853280A (en) * | 2010-05-19 | 2010-10-06 | 北京友录在线科技发展有限公司 | Method for searching for contacts in hand-held equipment |
| CN102063482A (en) * | 2010-12-27 | 2011-05-18 | 北京友录在线科技发展有限公司 | High-efficiency contact searching method of handheld device |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1731796A (en) * | 2005-08-19 | 2006-02-08 | 吴益清 | Called name pronunciation initial letter digital string calling method |
| CN102737105A (en) * | 2012-03-31 | 2012-10-17 | 北京小米科技有限责任公司 | Dict-tree generation method and searching method |
-
2012
- 2012-03-31 CN CN2012100950861A patent/CN102737105A/en active Pending
-
2013
- 2013-03-29 WO PCT/CN2013/073471 patent/WO2013143493A1/en active Application Filing
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1925515A (en) * | 2005-08-31 | 2007-03-07 | 海尔集团公司 | Method and system for enquiring telephone number |
| CN1979482A (en) * | 2006-11-08 | 2007-06-13 | 中国工商银行股份有限公司 | Specific text infor mation processing method based on key tree and system therefor |
| CN101753327A (en) * | 2008-12-17 | 2010-06-23 | 中兴通讯股份有限公司 | Method for rapidly positioning contact in instant communication |
| CN101833381A (en) * | 2010-05-19 | 2010-09-15 | 北京友录在线科技发展有限公司 | Pinyin reverse-tracing method for address list of handheld device |
| CN101853280A (en) * | 2010-05-19 | 2010-10-06 | 北京友录在线科技发展有限公司 | Method for searching for contacts in hand-held equipment |
| CN102063482A (en) * | 2010-12-27 | 2011-05-18 | 北京友录在线科技发展有限公司 | High-efficiency contact searching method of handheld device |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013143493A1 (en) * | 2012-03-31 | 2013-10-03 | 北京小米科技有限责任公司 | Dictionary tree generation method and searching method |
| CN103123539A (en) * | 2012-11-16 | 2013-05-29 | 佳都新太科技股份有限公司 | Matching method of T9 keyboard numbers and Chinese |
| CN103823814B (en) * | 2012-11-19 | 2017-12-01 | 腾讯科技（深圳）有限公司 | A kind of information processing method and device |
| CN103823814A (en) * | 2012-11-19 | 2014-05-28 | 腾讯科技（深圳）有限公司 | Information processing method and information processing device |
| CN104199541A (en) * | 2014-08-08 | 2014-12-10 | 乐视网信息技术（北京）股份有限公司 | Searching method and device based on stroke input |
| CN105550214A (en) * | 2015-12-02 | 2016-05-04 | 广东欧珀移动通信有限公司 | Contact information matching method and device |
| CN106484865A (en) * | 2016-10-10 | 2017-03-08 | 哈尔滨工程大学 | One kind is based on four word chained list dictionary tree searching algorithm of DNA k mer index problem |
| CN106713273B (en) * | 2016-11-23 | 2019-08-09 | 中国空间技术研究院 | A kind of protocol keyword recognition methods based on dictionary tree pruning search |
| CN106713273A (en) * | 2016-11-23 | 2017-05-24 | 中国空间技术研究院 | Protocol keyword identification method based on lexicographic tree pruning search |
| CN110019649A (en) * | 2017-12-25 | 2019-07-16 | 北京新媒传信科技有限公司 | A kind of method and device established, search for index tree |
| CN108595584A (en) * | 2018-04-18 | 2018-09-28 | 卓望数码技术（深圳）有限公司 | A kind of Chinese character output method and system based on numeral mark |
| CN108595584B (en) * | 2018-04-18 | 2022-06-07 | 卓望数码技术（深圳）有限公司 | Chinese character output method and system based on digital marks |
| CN108683933A (en) * | 2018-05-22 | 2018-10-19 | 广州视源电子科技股份有限公司 | Program searching method, device, television set and readable storage medium storing program for executing |
| CN109522550A (en) * | 2018-11-08 | 2019-03-26 | 和美（深圳）信息技术股份有限公司 | Text information error correction method, device, computer equipment and storage medium |
| CN109522550B (en) * | 2018-11-08 | 2023-04-07 | 和美（深圳）信息技术股份有限公司 | Text information error correction method and device, computer equipment and storage medium |
| CN110543575A (en) * | 2019-08-28 | 2019-12-06 | 浙江鸿泉车联网有限公司 | media file retrieval method and device of vehicle-mounted external storage equipment |
| CN112163007A (en) * | 2020-09-28 | 2021-01-01 | 惠州市德赛西威智能交通技术研究院有限公司 | Method and system for quickly matching and searching contact persons |
| CN112163007B (en) * | 2020-09-28 | 2023-11-17 | 惠州市德赛西威智能交通技术研究院有限公司 | Method and system for quickly matching and searching contacts |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2013143493A1 (en) | 2013-10-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102737105A (en) | Dict-tree generation method and searching method | |
| CN103294776B (en) | Smartphone address book fuzzy search method | |
| CN109670163B (en) | Information identification method, information recommendation method, template construction method and computing device | |
| CN102063482B (en) | High-efficiency contact searching method of handheld device | |
| CN111444705A (en) | Error correction method, device, equipment and readable storage medium | |
| CN102541505A (en) | Voice input method and system thereof | |
| CN101539836A (en) | Human-machine interface interactive system and method | |
| CN102710854A (en) | Method and mobile terminal for fast matching dialing of Android system | |
| CN101576929B (en) | Fast vocabulary entry prompting realization method | |
| CN101676911A (en) | Contact person searching system and method | |
| CN104219362A (en) | Method and device for searching for contact person | |
| CN103594085A (en) | Method and system providing speech recognition result | |
| US10152473B2 (en) | English input method and input device | |
| CN112527983A (en) | Man-machine natural interaction service system for personalized government affairs | |
| CN104915458A (en) | Automatic association method and system during application search by user, and mobile terminal | |
| CN101853280A (en) | Method for searching for contacts in hand-held equipment | |
| CN102866781B (en) | A kind of tone-character conversion method and system | |
| CN102156757A (en) | Android system-based method for intelligently retrieving mobile phone contact | |
| CN101577115A (en) | Voice input system and voice input method | |
| CN102999639A (en) | Speech recognition character index based method and system for searching | |
| CN103064531A (en) | Terminal and input method | |
| CN107846492B (en) | First letter-digit mixed retrieval method and system | |
| CN101470712A (en) | English words query system and method by mathematical operation | |
| CN104063500A (en) | Information processing device and method | |
| CN111563359A (en) | Time identification method and device and related equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C53 | Correction of patent of invention or patent application | ||
| CB02 | Change of applicant information |
Address after: 100102, Haidian District, Beijing Qinghe Street No. 68, Huarun colorful city shopping center two, 13 layers Applicant after: Xiaomi Technology Co., Ltd. Address before: 100102, Beijing, Wangjing West Road, No. 50, -1 volume stone world building, block A, 12, 2, Chaoyang District Applicant before: Beijing Xiaomi Technology Co., Ltd. |
|
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20121017 |