Decomp: A toolkit for decompositional semantics¶
Decomp is a toolkit for working with the Universal Decompositional Semantics (UDS) dataset, which is a collection of directed acyclic semantic graphs with real-valued node and edge attributes pointing into Universal Dependencies syntactic dependency trees.
The toolkit is built on top of NetworkX and RDFLib making it straightforward to:
read the UDS dataset from its native JSON format
query both the syntactic and semantic subgraphs of UDS (as well as pointers between them) using SPARQL 1.1 queries
serialize UDS graphs to many common formats, such as Notation3, N-Triples, turtle, and JSON-LD, as well as any other format supported by NetworkX
The toolkit was built by Aaron Steven White and is maintained by the Decompositional Semantics Initiative. The UDS dataset was constructed from annotations collected by the Decompositional Semantics Initiative.
If you use either UDS or Decomp in your research, we ask that you cite the following paper:
White, Aaron Steven, Elias Stengel-Eskin, Siddharth Vashishtha, Venkata Subrahmanyan Govindarajan, Dee Ann Reisinger, Tim Vieira, Keisuke Sakaguchi, et al. 2020. The Universal Decompositional Semantics Dataset and Decomp Toolkit. Proceedings of The 12th Language Resources and Evaluation Conference, 5698–5707. Marseille, France: European Language Resources Association.
@inproceedings{white-etal-2020-universal,
title = "The Universal Decompositional Semantics Dataset and Decomp Toolkit",
author = "White, Aaron Steven and
Stengel-Eskin, Elias and
Vashishtha, Siddharth and
Govindarajan, Venkata Subrahmanyan and
Reisinger, Dee Ann and
Vieira, Tim and
Sakaguchi, Keisuke and
Zhang, Sheng and
Ferraro, Francis and
Rudinger, Rachel and
Rawlins, Kyle and
Van Durme, Benjamin",
booktitle = "Proceedings of The 12th Language Resources and Evaluation Conference",
month = may,
year = "2020",
address = "Marseille, France",
publisher = "European Language Resources Association",
url = "https://www.aclweb.org/anthology/2020.lrec-1.699",
pages = "5698--5707",
ISBN = "979-10-95546-34-4",
}