Back to the talks Previous by time: Colour your Emacs with ease Next by time: Emacs, eev, and Maxima - now! Track: Development - Watch

p-search: a local search engine in Emacs

Zac Romero - zacromero@posteo.com

The following image shows where the talk is in the schedule for Sat 2024-12-07. Solid lines show talks with Q&A via BigBlueButton. Dashed lines show talks with Q&A via IRC or Etherpad.

Format: 23-min talk; Q&A: BigBlueButton conference room https://media.emacsconf.org/2024/current/bbb-p-search.html
Discuss on IRC: #emacsconf
Status: Ready to stream

Times in different time zones:
Saturday, Dec 7 2024, ~11:20 AM - 11:45 AM EST (US/Eastern)
which is the same as:
Saturday, Dec 7 2024, ~10:20 AM - 10:45 AM CST (US/Central)
Saturday, Dec 7 2024, ~9:20 AM - 9:45 AM MST (US/Mountain)
Saturday, Dec 7 2024, ~8:20 AM - 8:45 AM PST (US/Pacific)
Saturday, Dec 7 2024, ~4:20 PM - 4:45 PM UTC
Saturday, Dec 7 2024, ~5:20 PM - 5:45 PM CET (Europe/Paris)
Saturday, Dec 7 2024, ~6:20 PM - 6:45 PM EET (Europe/Athens)
Saturday, Dec 7 2024, ~9:50 PM - 10:15 PM IST (Asia/Kolkata)
Sunday, Dec 8 2024, ~12:20 AM - 12:45 AM +08 (Asia/Singapore)
Sunday, Dec 8 2024, ~1:20 AM - 1:45 AM JST (Asia/Tokyo)
Find out how to watch and participate

Description

Search is an essential part of any digital work. Despite this importance, most tools don't go beyond simple string/regex matching. Oftentimes, a user knows more about what they're looking for: who authored the file, how often it's modified, as well as search terms that the user is only slightly confident exist.

p-search is a search-engine designed to combine the various prior knowledge about the search target, presenting it to the user in a systematic way. In this talk, I will present this package as well as go over the fundamentals of inforation retrieval.

Details:

In this talk, I will go over the p-search. p-search is a search-engine to assist users in finding things, with a focus on flexibility and customizablity.

The talk will begin by going over concepts from the field of information retrieval such as indexing, querying, ranking, and evaluating. This will provide the necessary background to describe the workings of p-search.

Next, an overview of the p-search package and its features will be given. p-search utilizes a probabilistic framework to rank documents according to prior beliefs as to what the file is. So for example, a user might know for sure that the file contains a particular string, might have a strong feeling that it should contain another word, and things that some other words it may contain. The user knows the file extension, the subdirectory, and has known that a particular person works on this file a lot. p-search allows the user to express all of these predicates at once, and ranks documents accordingly.

The talk will then progress to discuss assorted topics concerting the project, such as design considerations and future directions.

The aim of the talk is to expand the listeners' understanding of search as well as inspire creativity concerning the possibilities of search tools.

Code: https://github.com/zkry/p-search

Questions or comments? Please e-mail zacromero@posteo.com

Back to the talks Previous by time: Colour your Emacs with ease Next by time: Emacs, eev, and Maxima - now! Track: Development - Watch