flancian/garden
0
0
Fork 0
mirror of https://github.com/flancian/garden.git synced 2026-08-08 07:26:21 +00:00
Code Issues Packages Projects Releases Wiki Activity

autopushed

Browse Source
This commit is contained in:
Flancian
2022-10-16 20:46:22 +02:00
parent 785a00cf07
commit be43289c33
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
journal/2022-10-16.md
+2
View File
@@ -19,3 +19,5 @@
- should I implement a simple search algorithm myself for the purpose of understanding how to solve this? - should I implement a simple search algorithm myself for the purpose of understanding how to solve this?
- tokenization -> compute combinations is trivial but expensive - tokenization -> compute combinations is trivial but expensive
- [ ] -> [[bag of words]] is cheap - [ ] -> [[bag of words]] is cheap
- this actually requires defining what is the source of truth for [[equivalence class]] and for [[proximity]] between nodes
- I've always wanted to think of Agora search as as an exploration within a certain [[radius]] of an inferred center of gravity; maybe this is distance in some embedding?