Text Database Indexing TRIZ Cases
- Unstructured Data Search via Subspace Projection
Subspace projection maps unstructured data tokens to multidimensional coordinates, resolving polysemy and synonymy issues in large document collections.
- Taxonomy-Based Information Retrieval for Non-Verbatim Queries
A taxonomy built from n-gram clusters maps user queries to relevant documents without requiring exact term matches.
- Keyword Identification in Textual Data Using Word Combinations
A processor identifies key words within a first group of textual data by determining plurality of word combinations.
- Relativistic Retriever for Data Set Discovery
A relativistic retriever executes queries against similarity indexes to identify suitable data sets.
- Unstructured Data Valuation via Domain-Aware Tokenization
Domain-aware tokenization framework calculates contextual business value for unstructured data without full rescans.
- Text Object Management System Using Density Estimation for Storage Optimization
A text object management system generates relevancy scores using unsupervised density estimation models to evaluate stored data content.
- Stop Word Detection via Dependency Tree Root Analysis
Dependency tree root node analysis identifies irrelevant keywords in QA corpora, resolving the trade-off between manual accuracy and automation speed.