CN102063482B - High-efficiency contact searching method of handheld device - Google Patents
High-efficiency contact searching method of handheld device Download PDFInfo
- Publication number
- CN102063482B CN102063482B CN2010106078711A CN201010607871A CN102063482B CN 102063482 B CN102063482 B CN 102063482B CN 2010106078711 A CN2010106078711 A CN 2010106078711A CN 201010607871 A CN201010607871 A CN 201010607871A CN 102063482 B CN102063482 B CN 102063482B
- Authority
- CN
- China
- Prior art keywords
- character
- node
- string
- letter
- matching
- 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.)
- Expired - Fee Related
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/3331—Query processing
- G06F16/3332—Query translation
- G06F16/3337—Translation of the query language, e.g. Chinese to English
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M1/00—Substation equipment, e.g. for use by subscribers
- H04M1/26—Devices for calling a subscriber
- H04M1/27—Devices whereby a plurality of signals may be stored simultaneously
- H04M1/274—Devices whereby a plurality of signals may be stored simultaneously with provision for storing more than one subscriber number at a time, e.g. using toothed disc
- H04M1/2745—Devices whereby a plurality of signals may be stored simultaneously with provision for storing more than one subscriber number at a time, e.g. using toothed disc using static electronic memories, e.g. chips
- H04M1/27467—Methods of retrieving data
- H04M1/2748—Methods of retrieving data by matching character strings
Abstract
The invention discloses a high-efficiency contact searching method of a handheld device, belonging to the field of information technology processing. The method comprises the following steps of: (1) establishing a backward character searching table and a numeric keypad mapping table; (2) decompounding contact names in an address list to acquire a punctuation S, a continuous letter string L and a character C in the names, reading the letter spelling string (L1, L2, ......, Ln) of the characters and storing into sequential nodes in a list structure; (3) matching name decompounding results stored in the list table with a filter character strings input by a user; and (4) returning contacts containing match information and obtaining a matched contact list. Compared with the prior art, the invention has the advantages of searching a contact with the handheld device by directly pressing numeric keys and also acquiring a matching result of intelligent search so that a user is convenient to continuously input characters for more accurately searching.
Description
Technical field
The present invention relates to a kind of high-efficiency contact searching method of handheld device, belong to the Information Technology Agreement field.The present invention can realize that handheld device searches the contact person by directly pressing numerical key, provides simultaneously the matching result of intellectual search, searches more accurately to make things convenient for the user to continue input character.
Background technology
Now mobile phone industry development is swift and violent, and mobile phone has become indispensable in a people's daily life important mobile device.Yet be subjected to physical size limitations, mobile-phone manufacturers often adopt the physics numeric keypad to reduce the space of keyboard grabbing.The dummy keyboard that also has many touch-screen mobile phones to provide also is suitable for the layout of numeric keypad, makes things convenient for the user to click.When numeric keypad was inputted, various language generally were mapped to alphabet on ten numerals of 0-9, switch between letter by the adopting consecutive click chemical reaction digital keys.Also have many language (for example Chinese character) can not pass through the direct input character of numeric keypad, also need to use local input method to carry out a conversion.
Be subjected to the impact of this kind numeric keypad input mode, also must repeatedly click the letter that a numerical key selection will be inputted based on the searching contact person of letter input, then use this letter to carry out contact person's name is searched.For example search " Steven " in english-speaking environment, the user must press continuously four times numerical keys ' 7 ' and select letter ' S ', and inputting whole word need to be by 14 button.Numeric keypad searching contact person mode seriously restricts contact person's seek rate.In addition, traditional mode of searching only can sort the name of Search Results according to the contact person, if front several characters of name are identical, the user must input more character and could accurately find and want the contact person that finds.
Summary of the invention
For the technical matters that exists in the prior art, the object of the present invention is to provide a kind of high-efficiency contact searching method of handheld device.This programme directly adopts input digit that the contact person is searched.When searching, mapping will list possible monogram corresponding to numeral according to numeric keypad automatically, then use monogram that the contact person is filtered; Also use simultaneously the numeral of input that contact person's phone number is searched.This programme also uses matching degree and contact frequency that Search Results is carried out intelligent sequencing, to improve the accuracy of search.The letter of the highlighted demonstration coupling of Search Results makes things convenient for the user to continue input digit or the deletion numeral is further searched.
Technical scheme of the present invention is:
A kind of high-efficiency contact searching method of handheld device the steps include:
1) sets up that a character is counter tables look-up, be used for preserving and convert the character that letter could be inputted to; Wherein, a character is provided with one or more letter spelling strings;
2) set up a numeric keypad mapping table, be used for preserving the corresponding relation between letter and the keyboard digital;
3) utilize counter the tabling look-up of described character that the name of contact person in the address list is decomposed, obtain the punctuation mark S in the name, continuous alphabetic string L, character C and letter spelling string (L1, L2 .., and decomposition result is saved in the order node of a list structure Ln); Concrete grammar is:
31) obtain each character in the name, if current character is a letter, add it to alphabetic string buffer memory, otherwise the buffer memory letter adds in the order node as an alphabetic string node;
32) if current character is spell-able character, then current character is added to a character nodes; Obtain simultaneously the letter spelling string of current character, and add each letter spelling string to an alphabetic string node; At last character nodes and alphabetic string node are added in the branch node, and this branch node is added in the order node;
33) if current character is the character of None-identified, then it is used as punctuation mark and adds in the order node as a character nodes separately;
4) utilize described numeric keypad mapping table that the filtration character string of the name decomposition result of storing in the chained list and user's input is mated;
The child node of 41) will order storing in the node is mated with the filtration character string of user's input successively, and the status information of each child node and the coupling of filtering string in the record order node; Wherein, if current child node is character nodes, then the character with its storage directly compares with filtration string current character, if alphabetic string node, then letter and the letter with its storage compares with filtration string current character respectively corresponding to the numeral on the numeric keypad, if branch node, then character nodes or the alphabetic string node with its storage compares with filtering the string current character, if having a node matching success just think branch node with filter the string coupling;
42) character that uses next child node and remainder to filter string continues coupling, if can match the ending of filtration character string, the match is successful then to think this, and it fails to match otherwise think this;
5) return the contact person who comprises match information, the contacts list that obtains mating.
Further, the anti-field of tabling look-up of described character comprises: file type sign, spelling string buffer memory storage reference position, character nodes memory location, character nodes number hereof hereof.
Further, the status information of described coupling comprises: the position of child node in the order node, the branch location of branch node, child node and the state that filters string matching.
Further, described character nodes is arranged from small to large according to the Unicode value of character; Adopt the binary search method to search current character at the letter spelling string of the anti-middle correspondence of tabling look-up of described character; Adopt canonical grammar to be expressed as the name decomposition result: SL (C|L1|L2|..|Ln).
Further, the matching result in the matching associated person is carried out highlighted demonstration, and calculates matching accuracy, according to matching accuracy to search results ranking.
Further, the method for calculating described matching accuracy is:
1) each node in the node strings after traversal is resolved is 0 if the present node coupling is just returned the coupling degree of accuracy, is 1 otherwise return the coupling degree of accuracy;
2) will mate the degree of accuracy rreturn value and add up, the accuracy of the larger then coupling of accumulated value is lower, otherwise matching degree is higher;
3) will mate degree of accuracy is saved in the matching result.
Further, sort according to the contacts list of matching result to coupling, its method is: at first according to the coupling degree of accuracy matching associated person is carried out ascending sort; Then carry out descending sort for the identical contact person of coupling degree of accuracy according to the contact frequency, sort according to name for the contact person of identical match degree of accuracy with identical contact frequency at last.
Compared with prior art, good effect of the present invention is:
1. accept the direct input digit of user, use numeral according to keyboard map to searching contact person;
2. when searching the contact person, except to also subscriber phone number being carried out the name look-up;
3. add up the matching accuracy of searching, sort to filtering rear contact person according to matching accuracy and contact frequency;
4. the alphabetical matching result of highlighted demonstration makes things convenient for the user to continue input;
Description of drawings
Fig. 1: the inventive method process flow diagram;
Fig. 2: use the numeric keyboard of mobile telephone searching contact person.
Embodiment
Below in conjunction with accompanying drawing the specific embodiment of the present invention is described in detail, method flow of the present invention as shown in Figure 1.
1. for the character that needs to convert to letter in the literal and could input, set up that character is counter and table look-up (SpellTable).A character may have a plurality of letter spelling strings, can use binary search to accelerate seek rate according to storage after the character ordering.Omit this step for the language that does not need to spell conversion.
Form 1: character is counter tables look-up
| Character 1 | Letter spelling string 1 |
| Character 1 | Letter spelling string 2 |
| Character 2 | Letter spelling string 3 |
Set up that character is counter tables look-up, be kept in the binary file.File structure is as follows:
File header SpellTableFileHead is used for identification spelling string cache location and character nodes position and number.And then storing the spelling string in the file header back, then is store character node (CharNode).Character nodes is arranged from small to large according to the Unicode value of character, binary search easy to use.
2. numeric keypad mapping table (LetterTable) set up in letter, be used for the coupling of numeric string and alphabetic string, a plurality of letters may corresponding numeral.
Form 2: alphanumeric keyboard mapping table
| Letter 1 | Numeral 1 |
| Letter 2 | Numeral 2 |
| Letter 3 | Numeral 3 |
Numeric keypad alphabetical fewer directly uses array to preserve, and searches and can use sequential search.
3. name of contact person is decomposed into the letter spelling string (L1, L2 .., Ln) of punctuation mark (S), continuous alphabetic string (L), character (C) and reading character, uses canonical grammar to be expressed as: SL (C|L1|L2|..|Ln).Decomposition result is stored in the order node (Sequence) of list structure.Also can use identical algorithm during the contact phone number search.
The name decomposition algorithm is as follows:
A. obtain each character in the name
B. if a letter adds it to alphabetic string buffer memory, if not letter with existing alphabetical buffer memory as an alphabetic string node, add in the order node (Sequence).
C. if spell-able character adds this character to a character nodes.Obtain simultaneously the letter spelling string of this character, and add each letter spelling string to an alphabetic string node.At last character nodes and alphabetic string node are added in the branch node,, and this branch node added in order node (Sequence).
D. the character of None-identified being used as punctuation mark adds in the order node (Sequence) as a character nodes separately.
Counter the looking into of character spelling used the up-and-down boundary of binary search designated character in the character list array, will spell string pointer and be stored in the parameter s pells array, returns actual spelling string number.
4. the child node of storing in the use order node is mated with the original filtration character string of user's input successively.Character nodes can directly compare its store character and filtration string.The alphabetic string node uses fuzzy comparison algorithm and filtration string to compare.Branch node compares the character nodes of its storage or alphabetic string node with filtering string, if having a node matching success just think branch node with filter the string coupling.Then the status information of each child node and the coupling of filtering string in the record order node is used next child node and remainder to filter string and is continued to mate in the matching process.If can match the ending of filtering character string, the match is successful to think this, and it fails to match otherwise think this.
4.1 alphabetic string filter algorithm:
If a. state is greater than 1, relatively mistake has been described, but has inquired about unsuccessfully, need letter of rollback again to compare.
B. if not MATCH_INIT (value is-1), illustrate that all trials all fail.
C. then use fuzzy matching algorithm that alphabetic string and filtration character string each character are from left to right compared.
D. return the length of coupling, if 0 expression is not mated.
// alphabetic string matching algorithm:
4.11 alphabetical fuzzy matching algorithm:
If a. letter equates with filtration string character, the match is successful, returns true.
B. search letter in numeral corresponding to numeric keypad (seeing 4.1.2), if should numeral equate with the filtration character, just think and filter character and letter coupling, return true.
C. otherwise think the coupling attempt unsuccessfully returning false.
4.1.2 use the sequential search algorithm to find the numeral of letter correspondence on keyboard:
4.2 character match algorithm: only have for the first time coupling and filter character when equating with current character, praise coupling, return matching length 1, otherwise think that it fails to match, return 0.
int?CharBlock::match(const?wchar_t*filter，int&?state){
return(state＝＝MATCH_INIT?&&?mChar＝＝*filter)？1:0；
}
4.3 record node matching status data comprises: the position of child node in the order node, child node and the state that filters string matching (state is greater than the length that represented in 0 o'clock to mate).
5. obtain the result of coupling.If the order node with filter the string matching success, obtain respectively character nodes, alphabetic string node and the compatible portion of filtering string according to the matching status data of preserving and compatible portion not, and matching accuracy.
Obtain the algorithm of matching result:
If a. current alphabetic string node and character string are not mated (state for-1), add whole alphabetic string to matching result as compatible portion not.
If b. coupling is added respectively compatible portion and non-compatible portion to matching result respectively.
Character nodes is also added in the matching result.
void?CharBlock::getContent(Result&result，int?state)const{
result.append(&mChar，1，state！＝MATCH_INIT)；
}
Obtain the degree of accuracy of coupling:
A. each node of the node strings (Sequence) after traversal is resolved if present node coupling (state＞0) just returns 0, otherwise (state==MATCH_INIT) returns 1.
B. will mate the degree of accuracy rreturn value and add up, accumulated value more just thinks that the accuracy of coupling is lower, otherwise just thinks that matching degree is higher.
C. will mate degree of accuracy is saved in the matching result.
// obtain the degree of accuracy of coupling, the less expression of return results is more accurate, is convenient to cumulative statistics.
int?LetterBlock::getAccuracy(int?state)const{
return(state＝＝MATCH_INIT)；
}
6. intelligent sequencing.According to matching accuracy, contact frequency, name of contact person, the contact phone number four dimensions sorts with filter result.The calculating of contact frequency uses a cumulative note record message registration number to obtain.
Priority algorithm is as follows as a result to compare two:
More whether what a. mate is number, the result of number of matches is come coupling name result's back.
B. comparison match degree, the result that value is less comes the front.
C. relatively contact frequency, with value larger come the front.
D. last name relatively, character participates in relatively according to its first spelling alphabetic string, and the character that can not obtain the spelling string uses its Unicode value to compare.
7. highlighted demonstration matching result.Show the compatible portion of name of contact person filter result is highlighted, make things convenient for the user to continue input character or numeral is further filtered.
Fig. 2 adopts the inventive method to carry out an instantiation of searching contact person process.
Key word
Letter: letter, but layout can the adopting consecutive click chemical reaction numeral be inputted to numeric keypad.
Character: character, " char " herein refer to can not directly input by keyboard in the literal, input but can convert specific alphabetic string to, need the input method support.Such as the Chinese character in the Chinese.
Letter spelling string: spell, the particular letter sequence that input character needs.Such as the phonetic in the Chinese character, stroke, phonetic notation, Cangjie, the assumed name pronunciation in the Japanese etc.
Claims (7)
1. a high-efficiency contact searching method of handheld device the steps include:
1) sets up that a character is counter tables look-up, be used for preserving and convert the character that letter could be inputted to; Wherein, a character is provided with one or more letter spelling strings;
2) set up a numeric keypad mapping table, be used for preserving the corresponding relation between letter and the keyboard digital;
3) utilize counter the tabling look-up of described character that the name of contact person in the address list is decomposed, obtain the punctuation mark S in the name, continuous alphabetic string L, character C and letter spelling string (L1, L2 .., and decomposition result is saved in the order node of a list structure Ln); Concrete grammar is:
31) obtain each character in the name, if current character is a letter, add it to alphabetic string buffer memory, otherwise the buffer memory letter adds in the order node as an alphabetic string node;
32) if current character is spell-able character, then current character is added to a character nodes; Obtain simultaneously the letter spelling string of current character, and add each letter spelling string to an alphabetic string node; At last character nodes and alphabetic string node are added in the branch node, and this branch node is added in the order node;
33) if current character is the character of None-identified, then it is used as punctuation mark and adds in the order node as a character nodes separately;
4) utilize described numeric keypad mapping table that the filtration character string of the name decomposition result of storing in the chained list and user's input is mated; Concrete grammar is:
The child node of 41) will order storing in the node is mated with the filtration character string of user's input successively, and the status information of each child node and the coupling of filtering string in the record order node; Wherein, if current child node is character nodes, then the character with its storage directly compares with filtration string current character, if alphabetic string node, then letter and the letter with its storage compares with filtration string current character respectively corresponding to the numeral on the numeric keypad, if branch node, then character nodes or the alphabetic string node with its storage compares with filtering the string current character, if having a node matching success just think branch node with filter the string coupling;
42) character that uses next child node and remainder to filter string continues coupling, if can match the ending of filtration character string, the match is successful then to think this, and it fails to match otherwise think this;
5) return the contact person who comprises match information, the contacts list that obtains mating.
2. the method for claim 1 is characterized in that the anti-field of tabling look-up of described character comprises: file type sign, spelling string buffer memory storage reference position, character nodes memory location, character nodes number hereof hereof.
3. the method for claim 1 is characterized in that the status information of described coupling comprises: the position of child node in the order node, the branch location of branch node, child node and the state that filters string matching.
4. the method for claim 1 is characterized in that described character nodes arranges from small to large according to the Unicode value of character; Adopt the binary search method to search current character at the letter spelling string of the anti-middle correspondence of tabling look-up of described character; Adopt canonical grammar to be expressed as the name decomposition result: SL (C|L1|L2|..|Ln).
5. the method for claim 1 is characterized in that the matching result in the matching associated person is carried out highlighted demonstration, and calculates matching accuracy, according to matching accuracy to search results ranking.
6. method as claimed in claim 5 is characterized in that the method for calculating described matching accuracy is:
1) each node in the node strings after traversal is resolved is 0 if the present node coupling is just returned the coupling degree of accuracy, is 1 otherwise return the coupling degree of accuracy;
2) will mate the degree of accuracy rreturn value and add up, the accuracy of the larger then coupling of accumulated value is lower, otherwise matching degree is higher;
3) will mate degree of accuracy is saved in the matching result.
7. method as claimed in claim 6 is characterized in that sorting according to the contacts list of matching result to coupling, and its method is: at first according to the coupling degree of accuracy matching associated person is carried out ascending sort; Then carry out descending sort for the identical contact person of coupling degree of accuracy according to the contact frequency, sort according to name for the contact person of identical match degree of accuracy with identical contact frequency at last.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010106078711A CN102063482B (en) | 2010-12-27 | 2010-12-27 | High-efficiency contact searching method of handheld device |
| PCT/CN2011/070054 WO2012088772A1 (en) | 2010-12-27 | 2011-01-06 | Method for efficiently searching for contact with hand-held device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010106078711A CN102063482B (en) | 2010-12-27 | 2010-12-27 | High-efficiency contact searching method of handheld device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102063482A CN102063482A (en) | 2011-05-18 |
| CN102063482B true CN102063482B (en) | 2013-03-06 |
Family
ID=43998758
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010106078711A Expired - Fee Related CN102063482B (en) | 2010-12-27 | 2010-12-27 | High-efficiency contact searching method of handheld device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102063482B (en) |
| WO (1) | WO2012088772A1 (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102737105A (en) * | 2012-03-31 | 2012-10-17 | 北京小米科技有限责任公司 | Dict-tree generation method and searching method |
| CN102710854A (en) * | 2012-05-18 | 2012-10-03 | 惠州Tcl移动通信有限公司 | Method and mobile terminal for fast matching dialing of Android system |
| CN105450830A (en) * | 2014-08-05 | 2016-03-30 | 无锡买卖宝信息技术有限公司 | Contact person searching method and device |
| US11394822B2 (en) | 2015-05-01 | 2022-07-19 | Vyng Inc. | Incentivising answering call in smartphone lockscreen |
| US11394823B2 (en) | 2015-05-01 | 2022-07-19 | Vyng Inc. | Configuring business application for utilization of sender controlled media service |
| US11394821B2 (en) | 2015-05-01 | 2022-07-19 | Vyng Inc. | Curated search of entities from dial pad selections |
| WO2021030419A1 (en) * | 2019-08-12 | 2021-02-18 | Vyng, Inc. | Methods and systems for management of media content associated with message context on mobile computing devices |
| US11451659B2 (en) | 2015-05-01 | 2022-09-20 | Vyng Inc. | Dynamic rewardable activity value determination and allocation |
| US11394824B2 (en) | 2015-05-01 | 2022-07-19 | Vyng Inc. | Adjusting presentation on smart phone lockscreen of visual content associated with metadata of incoming call |
| CN111159490B (en) * | 2019-12-13 | 2023-05-26 | 杭州迪普科技股份有限公司 | Method, device and equipment for processing pattern character strings |
| CN112765422B (en) * | 2021-01-18 | 2024-04-05 | 深轻(上海)科技有限公司 | Table lookup method for two-dimensional data table |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1852345A (en) * | 2005-04-22 | 2006-10-25 | 英华达(上海)电子有限公司 | Telephone number intelligent inquiry method for mobile phone directory |
| CN101676911A (en) * | 2008-09-18 | 2010-03-24 | 深圳富泰宏精密工业有限公司 | Contact person searching system and method |
| CN101741948A (en) * | 2008-11-19 | 2010-06-16 | 龙旗科技(上海)有限公司 | Method for automatically matching inputted digits with contact persons for information receiver |
| CN101888427A (en) * | 2009-05-12 | 2010-11-17 | 中国移动通信集团公司 | Method for matching dialing name and terminal |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1331448A (en) * | 2000-06-23 | 2002-01-16 | 王林 | Information input method with numeral keyboard |
| US20050114312A1 (en) * | 2003-11-26 | 2005-05-26 | Microsoft Corporation | Efficient string searches using numeric keypad |
| CN101853280B (en) * | 2010-05-19 | 2012-07-04 | 北京友录在线科技发展有限公司 | Method for searching for contacts in hand-held equipment |
| CN101833381B (en) * | 2010-05-19 | 2012-03-21 | 北京友录在线科技发展有限公司 | Pinyin reverse-tracing method for address list of handheld device |
-
2010
- 2010-12-27 CN CN2010106078711A patent/CN102063482B/en not_active Expired - Fee Related
-
2011
- 2011-01-06 WO PCT/CN2011/070054 patent/WO2012088772A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1852345A (en) * | 2005-04-22 | 2006-10-25 | 英华达(上海)电子有限公司 | Telephone number intelligent inquiry method for mobile phone directory |
| CN101676911A (en) * | 2008-09-18 | 2010-03-24 | 深圳富泰宏精密工业有限公司 | Contact person searching system and method |
| CN101741948A (en) * | 2008-11-19 | 2010-06-16 | 龙旗科技(上海)有限公司 | Method for automatically matching inputted digits with contact persons for information receiver |
| CN101888427A (en) * | 2009-05-12 | 2010-11-17 | 中国移动通信集团公司 | Method for matching dialing name and terminal |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102063482A (en) | 2011-05-18 |
| WO2012088772A1 (en) | 2012-07-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102063482B (en) | High-efficiency contact searching method of handheld device | |
| CN107704102B (en) | Text input method and device | |
| CN102982021B (en) | For eliminating the method for the ambiguity of the multiple pronunciations in language conversion | |
| CN107145571B (en) | Searching method and device | |
| CN1184969A (en) | Method and device for input of text messages from keypad | |
| CN101313271A (en) | Improved process and apparatus for selecting an item from a database | |
| CN110083683B (en) | Entity semantic annotation method based on random walk | |
| KR102220894B1 (en) | a communication typed question and answer system with data supplying in statistic database | |
| CN107526721B (en) | Ambiguity elimination method and device for comment vocabularies of e-commerce products | |
| CN112270188A (en) | Questioning type analysis path recommendation method, system and storage medium | |
| WO2020037794A1 (en) | Index building method for english geographical name, and query method and apparatus therefor | |
| CN112667775A (en) | Keyword prompt-based retrieval method and device, electronic equipment and storage medium | |
| CN106844512B (en) | Intelligent question and answer method and system | |
| CN112328773A (en) | Knowledge graph-based question and answer implementation method and system | |
| CN114842982B (en) | Knowledge expression method, device and system for medical information system | |
| CN103186247A (en) | Formula input method and system | |
| CN115130455A (en) | Article processing method and device, electronic equipment and storage medium | |
| CN115713078A (en) | Knowledge graph construction method and device, storage medium and electronic equipment | |
| TW200947241A (en) | Database indexing algorithm and method and system for database searching using the same | |
| CN103064531A (en) | Terminal and input method | |
| CN109727591B (en) | Voice search method and device | |
| CN108595584B (en) | Chinese character output method and system based on digital marks | |
| CN101894127A (en) | Intelligent arranging and searching method for mobile phone contact | |
| CN112632264A (en) | Intelligent question and answer method and device, electronic equipment and storage medium | |
| CN112965998A (en) | Compound database establishing and searching method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 100081 Beijing city Haidian District Zizhuyuan Road No. 5 Guangyuan Guangyuan Gate Building 3 room 321B Patentee after: Very excellent (Beijing) Technology Development Co.,Ltd. Address before: 100081 Beijing city Haidian District Zizhuyuan Road No. 5 Guangyuan Guangyuan Gate Building 3 room 321B Patentee before: Micro-blog talent (Beijing) Technology Development Co.,Ltd. Address after: 100081 Beijing city Haidian District Zizhuyuan Road No. 5 Guangyuan Guangyuan Gate Building 3 room 321B Patentee after: Micro-blog talent (Beijing) Technology Development Co.,Ltd. Address before: 100081 Beijing city Haidian District Zizhuyuan Road No. 5 Guangyuan Guangyuan Gate Building 3 room 321B Patentee before: Micro network (Beijing) Technology Development Co.,Ltd. |
|
| CP03 | Change of name, title or address |
Address after: 100081 Beijing city Haidian District Zizhuyuan Road No. 5 Guangyuan Guangyuan Gate Building 3 room 321B Patentee after: Micro network (Beijing) Technology Development Co.,Ltd. Address before: 100027, Dongcheng District, Beijing new West 13 boulder building, west five Patentee before: BEIJING YOULU ONLINE TECHNOLOGIES DEVELOPMENT Co.,Ltd. |
|
| CP03 | Change of name, title or address | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20130306 Termination date: 20191227 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |