Vector-Based File Search Engine for Contextual Tagging

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current search engines face issues with incomplete, false, or overly descriptive metadata, leading to inaccurate and inefficient search results due to their reliance on traditional text-based matching methods, which fail to account for user context and preferences.

Innovation Solution

The system employs vector mathematics to assign unique spatial coordinates to words and context data, allowing for more precise matching by calculating the theta angle between search vectors and file vectors, thereby providing more accurate and personalized search results.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If traditional text-based matching methods are used, then the search system is simple to implement, but the search accuracy and relevance are poor

Engineering Contradiction:
Improvesearch accuracyVSAvoidsystem complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent transforms the search matching process from traditional text-based comparison to vector-based spatial comparison. Words and context data are converted into vectors with spatial coordinates, and the matching accuracy is improved by calculating the theta angle between search vectors and file vectors. This parameter transformation enables the system to capture semantic relationships and user context, significantly improving search relevance while maintaining computational efficiency through standardized vector operations.

Inventive Principle:
Principle #35Parameter changes

2Measurement precision

If vector mathematics is used to assign spatial coordinates to words, then the search accuracy improves, but the computational complexity increases

Engineering Contradiction:
Improvematching precisionVSAvoidcomputational resources
Core Design Contradiction:
Measurement precisionVSUse of energy by moving object

Solution Approach 1:

The patent implements a two-stage processing approach where vectors for words and context data are pre-calculated and stored in a lookup table before the actual search operation. During search execution, the system only needs to retrieve pre-computed vectors and perform relatively simple theta angle calculations between search vectors and file vectors. This preliminary action significantly reduces the computational burden during real-time search operations while maintaining high matching precision.

Inventive Principle:
Principle #10Preliminary action

3Reliability

If crawlers rely on arbitrary descriptors created by site owners, then the implementation is straightforward, but the reliability of search results deteriorates

Engineering Contradiction:
Improvedescriptor validityVSAvoidverification complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent introduces vector representations as an intermediary layer between the search query and the file descriptors. Instead of directly trusting or rejecting arbitrary text descriptors, the system converts both the search terms and the file descriptors into vectors and compares their spatial relationships. This intermediary vector-based comparison method objectively assesses the relevance between search intent and file content, reducing reliance on potentially misleading arbitrary descriptors while maintaining system simplicity.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS7933904B2File search engine and computerized method of tagging files with vectors
Publication Date: 2011.04.26 NELSON CLIFFORD N JR MR
  • US7933904B2 patent drawing
  • US7933904B2 patent drawing
  • US7933904B2 patent drawing

AI summary

The main purpose of the software, system and method of this invention is to help produce better searches for people utilizing their context as represented by a vector. The system allows for files (including websites) to be tagged with a vector. If a provider wants a searcher to find that provider's files, the file must be tagged with the vector that is sufficiently close to the searcher's corresponding vectors. A search user inputs not only a text search but also the vectors that have been created to show the context and preferences of that search user.