From 73730d9d5f44ef8abb18b7c334e6d5e1c9545834 Mon Sep 17 00:00:00 2001 From: osmarks Date: Sat, 15 Mar 2025 22:42:58 +0000 Subject: [PATCH] =?UTF-8?q?Edit=20=E2=80=98osmarks.net=5Fweb=5Fsearch=5Fpl?= =?UTF-8?q?an=5F(secret)=E2=80=99?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- osmarks.net_web_search_plan_(secret).myco | 1 + 1 file changed, 1 insertion(+) diff --git a/osmarks.net_web_search_plan_(secret).myco b/osmarks.net_web_search_plan_(secret).myco index 4ae1bcf..6abd190 100644 --- a/osmarks.net_web_search_plan_(secret).myco +++ b/osmarks.net_web_search_plan_(secret).myco @@ -45,6 +45,7 @@ The job of a search engine is to retrieve useful information for users. This is * Heavy per-user customization? Give multiple result lists and "show more like this". Still low-bitrate. Could optimize across multiple requests. * "Show me things related to this document" (including e.g. user's own draft code, papers, essays). * Refine query with extra detail. +* There are several ways things can be "related" - semantically, stylistically, keywords, similar authorship (also location for images). Is there a clean way to cover all these or do we just need to have separate indices for each? = Cost