Grew-match: Online Graph Matching

Grew-match is a one page online web application for searching graph patterns in treebanks. Since March 2022, Grew-match was split into several instances, each one with each own url. The address now displays a portal with links to instances.

The instance

This instance contains the last version of the UD and the SUD treebanks and a few more recent versions synchronised with GitHub data. The top navbar gives access to:

Other instances

The page Local installation of Grew-match describes how you can run your own instance of Grew-match.

Basic usage

  1. Select the instance and then the corpus on which you want to search.
  2. Enter the search pattern in the text area (you may use some snippets on the right of the text area)
  3. Click on Search

The number of items is displayed and the first 10 items can be explored. If you want to see the next 10 items, click on More results.

To limit server usage, only the first 1000 items are computed. If the searched pattern is found more then 1000 times, the amount of corpus used to find the first 1000 items is reported. For instance, if you search for a nsubj relation in the UD_French-GSD corpus , the message is More than 1000 results found in 5.29% of the corpus. This means that the first 1000 items were found in 5.29% of the 16,341 sentences of the UD_French-GSD corpus.

Learning syntax

A tutorial with a progressive sequence of patterns is available. You may also explore snippets given on the right of the text area to learn with other examples. A more comprehensive documentation is available in the patterns page.

Clustering the occurrences

In addition to the main request, it is possible to make some clustering on the set of occurrences given by this request.

Use a clustering key

When a clustering key is used, the set of occurrences (or the first 1000 occurrences) is split in subsets depending of the key value. Each possible value is presented as a button with the size of the associated subset; the button gives access to the corresponding occurrences. The clustering key can be:

Use a “whether” sub pattern

A “whether” sub pattern contains a list of clauses (as in pattern or without constructions). The set of occurrences (or the first 1000 occurrences) is split in two subsets:

Note that no curly brackets are needed in the “whether” text area (see examples below).


About CoNLL-U field names

The fields 2, 3, 4 and 5 of CoNLL-U files are considered as features with the following feature names.

CoNLL-U field 2 3 4 5
Name form lemma upos xpos

For instance:

Display options

Below the text area, a few options are available:

Enhanced dependencies

In the UD framework, a few corpora are also provided with another annotation layer EUD (Enhanced dependencies). For these corpora, a switch button is available (above the text area) where the user can chose between UD and EUD.

If EUD is selected, enhanced dependencies are displayed in blue below the sentence. In the pattern, an enhanced dependency can be searched with the prefix E:. For instance, the pattern below searches for an enhanced obl relation in UD_English-EWT without a non-enhanced counterpart :

pattern { N -[E:obj]-> M }
without { N -[obj]-> M }


For any remark or request, you can either contact us or open an issue on GitHub.