Anamavajra-Labs/sanskrit-karaka-hypergraph

Sanskrit Kāraka Hypergraph A predication hypergraph over Sanskrit: vertices are lemma types, hyperedges are predications, and each tine carries a Pāṇinian kāraka role. Why a hypergraph rather than a graph of binary relations: a sentence is an n-ary predicate, and an n-ary relation does not survive projection onto its binary sub-relations. Given only the pairs agent–object, object–recipient and agent–recipient you can no longer tell whether there was one three-place act or three… See the full description on the dataset page: https://huggingface.co/datasets/Anamavajra-Labs/sanskrit-karaka-hypergraph.