Overview & result
I built a tool that finds App Store keywords by reading the competition, and uses Jev to judge them. What it actually does: 1. Turns the app's own listing into a handful of search queries, with Jev filtering out the ones nobody would type. 2. Runs those searches on the App Store. Whatever ranks is the candidate pool. 3. Jev judges each candidate: is this really an alternative to the app, or does it just share a word? The lookalikes get dropped. 4. The strongest survivors become the competitor set it mines for keywords. No competitor list to maintain, nothing hallucinated: competitors are whoever Apple already ranks, minus the ones Jev rules out.
How Jev fits in the loop
- Ingest real-time application state and relevant contextual parameters
- Format the decision problem as a bounded Choice or Noul schema
- Query Jev to receive a typed probability distribution over the options
- Execute downstream actions or route tasks according to the winning choice
How to reproduce
- Inspect the original showcase and source material at https://x.com/everton_dev/status/2101058122634666079
- Verify the bounded prompt and input candidate schema configured for Jev
- Benchmark decision latency and classification accuracy against baseline models
Why this build matters
Demonstrates a real-world, cost-effective implementation of Jev in a search & content classification scenario, replacing expensive generative calls with fast typed decisions.
Limitations
- Task accuracy is bounded by the precision of the defined candidate choices
- Third-party external dependencies and network latency may affect total workflow duration