Modifying Stem Classes
where n x is the number of windows containing
Two vertices are in the same connected
vertices are
component of a graph if there is a path
between them
forms word clusters
Example output of modification
Edit Distance
Damerau-Levenshtein distance
counts the minimum number of insertions, deletions, substitutions, or transpositions of single characters required
<, Damerau-Levenshtein distance 1
distance 2
Soundex Code
Rank words for a query by ranking context vectors
Relevance Feedback Example
If document 7 (“Breeding tropical fish”) is explicitly indicated to be relevant, the most frequent terms are:
breeding (4), fish (4), tropical (4), marine (2), pond
(2)ld(2)k i(1)i
(2), coldwater (2), keeping (1), interested (1) Specific weights and scoring methods used for relevance feedback depend on retrieval
Context and Personalization
If a query has the same words as another query, results will be the same regardless of who submitted the query
why the query was submitted
where the query was submitted
queryselectorall用法
what other queries were submitted in the same
session
These other factors (the context) could have a significant impact on relevance
difficult to incorporate into ranking

版权声明：本站内容均来自互联网，仅供演示用，请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系QQ:729038198，我们将在24小时内删除。