LLMs Change Schema Matching Rules

Schema matching now uses LLMs for reasoning instead of fixed rules. Language models judge column correspondences by reading names, values, and examples in a prompt. This replaces hand-written regexes and fixed-label classifiers like Sherlock and Sato. The shift treats matching as reasoning rather than classification, handling ambiguous fields that rule-based systems miss.