this is the topic in regard to the above-mentioned topic.
Anything on how to do this, how it shall be done, what features in shell include etc. is discussed here if an existing topic hasn’t been created yet, see idea description below.
Your interest in this idea shall be announced here, otherwise, it gets easily lost as we would need to remember each introduction.
This topic is used to update the specification of the idea as well, even if there is an existing topic, so interested students, watch it!
Anything that shell be discussed privately as e.g. if it involves your proposal will be discussed through a private channel what is currently in discussion.
As of the moment, I’m writing this, the idea’s description of https://joplinapp.org/gsoc2020/ideas.html#7-search is:
The current search engine is built on top of SQLite FTS. An index of the notes is built and this is what is used by FTS when searching.
While it works relatively well, there is still room for improvement. In particular we would like to implement the following:
- Allow boolean searches - search for “A and B”, or “A or B”, etc.
- Remove the need for wildcard queries - for example instead of typing “search*”, it will be possible to simply type “search” and results that contain “search” or “searching” will be included. Those that contain the exact match will come first.
- Search within certain tags (eg. “tag:software search” to search within the notes tagged with “software” and that contain the word “search”).
- Improve relevance algorithm (give a weight to certain criteria, and allow adding new criteria more easily). In particular give more weight to recently modified notes, and less weight to completed to-dos.
- Allow fuzzy search (for example return results that contain “saerch” for the query “search”)
Expected Outcome: To be defined with the student. Depending on what features they would like to implement.