Semgrex and Ssurgeon, Searching and Manipulating Dependency Graphs
John Bauer, Chloe Kiddon, Eric Yeh, Alex Shan, Christopher D. Manning
TL;DR
This paper introduces Semgrex and Ssurgeon, tools for efficiently searching and manipulating dependency graphs in natural language processing, with easy-to-use language and integration into popular programming toolkits.
Contribution
It presents a compact language for dependency graph search and manipulation, along with integration into Java and Python toolkits for practical NLP applications.
Findings
Enables efficient dependency graph searching and manipulation.
Supports natural language text relation extraction.
Provides easy integration with existing NLP toolkits.
Abstract
Searching dependency graphs and manipulating them can be a time consuming and challenging task to get right. We document Semgrex, a system for searching dependency graphs, and introduce Ssurgeon, a system for manipulating the output of Semgrex. The compact language used by these systems allows for easy command line or API processing of dependencies. Additionally, integration with publicly released toolkits in Java and Python allows for searching text relations and attributes over natural text.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Computability, Logic, AI Algorithms