Latent Token Representation for Answer Scoring Accuracy

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current question answering systems in natural language processing often fail to accurately determine precise answers due to missing information in questions or answers, leading to unreasonably low confidence scores for relevant documents that do not contain specific keywords, resulting in incorrect answer selection.

Innovation Solution

A method using latent token representation techniques to score candidate answers by analyzing metadata and document content, generating n-grams from questions and documents, and mapping these to determine a confidence score, thereby selecting the precise answer based on the highest score.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If traditional keyword matching is used to score candidate answers, then the scoring process is simple and fast, but the accuracy decreases when important information is missing in questions or answers

Engineering Contradiction:
Improveanswer scoring accuracyVSAvoidscoring system complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent introduces latent tokens as an intermediary layer between traditional keyword matching and answer scoring. These latent tokens capture semantic relationships and contextual information that go beyond exact keyword matches, enabling the system to identify relevant documents even when specific keywords are missing. The latent token representation acts as a mediator that bridges the gap between simple keyword matching and complex semantic understanding.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent extends the scoring mechanism from a single-dimensional keyword match approach to a multi-dimensional approach by incorporating latent token representations. This adds new dimensions of analysis including semantic similarity, contextual relevance, and latent feature matching, allowing the system to evaluate candidate answers from multiple perspectives simultaneously rather than relying solely on exact keyword presence.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Measurement precision

If latent token representation techniques are used to improve answer scoring accuracy, then the precision of answer selection improves, but the computational complexity and processing time increase

Engineering Contradiction:
Improveanswer selection precisionVSAvoidprocessing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent performs preliminary action by pre-computing and storing latent token representations for documents in advance. This allows the system to have semantic features ready and available before the actual question-answering process begins, significantly reducing the computational burden and processing time during runtime when answers need to be scored and selected.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent segments the document processing into distinct components: traditional keyword matching, latent token generation, and scoring integration. This segmentation allows each component to be optimized independently and processed in an efficient pipeline, reducing overall processing time while maintaining the benefits of latent token representation for improved precision.

Inventive Principle:
Principle #1Segmentation

3Reliability

If only exact keyword matching is performed, then the system is fast and computationally efficient, but it fails to identify relevant documents that do not contain specific keywords

Engineering Contradiction:
Improvedocument relevance identificationVSAvoidprocessing efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent changes the parameters of document matching from exact keyword presence to latent feature similarity. By transforming the matching criterion from binary (keyword present/absent) to continuous (latent token similarity score), the system can identify relevant documents based on semantic relationships even when exact keywords are missing, thereby improving reliability without completely sacrificing processing efficiency.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS11243955B2Latent token representations for passage and answer scoring in question answering systems
Publication Date: 2022.02.08 INTERNATIONAL BUSINESS MACHINE CORPORATION
  • US11243955B2 patent drawing
  • US11243955B2 patent drawing
  • US11243955B2 patent drawing

AI summary

The present invention may receive the question, a plurality of the candidate answers, and a plurality of documents associated with the plurality of candidate answers in the natural language. Then the present invention may tokenize the question, the plurality of the candidate answers, and the plurality of the documents into a corresponding n-gram sequence. The present invention may map n-gram elements from the tokenized question to the n-gram elements of the plurality of the tokenized candidate answers and the plurality of the tokenized documents using the latent token representation technique. The present invention may score the plurality of tokenized candidate answers based on the latent token representation technique. Then, the present invention may determine the precise answer based on the plurality of scored candidate answers.