> I am using this simple task to explore how LLM adaptation capabilities can be made performant for scalable extraction
Divide and conquer:
- look at the first 50 or so unhandled cases, and pick the most common pattern in them.
- find a way to handle that pattern with a smile parser (e.g. a JVM DateTimeFormatter, a regex, or whatever works decently in your preferred language)
- repeat
That probably will decrease that 10 million to a million, then to 100,000 fairly rapidly.
Once you’re down to a manageable number, get your LLM to handle those.
(Also: this task likely is easily run in parallel, so if you have money, you won’t need 10M+ seconds)