Character searching method and device of input method program, electronic equipment, computer readable storage medium and computer program product
By determining the string order and omission count of the query request in the input method program and querying candidate nodes from the index tree, the problem of low retrieval efficiency in the prior art is solved, and efficient fuzzy input string matching is achieved.
CN122331776APending Publication Date: 2026-07-03BEIJING SOGOU TECHNOLOGY DEVELOPMENT CO LTD
View PDF 0 Cites 0 Cited by
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- BEIJING SOGOU TECHNOLOGY DEVELOPMENT CO LTD
- Filing Date
- 2025-01-02
- Publication Date
- 2026-07-03
AI Technical Summary
Technical Problem
Existing input method programs need to sequentially traverse all string combinations in the dictionary in fuzzy input scenarios, resulting in low retrieval efficiency and frequent lag.
Method used
By obtaining the string order and omission count in the query request, the level is determined from multiple index trees of the first thesaurus, and candidate nodes that match the order and count are directly queried to determine the candidate strings to be output.
Benefits of technology
It significantly reduces the amount of data retrieved, improves retrieval efficiency, enhances conversion performance and user experience, reduces unnecessary node queries, and quickly locates the target string.
✦ Generated by Eureka AI based on patent content.
Smart Images
Figure CN122331776A_ABST
Abstract
The application provides a character search method and device of an input method program, an electronic device, a computer readable storage medium and a computer program product. The method comprises: obtaining a query request input in the input method program, wherein the query request comprises at least one character string and at least one wildcard, and each wildcard is used to replace at least one omitted character string; determining the order of a first character string in the query request and the first number of character strings omitted before the first character string; determining a level corresponding to the order from a plurality of index trees of a first word library, wherein each node of each level comprises an index character string and an index number; querying a first candidate node matching the first character string and the number from at least one node included in the level; and determining a first candidate character string to be output based on the first candidate node. Through the application, the retrieval efficiency in a fuzzy input scenario can be improved.
Need to check novelty before this filing date? Find Prior Art