Calendar ToolsetHow Calendar Conflict Priority Classifier works
Press Load model once: your browser downloads Gemma 4 E2B instruction-tuned (web build) (2.0 GB) from this site and keeps it in its cache. Then add your text and press Classify locally. The model runs on this device using your graphics card, so nothing you enter is sent to a server. Until the model is loaded, or if your device cannot run it, the tool falls back to a simple keyword check and labels the result as the fallback.
Gemma 4 E2B instruction-tuned (web build) is a small open language model from Google. The tool sends it the instruction below plus your text, asks for a JSON answer with fixed fields, and shows each field as a card. It runs at temperature 0, so the same input gives the same answer on the same device, though different graphics cards can word it slightly differently.
Inputs longer than 6,000 characters are cut to that length before they reach the model, and the result says so. The model only sees what you paste: it does not look anything up.
The instruction the model gets
You help someone decide between calendar events that overlap. List each event, then judge which is hardest to move using only clues in the text: who attends, external parties, deadlines, whether it can be moved, and consequences of missing it. Do not invent attendees, times or consequences.
What it returns
- Events in conflict: Each event, with the clues about it from the text in brackets.
- Hardest to move: The event that looks hardest to move and the reason, using clues from the text.
- Could be moved: Events that look easier to reschedule or delegate, each with the reason.
- Check before deciding: Facts the text does not give that would change the answer, such as whether an event is recurring or who else could attend.