EN FR
EN FR




Section: Software

GREW

Participants : Bruno Guillaume [correspondant] , Guy Perrier, Mathieu Morey, Paul Masson.

Grew is a Graph Rewriting tools dedicated to applications in NLP. It was developed as a support tool during the PhD thesis of Mathieu Morey.

It is freely-available (from the page http://wikilligramme.loria.fr/doku.php?id=grew:grew ) and it is developed using the InriaGforge platform (http://gforge.inria.fr/projects/semagramme/ )

We list below some of the major specificities of the GREW software.

  • Graph structures can use a build-in notion of feature structures.

  • The left-hand side of a rule is described by a graph called a pattern; injective graph morphisms are used in the pattern matching algorithm.

  • Negative pattern can be used for a finer control on the left-hand side of rules.

  • The right-hand side or rules is described by a sequence of atomic commands that describe how the graph should be modified during the rule application.

  • Subset of rules are grouped in modules; the full rewriting process being a sequence of module applications.

  • The GREW software has support both for confluent and non-confluent modules; when a non-confluent modules is used, all normal forms are returned and then ambiguity is handled in a natural way.

  • GREW can be used on Corpus mode with statistics about rules usage or with an a Graphical User Interface which can show all intermediate graphs used during the rewriting process (useful either to debug rewriting system of for demonstrations).

During the last 18 months, the GREW software were used for several kind of applications manipulating syntactic and/or semantic graph representations:

  • to build DMRS semantic representation from syntactic dependency trees ( [26] , [14] , [9] );

  • to enrich surface syntactic structures ([13] , [9] );

  • to detect annotation errors in the French Treebank.