TokensRegex

https://stanfordnlp.github.io/CoreNLP/tokensregex.html

TokensRegex

TokensRegex is a framework within Stanford CoreNLP for defining regular expressions over text and tokens. It allows you to identify patterns in text and map matched text to semantic objects. This tool is particularly useful for building rule-based systems to search for patterns and perform actions when those patterns are found².

Tregex, Tsurgeon, Semgrex, and Ssurgeon

https://stanfordnlp.github.io/CoreNLP/tools_tregex.html

Using Tokensregex, Semgrex and Tregex with the client

https://stanfordnlp.github.io/stanza/client_regex.html

Tregex

Tregex is a tool for matching patterns in syntactic trees using tree relationships and regular expression matches on nodes. It's useful for finding specific structures within parse trees. Tregex can be used programmatically in Java and also has a graphical interface.

Tsurgeon

Tsurgeon works alongside Tregex to perform transformations on syntactic trees. It allows you to specify operations like inserting, deleting, or reordering nodes within a tree. This is particularly useful for manipulating parse trees based on the patterns matched by Tregex.

Semgrex

Semgrex is similar to Tregex but operates on dependency graphs instead of syntactic trees. It allows you to search for specific syntactic structures within parsed sentences, making it useful for tasks that require understanding the grammatical relationships between words.

Ssurgeon

Ssurgeon is a tool for editing dependency graphs, similar to how Tsurgeon edits syntactic trees. It allows for transformations on dependency graphs based on patterns matched by Semgrex. This can be useful for refining or modifying dependency parses.