Synonym Identification via Category Specificity and KL Divergence
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Systems that determine synonym substitutes based on query contexts often struggle with learning effective synonym rules for contexts that appear infrequently, such as smaller cities, due to lack of supporting evidence in query streams.
Innovation Solution
Identifying coherent categories from a knowledge base, calculating specificity values using probability distributions, and classifying categories as useful for synonym substitution by comparing co-occurrence and background probability distributions, with the Kullback-Leibler divergence as a metric.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If synonym substitution is performed based on frequent query contexts only, then synonym accuracy for common contexts is improved, but synonym coverage for infrequent contexts deteriorates
Solution Approach 1:
The patent segments the synonym identification process into two distinct phases: (1) learning phase using only frequent query contexts to establish reliable synonym relationships, and (2) application phase that extends these learned synonyms to infrequent contexts through category-based generalization. This segmentation allows the system to maintain high accuracy for common contexts while achieving broader coverage for rare contexts.
Solution Approach 2:
The patent introduces category information as an intermediary element that bridges frequent and infrequent query contexts. By identifying that entities belong to the same category (e.g., both San Francisco and Grey Bull are cities), the system can transfer synonym relationships from frequent contexts to infrequent contexts, thereby extending coverage without compromising accuracy.
2Adaptability or versatility
If category-based generalization is applied to all categories, then synonym coverage for infrequent contexts is improved, but synonym accuracy deteriorates due to inclusion of non-coherent categories
Solution Approach 1:
The patent applies local quality by differentiating between coherent and non-coherent categories. Instead of uniformly applying category-based generalization to all categories, the system selectively applies it only to coherent categories that have been validated through statistical analysis (specificity score thresholding). This ensures that synonym substitution is extended to infrequent contexts only when the category provides meaningful contextual information.
Solution Approach 2:
The patent changes the parameter of category coherence by introducing a specificity score metric and threshold. Categories are evaluated based on their specificity scores, and only those exceeding the threshold are considered coherent and eligible for synonym generalization. This parameter-based filtering mechanism ensures that only categories with sufficient contextual relevance are used for extending synonym coverage.
Applied Scientific Principles
This section explains which scientific principles are used to turn an abstract innovation direction into a practical engineering solution.
Function Achieved in This Case
This approach enables the identification of helpful categories for synonym substitution, improving query performance by distinguishing between coherent and non-coherent categories, thereby enhancing search results even for less frequent contexts.
Implementation Method 1
calculating a specificity value for the category, based on the comparing. In such an implementation, calculating the specificity value for the category may use a Kullback-Leibler (KL) divergence between the probability distribution for co-occurrence of the terms and the background probability distribution
Data Source
AI summary
Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for training recognition canonical representations corresponding to named-entity phrases in a second natural language based on translating a set of allowable expressions with canonical representations from a first natural language, which may be generated by expanding a context-free grammar for the allowable expressions for the first natural language.


