Luc Pommeret

A fully graph-based pipeline is introduced where the classifier never directly processes the input text, and graphs are decomposed into atomic propositions, converted into ConceptNet triples via constrained decoding, and represented as three graphs per pair.

RAG-enhanced LLMs can dramatically improve dependency parsing for low-resource languages like Latin, but inconsistencies in existing treebank annotations may limit further progress.