Graph Rewriting and Transformation of Syntactic Annotations in a Corpus
Guillaume Bonfante, Bruno Guillaume, Guy Perrier · 2018
One elementary application of graph rewriting is pattern matching in a syntactically annotated corpus. Graph rewriting can be applied to transform corpus annotations in two ways: to move from one linguistic level to the next; and to change annotation format, retaining the same linguistic level. This chapter considers applications to syntax. It focuses on two different surface syntax formats, SSQ and Universal Dependencies (UD). Work on designing a deep syntax level for UD is more recent in date, and a consensus has yet to be reached. Deep syntax highlights the arguments of lexical words present in a sentence in a canonical form, neutralizing the different diatheses through which the arguments are presented. The chapter describes two conversion systems, operating between the same formats in opposite directions: the SSQ_to_UD system and the UD_to_SSQ system. It presents the main differences between the SSQ and UD annotation schemes.