Stuck on an issue?

Lightrun Answers was designed to reduce the constant googling that comes with debugging 3rd party libraries. It collects links to all the places you might be looking at while hunting down a tough bug.

And, if you’re still stuck at the end, we’re happy to hop on a call to see how we can help out.

Adaptive Results (Ranking) based on previously opened items

See original GitHub issue

Problem

Each time I’m opening a file (in this case it’s called Due.url) I have to scroll far down to open it.

Suggestion

Would love to see ranked search results based on recency and/or frequency. Blueprint: e.g. how Launchbar on macOS works; you open an item among the search results, and if nothing else exist that resembles its name closer (and is higher-ranked), the item you picked will be the first search result the next time you search for it! I think this is a decent example of the term recency, which is a weighted ranking-system based on how many times you’ve chosen an item (frequency) but also including how recently you’ve chosen an item, in the equation.

If anything, simple frequency ranking is the base feature I wish in Flow-Launcher!

Issue Analytics

State:
Created 2 years ago
Comments:8 (5 by maintainers)

Top GitHub Comments

1reaction

hcedcommented, Jun 27, 2021

@jjw24 So sorry for late reply but Yes! It’s stable now. (Have a beautiful summer!)

0reactions

jjw24commented, May 31, 2021

@hced is the ranking stabilised for you or still not working?

Top Results From Across the Web

Rule-ranking method based on item utility in adaptive ...

Therefore, this study proposes a method to rank rules based on the lift ratio value calculated from the frequency and utility of the...

Adaptive Ranking-based Sample Selection for Weakly ...

To evaluate the proposed methods, we used four open benchmark datasets, including AGNews (news topic classification),. Yelp (sentiment classification) (Zhang et ...

Rule-ranking method based on item utility in adaptive ...

The adaptive rule method proposed by Hikmawati, Maulidevi & Surendro (2020, 2021a, 2021b) and Hikmawati & Surendro (2020) has the ability to ...

Adaptive Re-Ranking with a Corpus Graph

First, the query remains unmodified, and therefore, ranking scores from the model need not be re-computed.

Adaptive Re-Ranking with a Corpus Graph - ACM Digital Library

We propose a novel approach for overcoming the recall limitation based on the well-established clustering hypothesis. Throughout the re-ranking ...