Index Tree String Matching for Precision Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current full-text search systems are inefficient and imprecise when matching target strings to known strings, often providing overly fuzzy results and being slow due to their reliance on relative scores that are not intuitive.
Innovation Solution
Creating an index of known terms associated with known string IDs, allowing for fast and efficient matching of target strings by searching the index tree, where matching known terms are identified and their corresponding string IDs are counted to determine the best match based on occurrences.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If full-text search engines utilize fuzziness matching (linguistic matching), then matching flexibility is improved, but measurement precision deteriorates due to overly imprecise results
Solution Approach 1:
The patent segments the search process into two distinct phases: (1) building a deterministic index structure from known strings that enables exact matching, and (2) performing exact term matching queries against this index. This segmentation eliminates the need for fuzziness matching while maintaining adaptability through the index structure design, thereby resolving the contradiction between matching flexibility and result precision.
Solution Approach 2:
The patent changes the matching parameter from fuzzy/linguistic matching to exact term matching. By transforming the search mechanism to use exact matches against a pre-built index, the system achieves both adaptability (through the index structure that can accommodate various known strings) and precision (through exact matching without fuzziness), thus resolving the technical contradiction.
2Reliability
If full-text search engines perform comprehensive searching, then matching completeness is improved, but productivity deteriorates due to slow search speed
Solution Approach 1:
The patent applies preliminary action by pre-building an index structure from the known strings before any search operations. This index contains all possible term matches and their corresponding known string identifiers. When a query arrives, the system performs rapid exact matching against this pre-computed index, achieving both completeness (all matches are captured in the index) and high speed (no comprehensive searching needed at query time), thus resolving the contradiction between matching completeness and search speed.
3Adaptability or versatility
If full-text search engines use relative scoring for matched candidates, then adaptability is improved, but ease of operation deteriorates due to non-intuitive results
Solution Approach 1:
The patent uses copying by creating a deterministic index that copies the structure and relationships of known strings into a searchable format. Instead of computing relative scores that require interpretation, the system copies exact term matches and their associations into the index, returning intuitive results that directly reflect exact matches. This eliminates the need for users to interpret relative scores while maintaining system adaptability through the flexible index structure.
Data Source
AI summary
One or more techniques and/or systems are disclosed for matching a target string to a known string. A target string is broken into one or more target terms, and the one or more target terms are matched to known terms in an index tree. The index tree comprises one or more known terms from a plurality of known strings, where the respective known terms in the index tree are associated with one or more known string IDs. A known term that is associated with a known string ID (in the index tree, and to which a target term is matched), is comprised in a known string, which corresponds to the known string ID. The target string can be matched to the known string using the known string's corresponding known string ID that is associated with a desired number of occurrences in the matching of the one or more target terms.