CN112163007A - Method and system for quickly matching and searching contact persons - Google Patents
Method and system for quickly matching and searching contact persons Download PDFInfo
- Publication number
- CN112163007A CN112163007A CN202011036884.8A CN202011036884A CN112163007A CN 112163007 A CN112163007 A CN 112163007A CN 202011036884 A CN202011036884 A CN 202011036884A CN 112163007 A CN112163007 A CN 112163007A
- Authority
- CN
- China
- Prior art keywords
- pinyin
- search
- match
- letter
- effective
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 21
- 108700026244 Open Reading Frames Proteins 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2457—Query processing with adaptation to user needs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/248—Presentation of query results
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
- G06F3/02—Input arrangements using manually operated switches, e.g. using keyboards or dials
- G06F3/023—Arrangements for converting discrete items of information into a coded form, e.g. arrangements for interpreting keyboard generated codes as alphanumeric codes, operand codes or instruction codes
- G06F3/0233—Character input methods
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Human Computer Interaction (AREA)
- Document Processing Apparatus (AREA)
Abstract
The invention provides a method and a system for quickly matching and searching a contact person, which are characterized in that pinyin corresponding to all contact persons is analyzed, an effective fuzzy search combination of full pinyin and first pinyin of the pinyin and an effective fuzzy search position are analyzed, a corresponding search pinyin list is obtained, further traversal search is carried out in the search pinyin list according to the information of a search key, if the key can be matched with the search pinyin, whether the matching position is the effective matching position is judged, if the key and the search pinyin can be matched, the contact person is searched, fuzzy search of a matching algorithm is not needed to be carried out every time, and the searching speed is greatly accelerated.
Description
Technical Field
The invention relates to the technical field of input methods, in particular to a method and a system for quickly matching and searching contacts.
Background
With the development of informatization and the expansion of communication services, more and more information is contained in a personal address book, and particularly in vehicle-mounted applications, it becomes more and more important to quickly match and find out contacts required by a user from a large amount of contact book information. Similar products on the market also have various search algorithms, but also have some defects, such as storing all Chinese character pinyins corresponding to contacts in an address list, comparing with all the pinyins when a search key is input each time, finding out matched data, and storing the current matched data. When the key is continuously input, matching search is continuously carried out; the matching and searching method has very low efficiency and complex algorithm, and the searching is required to check whether the matching is continued from the last searched position or the matching is started from the initial position of the second Chinese character pinyin every time, so that the experience of a user is seriously influenced.
Disclosure of Invention
The invention provides a method and a system for quickly matching and searching contacts, which can quickly match and search the contacts through full spelling or first spelling, thereby accelerating the searching speed and improving the satisfaction degree of users.
Specifically, the method for quickly matching and searching for the contact person, provided by the invention, comprises the following steps:
s1: resolving pinyin corresponding to all the contact persons;
s2: analyzing the effective fuzzy search combination of the full spelling and the first spelling of the pinyin and the effective fuzzy search position to obtain a corresponding search pinyin list;
s3: traversing and searching in the search pinyin list according to the information of the search key, when the key is successfully matched in the effective fuzzy search combination, continuously judging whether the matched position belongs to the effective fuzzy search position, if so, finishing the search, and displaying the result; otherwise, prompting that the contact does not exist, and finishing the searching.
Wherein the S1 further includes:
judging whether the contact is in a Chinese coding region, if so, analyzing the corresponding pinyin of the contact according to the Chinese character Unicode coding; otherwise, the contact person is backed up to the Chinese coding area and analyzed.
The S2 further includes:
s21: splitting the pinyin into single pinyin and storing the pinyin in an array;
s22: and calculating the effective fuzzy search combination and the effective fuzzy search position according to the pinyin stored in the array.
Further, the effective fuzzy search combination comprises: and calculating corresponding effective search combinations according to the pinyin, wherein if the number of the pinyin is N, the number of the effective search combinations is N + 1.
The calculating the effective fuzzy search combination and the effective fuzzy search position further comprises: selecting a pinyin full-pinyin and first-pinyin combination according to the number of the pinyin; the method comprises the following steps:
full pinyin combination: searching for a valid position to match from the first position of the first pinyin; the first letter of the second pinyin begins to match; the first letter of the third pinyin begins to match;
the first letter combination: searching for a valid position to match from the first position of the first pinyin; the first letter of the second pinyin begins to match; the third letter starts to match; or searching the effective position to match from the first position of the first pinyin; the second letter starts to match; the first letter of the third pinyin begins to match; or the first letter begins to match; the second letter starts to match; the third letter starts to match.
Wherein, the key is capital and lowercase English letters.
Preferably, the present invention further provides a system for quickly matching and searching for a contact, including:
the input unit is used for acquiring the key information and inputting the contact information;
the resolving unit is used for resolving the pinyins corresponding to all the contact persons, resolving the effective fuzzy search combination of the full pinyin and the first pinyin of the pinyins and the effective fuzzy search position to obtain a corresponding search pinyin list and storing the corresponding search pinyin list in the memory;
the matching unit is connected with the input unit and used for traversing and searching in the search pinyin list according to the information of the search key, when the key is successfully matched in the effective fuzzy search combination, whether the matched position belongs to the effective fuzzy search position is continuously judged, if so, the search is finished, and the result is displayed; otherwise, prompting that the contact does not exist, and finishing the search;
and the display unit is respectively connected with the input unit and the matching unit and used for presenting the search result and displaying the input information of the input unit.
Wherein the combination of effective fuzzy search and the position of effective fuzzy search further comprises:
full pinyin combination: searching for a valid position to match from the first position of the first pinyin; the first letter of the second pinyin begins to match; the first letter of the third pinyin begins to match;
the first letter combination: searching for a valid position to match from the first position of the first pinyin; the first letter of the second pinyin begins to match; the third letter starts to match; or searching the effective position to match from the first position of the first pinyin; the second letter starts to match; the first letter of the third pinyin begins to match; or the first letter begins to match; the second letter starts to match; the third letter starts to match.
Further, the input unit also supports voice input, or keyboard input.
Furthermore, the system is installed at a vehicle-mounted user side or a mobile terminal of the mobile phone in an embedded mode.
In summary, the invention provides a method and a system for fast matching and searching for a contact, which are characterized in that pinyin corresponding to all contacts is analyzed, an effective fuzzy search combination of a full pinyin and a first pinyin of the pinyin and an effective fuzzy search position are analyzed, a corresponding search pinyin list is obtained, further traversal search is performed in the search pinyin list according to the information of a search key, if the key can be matched with the search pinyin, whether the matching position is the effective matching position is judged, if the key and the search pinyin can be matched, the contact is searched for, and fuzzy search of a matching algorithm is not needed to be performed every time when the key and the search pinyin can be matched, so that the search speed is greatly increased.
Drawings
FIG. 1 is a flowchart of a method for fast match lookup of contacts in an embodiment.
FIG. 2 is a diagram of a system for fast matching lookup contacts, under an embodiment.
Detailed Description
The following describes a method and a system for fast matching and searching for a contact according to the present invention in detail with reference to the following embodiments and accompanying drawings.
Fig. 1 shows that the present invention provides a method for quickly matching and searching for a contact, which includes the following steps:
s1: resolving pinyin corresponding to all the contact persons;
s2: analyzing the effective fuzzy search combination of the full spelling and the first spelling of the pinyin and the effective fuzzy search position to obtain a corresponding search pinyin list;
s3: traversing and searching in the search pinyin list according to the information of the search key, when the key is successfully matched in the effective fuzzy search combination, continuously judging whether the matched position belongs to the effective fuzzy search position, if so, finishing the search, and displaying the result; otherwise, prompting that the contact does not exist, and finishing the searching.
The keys are capital and lowercase English letters
Wherein the S1 further includes:
judging whether the contact is in a Chinese coding region, if so, analyzing the corresponding pinyin of the contact according to the Chinese character Unicode coding; otherwise, the contact person is backed up to the Chinese coding area and analyzed.
The S2 further includes:
s21: splitting the pinyin into single pinyin and storing the pinyin in an array;
s22: and calculating the effective fuzzy search combination and the effective fuzzy search position according to the pinyin stored in the array.
For example, if a contact person has one or two, zhang, yi and er are stored in a vertor array; and calculating an effective fuzzy search combination according to the pinyin stored by the vertor, wherein the effective fuzzy search positions are as follows:
a. zhangyier, effectively starts to match positions [0, 5, 7 ].
Zhangyie, effectively begin matching positions [0, 5, 7 ].
Zhangye, effective starting matching position [0, 5, 6]
Z ye, effective starting matching position [0, 1, 2]
That is, the number of pinyin corresponding to each contact name is n, and the pinyin combination which can be matched and searched is n +19 full pinyin + the first pinyin of the last pinyin is decreased in sequence each time.
Preferably, the following calculation method is adopted for calculation:
setting v [0] = "zhang", v [1] = "yi", v [2] = "er";
the method comprises the following steps of taking pinyin full pinyin and first pinyin combinations according to the number of pinyin, and specifically comprising the following steps:
full pinyin combination: searching for a valid position to match from the first position of the first pinyin; the first letter of the second pinyin begins to match; the first letter of the third pinyin begins to match;
the first letter combination: searching for a valid position to match from the first position of the first pinyin; the first letter of the second pinyin begins to match; the third letter starts to match; or searching the effective position to match from the first position of the first pinyin; the second letter starts to match; the first letter of the third pinyin begins to match; or the first letter begins to match; the second letter starts to match; the third letter starts to match.
For example: direct pinyin combination: v 0 + v 1 + v 2, searching effective position from the first position of the first pinyin for matching; the first letter of the second pinyin begins to match; the first letter of the third pinyin begins to match, i.e., [0, v [0]. length, v [0]. length + v [1]. length ].
The combination of the full pinyin and the first letter: v [0] + v [1] + v [2]. at (0), first pinyin + second pinyin + third pinyin initial, valid search location [0, v [0] length + v [1] length ].
v [0] + v [1]. at (0) + v [2]. at (0) first pinyin + second pinyin initial + third pinyin initial, effective search location [0, v [0] length + v [1] at (0) length ].
v [0] at (0) + v [1] at (0) + v [2] at (0) first pinyin initial + second pinyin initial + third pinyin initial, effective search position [0, v [0] at (0) length + v [1] at (0) length.
As another preferred embodiment, the present invention further provides a system for fast matching and searching for a contact (as shown in fig. 2), including:
the input unit is used for acquiring the key information and inputting the contact information;
the resolving unit is used for resolving the pinyins corresponding to all the contact persons, resolving the effective fuzzy search combination of the full pinyin and the first pinyin of the pinyins and the effective fuzzy search position to obtain a corresponding search pinyin list and storing the corresponding search pinyin list in the memory;
the matching unit is connected with the input unit and used for traversing and searching in the search pinyin list according to the information of the search key, when the key is successfully matched in the effective fuzzy search combination, whether the matched position belongs to the effective fuzzy search position is continuously judged, and if the matched position belongs to the effective fuzzy search position, the search is finished; otherwise, prompting that the contact does not exist, and finishing the search;
and the display unit is respectively connected with the input unit and the matching unit and used for presenting the search result and displaying the input information of the input unit.
Wherein the input unit also supports voice input, or keyboard input.
Furthermore, the system of the invention can be installed at a vehicle-mounted user end or a mobile end of a mobile phone in an embedded mode.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. A method for searching contacts through quick matching is characterized by comprising the following steps:
s1: resolving pinyin corresponding to all the contact persons;
s2: analyzing the effective fuzzy search combination of the full spelling and the first spelling of the pinyin and the effective fuzzy search position to obtain a corresponding search pinyin list;
s3: traversing and searching in the search pinyin list according to the information of the search key, when the key is successfully matched in the effective fuzzy search combination, continuously judging whether the matched position belongs to the effective fuzzy search position, if so, finishing the search, and displaying the result; otherwise, prompting that the contact does not exist, and finishing the searching.
2. The method of claim 1, wherein the S1 further comprises:
judging whether the contact is in a Chinese coding region, if so, analyzing the corresponding pinyin of the contact according to the Chinese character Unicode coding; otherwise, the contact person is backed up to the Chinese coding area and then analyzed.
3. The method of claim 1, wherein the S2 further comprises:
s21: splitting the pinyin into single pinyin and storing the pinyin in an array;
s22: and calculating the effective fuzzy search combination and the effective fuzzy search position according to the pinyin stored in the array.
4. The method of claim 3, wherein the valid fuzzy lookup combining comprises: and calculating corresponding effective search combinations according to the pinyin, wherein if the number of the pinyin is N, the number of the effective search combinations is N + 1.
5. The method of claim 3, wherein said computing said valid fuzzy search combination and valid fuzzy search position further comprises: selecting a pinyin full-pinyin and first-pinyin combination according to the number of the pinyin; the method comprises the following steps:
full pinyin combination: searching for a valid position to match from the first position of the first pinyin; the first letter of the second pinyin begins to match; the first letter of the third pinyin begins to match;
the first letter combination: searching for a valid position to match from the first position of the first pinyin; the first letter of the second pinyin begins to match; the third letter starts to match; or searching the effective position to match from the first position of the first pinyin; the second letter starts to match; the first letter of the third pinyin begins to match; or the first letter begins to match; the second letter starts to match; the third letter starts to match.
6. The method of claim 1, wherein the keys are upper and lower case english letters.
7. A system for fast match lookup of contacts, comprising:
the input unit is used for acquiring the key information and inputting the contact information;
the resolving unit is used for resolving the pinyins corresponding to all the contact persons, resolving the effective fuzzy search combination of the full pinyin and the first pinyin of the pinyins and the effective fuzzy search position to obtain a corresponding search pinyin list and storing the corresponding search pinyin list in the memory;
the matching unit is connected with the input unit and used for traversing and searching in the search pinyin list according to the information of the search key, when the key is successfully matched in the effective fuzzy search combination, whether the matched position belongs to the effective fuzzy search position is continuously judged, if so, the search is finished, and the result is displayed; otherwise, prompting that the contact does not exist, and finishing the search;
and the display unit is respectively connected with the input unit and the matching unit and used for presenting the search result and displaying the input information of the input unit.
8. The system of claim 7, further comprising, the valid fuzzy search combination, and valid fuzzy search location, further comprising:
full pinyin combination: searching for a valid position to match from the first position of the first pinyin; the first letter of the second pinyin begins to match; the first letter of the third pinyin begins to match;
the first letter combination: searching for a valid position to match from the first position of the first pinyin; the first letter of the second pinyin begins to match; the third letter starts to match; or searching the effective position to match from the first position of the first pinyin; the second letter starts to match; the first letter of the third pinyin begins to match; or the first letter begins to match; the second letter starts to match; the third letter starts to match.
9. The system of claim 7, wherein the input unit further supports voice input, or keyboard input.
10. The system of claim 7, wherein the system is installed at a vehicle-mounted user end or a mobile end of a mobile phone in an embedded manner.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011036884.8A CN112163007B (en) | 2020-09-28 | 2020-09-28 | Method and system for quickly matching and searching contacts |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011036884.8A CN112163007B (en) | 2020-09-28 | 2020-09-28 | Method and system for quickly matching and searching contacts |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112163007A true CN112163007A (en) | 2021-01-01 |
| CN112163007B CN112163007B (en) | 2023-11-17 |
Family
ID=73861688
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011036884.8A Active CN112163007B (en) | 2020-09-28 | 2020-09-28 | Method and system for quickly matching and searching contacts |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112163007B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030048207A1 (en) * | 2001-09-06 | 2003-03-13 | Xerox Corporation | Sliding window compression method utilizing compression hotspots |
| CN101369215A (en) * | 2008-09-28 | 2009-02-18 | 宇龙计算机通信科技(深圳)有限公司 | Contact person positioning method, system and mobile communication terminal |
| CN101566989A (en) * | 2008-04-23 | 2009-10-28 | 中国电信股份有限公司 | Method and system for converting information querying codes into Chinese characters |
| CN102737105A (en) * | 2012-03-31 | 2012-10-17 | 北京小米科技有限责任公司 | Dict-tree generation method and searching method |
| CN103294776A (en) * | 2013-05-13 | 2013-09-11 | 浙江大学 | Smartphone address book fuzzy search method |
| US20140019718A1 (en) * | 2012-07-10 | 2014-01-16 | Shihjong J. Kuo | Vectorized pattern searching |
| CN103617204A (en) * | 2013-11-15 | 2014-03-05 | 福建星网锐捷通讯股份有限公司 | Contact fast searching method based on android system |
| CN104699775A (en) * | 2015-03-10 | 2015-06-10 | 广州市久邦数码科技有限公司 | Contact person dialing searching method and system thereof for mobile terminal |
| CN105915685A (en) * | 2016-06-02 | 2016-08-31 | 重庆神指奇动网络有限公司 | Intelligent mobile phone dialing method and system |
| CN106959962A (en) * | 2016-01-12 | 2017-07-18 | 中国移动通信集团青海有限公司 | A kind of multi-pattern match method and apparatus |
-
2020
- 2020-09-28 CN CN202011036884.8A patent/CN112163007B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030048207A1 (en) * | 2001-09-06 | 2003-03-13 | Xerox Corporation | Sliding window compression method utilizing compression hotspots |
| CN101566989A (en) * | 2008-04-23 | 2009-10-28 | 中国电信股份有限公司 | Method and system for converting information querying codes into Chinese characters |
| CN101369215A (en) * | 2008-09-28 | 2009-02-18 | 宇龙计算机通信科技(深圳)有限公司 | Contact person positioning method, system and mobile communication terminal |
| CN102737105A (en) * | 2012-03-31 | 2012-10-17 | 北京小米科技有限责任公司 | Dict-tree generation method and searching method |
| US20140019718A1 (en) * | 2012-07-10 | 2014-01-16 | Shihjong J. Kuo | Vectorized pattern searching |
| CN103294776A (en) * | 2013-05-13 | 2013-09-11 | 浙江大学 | Smartphone address book fuzzy search method |
| CN103617204A (en) * | 2013-11-15 | 2014-03-05 | 福建星网锐捷通讯股份有限公司 | Contact fast searching method based on android system |
| CN104699775A (en) * | 2015-03-10 | 2015-06-10 | 广州市久邦数码科技有限公司 | Contact person dialing searching method and system thereof for mobile terminal |
| CN106959962A (en) * | 2016-01-12 | 2017-07-18 | 中国移动通信集团青海有限公司 | A kind of multi-pattern match method and apparatus |
| CN105915685A (en) * | 2016-06-02 | 2016-08-31 | 重庆神指奇动网络有限公司 | Intelligent mobile phone dialing method and system |
Non-Patent Citations (5)
| Title |
|---|
| JIN WANG等: "An efficient sliding window approach for approximate entity extraction with synonyms", 《OPEN PROCEEDINGS》, pages 109 - 120 * |
| SAQIB IQBAL HAKAK等: "Exact String Matching Algorithms: Survey, Issues, and Future Research Directions", 《IEEE ACCESS》, vol. 7, pages 69614 - 69637, XP011728994, DOI: 10.1109/ACCESS.2019.2914071 * |
| 崔甲;王伟平;陈重韬;孟丹;: "基于滑动窗口的数据流字符串近似查询", 高技术通讯, no. 09, pages 895 - 902 * |
| 彭雨蒙: "基于序列比对的视频指纹检索算法研究", 《中国优秀硕士学位论文全文数据库 (信息科技辑)》, no. 03, pages 138 - 5918 * |
| 王一霈;石春;戴上静;吴刚;: "一种改进的针对中文编码的Wu-Manber多模式匹配算法", 小型微型计算机系统, no. 04, pages 778 - 781 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112163007B (en) | 2023-11-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9508028B2 (en) | Converting text strings into number strings, such as via a touchscreen input | |
| US20100131447A1 (en) | Method, Apparatus and Computer Program Product for Providing an Adaptive Word Completion Mechanism | |
| RU2377664C2 (en) | Text input method | |
| US8756527B2 (en) | Method, apparatus and computer program product for providing a word input mechanism | |
| JP5860171B2 (en) | Input processing method and apparatus | |
| US20050086234A1 (en) | Incremental search of keyword strings | |
| US7774334B2 (en) | Adaptive databases | |
| US20090198691A1 (en) | Device and method for providing fast phrase input | |
| US20130191112A1 (en) | Method for identifying language of text in a handheld electronic device and a handheld electronic device incorporating the same | |
| JP6122800B2 (en) | Electronic device, character string display method, and character string display program | |
| EP1281114A2 (en) | Constrained keyboard disambiguation using voice recognition | |
| US10666783B2 (en) | Method and apparatus for storing telephone numbers in a portable terminal | |
| KR101130206B1 (en) | Method, apparatus and computer program product for providing an input order independent character input mechanism | |
| KR20110048063A (en) | Display device and its display method | |
| EP2202612B1 (en) | Automatic language selection for improving text accuracy | |
| CN112163007A (en) | Method and system for quickly matching and searching contact persons | |
| US7496842B2 (en) | Apparatus and method for automatic spelling correction | |
| CN106708281B (en) | Character input device and character input method | |
| CN112987941B (en) | Method and device for generating candidate words | |
| US20190272089A1 (en) | Character input device, character input method, and character input program | |
| CA2661559C (en) | Method for identifying language of text in a handheld electronic device and a handheld electronic device incorporating the same | |
| JP3526821B2 (en) | Document search device | |
| CN113534973A (en) | Input method, input device and input device | |
| CN113743098A (en) | Input method and terminal based on cloud platform | |
| CN116226330A (en) | Special character recognition method, special character recognition device, electronic equipment and computer storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |