Differential Indexing for Hyphenated Name Search Precision

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Database search systems face challenges in accurately ranking search results for hyphenated names, as they often separate the hyphenated words, leading to incorrect indexing and reduced search precision.

Innovation Solution

Implementing differential indexing, which creates two indexes: one for normalized tokens and another for tokens eliminated during normalization, allowing for a combined search query that accounts for both formats, thereby reducing duplication and improving search scoring and resource usage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If the database separates hyphenated words during normalization, then search coverage is improved, but search precision deteriorates

Engineering Contradiction:
Improvesearch coverageVSAvoidsearch precision
Core Design Contradiction:
Adaptability or versatilityVSMeasurement precision

Solution Approach 1:

The patent segments the indexing process into two distinct indexes: a first index containing normalized tokens with hyphenated words separated, and a second index containing tokens that were eliminated during normalization (the hyphenated words themselves). This segmentation allows the system to maintain both search coverage through the first index and search precision through the second index, resolving the contradiction between these two features.

Inventive Principle:
Principle #1Segmentation

2Loss of energy

If a single normalized index is used, then resource usage is reduced, but search quality for special cases deteriorates

Engineering Contradiction:
Improveresource usageVSAvoidsearch quality
Core Design Contradiction:
Loss of energyVSReliability

Solution Approach 1:

The patent divides the indexing resources into two specialized indexes rather than using one large general index. The first index handles normalized search terms while the second index handles eliminated tokens. This segmentation allows each index to be optimized for its specific purpose, improving search quality for special cases like hyphenated names while keeping resource usage reasonable through targeted indexing.

Inventive Principle:
Principle #1Segmentation

3Quantity of substance

If hyphenated words are stored as separate tokens, then index size is reduced, but information accuracy is lost

Engineering Contradiction:
Improveindex sizeVSAvoidinformation accuracy
Core Design Contradiction:
Quantity of substanceVSLoss of information

Solution Approach 1:

The patent extracts the hyphenated words that are eliminated during normalization and stores them separately in a second index. This extraction process preserves the original hyphenated form information that would otherwise be lost, while the first index still benefits from the space efficiency of normalized separate tokens. The result is reduced overall information loss while maintaining reasonable index size.

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS11210291B2Differential indexing for fast database search
Publication Date: 2021.12.28 MICROSOFT TECHNOLOGY LICENSING LLC
  • US11210291B2 patent drawing
  • US11210291B2 patent drawing
  • US11210291B2 patent drawing

AI summary

Methods, systems, and computer programs are presented for improving search speed and quality using differential indexing. One method includes an operation for building a first index for a database, the first index being for first tokens resulting from normalizing words in input data. Further, the method includes building a second index for the database, the second index being for second tokens comprising words of the input data eliminated from the first index during the normalizing. The method further includes operations for receiving a raw query for a search of the database, and for generating a search query based on tokens of the raw query. The search query comprises a combined search of the first index and the second index. A search is performed based on the search query, and results of the search are returned for presentation on a display.