Unverified50% confidenceFactExact time
TextRank draws on the PageRank algorithm, treating sentences as nodes, constructing a directed graph based on lexical overlap between sentences, and iteratively computing node weights.
1
Sources
50%
Confidence
Long-term
Relevance
9/16/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedSentence-BERT通过孪生网络结构将句子映射为固定维度的稠密向量，专为句子级语义相似度优化70% similarUnverifiedThe study constructs a sentence hypergraph in which each sentence serves as a node and each hyperedge corresponds to a keyword or named entity, connecting all sentences that contain that keyword.68% similarVerifiedSemantic search converts text into high-dimensional vectors and finds the most relevant conclusions by computing cosine similarity, allowing queries phrased in different ways to match semantically equivalent results.67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/924801API
curl https://kongchang.com/api/v1/knowledge/claims/924801MCP
get_claim(id=924801)