Book Content Search Ranking via Implicit Graph Links

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing search engines struggle to optimally rank book content items due to the lack of explicit links between them, which hinders the generation of effective search results.

Innovation Solution

A method that segments textual content into word strings, identifies uncommon phrases, and represents book content items as a graph to determine implicit links based on matching phrases and similar images, allowing for a link-based authority ranking process.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If book content items are searched using traditional link-based ranking methods, then search results can be generated, but the ranking accuracy deteriorates due to the lack of explicit links between book content items

Engineering Contradiction:
Improveranking accuracyVSAvoidnumber of explicit links
Core Design Contradiction:
Measurement precisionVSQuantity of substance

Solution Approach 1:

The patent segments textual content into word strings (n-grams) and identifies uncommon word strings that serve as unique identifiers. This segmentation allows the system to create implicit links between book content items based on shared uncommon phrases, resolving the contradiction by transforming the absence of explicit links into a structured representation that enables accurate ranking.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces uncommon word strings as intermediary elements that mediate between book content items. These uncommon phrases act as implicit links, allowing the system to establish relationships between books without requiring traditional hypertext links, thereby maintaining ranking accuracy despite the lack of explicit links.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Productivity

If traditional search ranking methods are used for book content items, then processing is simpler, but search result optimization deteriorates due to inability to capture implicit relationships

Engineering Contradiction:
Improvesearch result optimizationVSAvoidprocessing complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent performs preliminary processing by segmenting text into word strings and identifying uncommon word strings before the actual search operation. This advance preparation creates a structured representation of book content items with implicit links already established, enabling optimized search results without adding complexity to the actual search process.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent replaces the mechanical link-based system with a semantic-based system using uncommon word strings. Instead of relying on explicit hypertext links (mechanical structure), the system uses semantic relationships captured through uncommon phrase matching, thereby improving search result optimization while managing processing complexity through efficient algorithms.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

Data Source

PatentUS9342583B2Book content item search
Publication Date: 2016.05.17 GOOGLE LLC
  • US9342583B2 patent drawing
  • US9342583B2 patent drawing
  • US9342583B2 patent drawing

AI summary

Methods, systems, and apparatus, including computer program products are provided for ranking distinct book content items based on implicit links to other distinct book content items. The implicit links are defined based on the identification of matching features in the distinct book content items. In some implementations, the matching features are uncommon phrases in textual content of the distinct book content items. Edges representing implicit links are generated between distinct nodes representing distinct book content items in a weighted graph. Search results for distinct book content items can be ordered based on the edges connected to the distinct nodes in the weighted graph that represent the distinct book content items.