| { |
| "paper_id": "2020", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T07:42:54.380253Z" |
| }, |
| "title": "AlpinoGraph: A Graph-based Search Engine for Flexible and Efficient Treebank Search", |
| "authors": [ |
| { |
| "first": "Peter", |
| "middle": [], |
| "last": "Kleiweg", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "University of Groningen", |
| "location": {} |
| }, |
| "email": "p.c.j.kleiweg@rug.nl" |
| }, |
| { |
| "first": "Gertjan", |
| "middle": [], |
| "last": "Van Noord", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "University of Groningen", |
| "location": {} |
| }, |
| "email": "g.j.m.van.noord@rug.nl" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "AlpinoGraph is a graph-based search engine which provides treebank search using SQL database technology coupled with the Cypher query language for graphs. In the paper, we show that AlpinoGraph is a very powerful and very flexible approach towards treebank search. At the same time, AlpinoGraph is efficient. Currently, AlpinoGraph is applicable for all standard Dutch treebanks. We compare the Cypher queries in AlpinoGraph with the XPath queries used in earlier treebank search applications for the same treebanks. We also present a pre-processing technique which speeds up query processing dramatically in some cases, and is applicable beyond AlpinoGraph.", |
| "pdf_parse": { |
| "paper_id": "2020", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "AlpinoGraph is a graph-based search engine which provides treebank search using SQL database technology coupled with the Cypher query language for graphs. In the paper, we show that AlpinoGraph is a very powerful and very flexible approach towards treebank search. At the same time, AlpinoGraph is efficient. Currently, AlpinoGraph is applicable for all standard Dutch treebanks. We compare the Cypher queries in AlpinoGraph with the XPath queries used in earlier treebank search applications for the same treebanks. We also present a pre-processing technique which speeds up query processing dramatically in some cases, and is applicable beyond AlpinoGraph.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "Traditionally, treebanks are, of course, collections of trees. Search engines for treebanks therefore often exploit this tree-like nature. Early treebank search tools such as tgrep, tgrep2, lpath (Rohde, 2001; Bird and Lai, 2010) provide a specialized query language over trees. For Dutch, similarly, current tools (van Noord, 2009; Augustinus et al., 2012; van Noord et al., 2013; Odijk et al., 2017; Augustinus et al., 2017; van Noord et al., 2020) are built with the XPath query language which is a standard query language for XML documents. XML documents are, in essence, trees too.", |
| "cite_spans": [ |
| { |
| "start": 196, |
| "end": 209, |
| "text": "(Rohde, 2001;", |
| "ref_id": "BIBREF11" |
| }, |
| { |
| "start": 210, |
| "end": 229, |
| "text": "Bird and Lai, 2010)", |
| "ref_id": "BIBREF2" |
| }, |
| { |
| "start": 279, |
| "end": 332, |
| "text": "For Dutch, similarly, current tools (van Noord, 2009;", |
| "ref_id": null |
| }, |
| { |
| "start": 333, |
| "end": 357, |
| "text": "Augustinus et al., 2012;", |
| "ref_id": "BIBREF0" |
| }, |
| { |
| "start": 358, |
| "end": 381, |
| "text": "van Noord et al., 2013;", |
| "ref_id": "BIBREF16" |
| }, |
| { |
| "start": 382, |
| "end": 401, |
| "text": "Odijk et al., 2017;", |
| "ref_id": "BIBREF9" |
| }, |
| { |
| "start": 402, |
| "end": 426, |
| "text": "Augustinus et al., 2017;", |
| "ref_id": "BIBREF1" |
| }, |
| { |
| "start": 427, |
| "end": 450, |
| "text": "van Noord et al., 2020)", |
| "ref_id": "BIBREF18" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Obviously, not all linguistic annotations fit the concept of trees, and in most treebanks there are ways to encode, for instance, discontinuous constituents, secondary edges, enhanced dependencies etc. Also, feature structures such as those that arise in constraint-based grammatical frameworks (LFG, HPSG, . . . ) are directed graphs, not trees. It can be argued, therefore, that graphs are a better representation for linguistic annotation. And indeed, several treebank search systems have been based on graphs (M\u00edrovsk\u00fd, 2008; Proisl and Uhrig, 2012; Bonfante et al., 2018) .", |
| "cite_spans": [ |
| { |
| "start": 513, |
| "end": 529, |
| "text": "(M\u00edrovsk\u00fd, 2008;", |
| "ref_id": "BIBREF6" |
| }, |
| { |
| "start": 530, |
| "end": 553, |
| "text": "Proisl and Uhrig, 2012;", |
| "ref_id": "BIBREF10" |
| }, |
| { |
| "start": 554, |
| "end": 576, |
| "text": "Bonfante et al., 2018)", |
| "ref_id": "BIBREF3" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "In this paper, we argue in addition that a graph-like representation is useful because it allows for a straight-forward combination of different types of annotation and annotation layers. In the AlpinoGraph application, four different annotation layers are combined (automatically), including two layers for Universal Dependencies (standard and enhanced) (Nivre et al., 2018) , (Bouma and van Noord, 2017) , the original Lassy annotation layer (van Eynde, 2005; van Noord et al., 2019) , and a simple layer of word pairs inherited from PaQu (Odijk et al., 2017) .", |
| "cite_spans": [ |
| { |
| "start": 355, |
| "end": 375, |
| "text": "(Nivre et al., 2018)", |
| "ref_id": null |
| }, |
| { |
| "start": 378, |
| "end": 405, |
| "text": "(Bouma and van Noord, 2017)", |
| "ref_id": "BIBREF4" |
| }, |
| { |
| "start": 444, |
| "end": 461, |
| "text": "(van Eynde, 2005;", |
| "ref_id": "BIBREF15" |
| }, |
| { |
| "start": 462, |
| "end": 485, |
| "text": "van Noord et al., 2019)", |
| "ref_id": null |
| }, |
| { |
| "start": 541, |
| "end": 561, |
| "text": "(Odijk et al., 2017)", |
| "ref_id": "BIBREF9" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "The representations used in AlpinoGraph are automatically derived from existing treebanks in the Lassy XML format, a hybrid dependency format with some categorical information as well, originally based on and developed as an alternative of the format used in the Tiger treebank (Brants et al., 2004) and the Dutch Spoken Corpus (CGN) (Schuurman et al., 2003) . In addition, information is derived from the CoNLL-U format for Universal Dependencies. In fact, the UD treebanks for Dutch are automatically derived from the treebanks in the Lassy XML format. It should be straightforward to map treebanks in CoNLL-U format (including all UD treebanks) into AlpinoGraph.", |
| "cite_spans": [ |
| { |
| "start": 278, |
| "end": 299, |
| "text": "(Brants et al., 2004)", |
| "ref_id": "BIBREF5" |
| }, |
| { |
| "start": 334, |
| "end": 358, |
| "text": "(Schuurman et al., 2003)", |
| "ref_id": "BIBREF12" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "In this paper, we do not consider the potential linguistic advantages of graph-based representations, since the linguistic annotations are derived from existing resources, and no further manual annotation efforts have been invested for AlpinoGraph.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "AlpinoGraph is built on AgensGraph. AgensGraph provides database technology (PostgreSQL) with the standard search language for graphs, Cypher. This combination provides, on the one hand, a very powerful query language which allows to express very complex linguistic patterns. On the other hand, the database tools ensure a very flexible tool which not only is capable of identifying relevant sentences, but also provides a wealth of functionality for aggregating the information of relevant sentences, structures or words.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "In the next sections, we describe how treebanks are represented as graphs, and how we can formulate simple queries over such treebanks. In the fourth section, we compare AlpinoGraph on the full set of more than a hundred queries that are available in the SPOD extension of PaQu (van Noord et al., 2020) . This comparison illustrates not only that the tool provides the required expressive power, but also shows that the tool is much faster for our purposes. In section 5, we present a search optimization technique which improves speed for some queries enormously. The technique appears to be applicable for most other treebank search systems.", |
| "cite_spans": [ |
| { |
| "start": 278, |
| "end": 302, |
| "text": "(van Noord et al., 2020)", |
| "ref_id": "BIBREF18" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Graphs consist of vertices and edges. In AlpinoGraph, vertices can be words as well as constituents. A vertex is written as (). A vertex of type word is written as (:word), and a vertex of a higher level constituent, a \"node\", is written as (:node). We can use the notation (:nw) as an alias for a vertex that could be either a word or a node.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Treebanks as Graphs", |
| "sec_num": "2" |
| }, |
| { |
| "text": "If we want to provide further information of a vertex, we use attribute and values within curly brackets. For instance, (:node{cat:'np'}), denotes a noun phrase. If we need to refer to a particular vertex, we can place a variable directly after the opening bracket: (v:node{cat:'np'}). Here, v functions as a variable that we can refer to later.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Treebanks as Graphs", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Edges are represented in much the same way, except that square brackets are used. We use edges to represent universal dependencies. Such dependencies are of type ud. For example, the direct object universal dependency is written as [:ud{rel: 'obj'}] .", |
| "cite_spans": [ |
| { |
| "start": 232, |
| "end": 249, |
| "text": "[:ud{rel: 'obj'}]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Treebanks as Graphs", |
| "sec_num": "2" |
| }, |
| { |
| "text": "We can use path expressions to combine vertices and edges. Such expressions look like:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Treebanks as Graphs", |
| "sec_num": "2" |
| }, |
| { |
| "text": "() -[]-> () () <-[]-()", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Treebanks as Graphs", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Between brackets, we can specify further requirements. For instance, the following expression describes the direct object relation between a verb and some word n:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Treebanks as Graphs", |
| "sec_num": "2" |
| }, |
| { |
| "text": "(:word{upos:'verb'}) -[:ud{rel:'obj'}]-> (n:word)", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Treebanks as Graphs", |
| "sec_num": "2" |
| }, |
| { |
| "text": "If this expression is used in a search, the variable n would be instantiated to (heads of) direct objects of verbs.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Treebanks as Graphs", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Each sentence in AlpinoGraph is represented by a graph where the vertices are words and nodes, and a single vertex of type :sentence. The attributes of the words are all the attributes available in the standard Lassy annotation guidelines (van Eynde, 2005; van Noord et al., 2019) , as well as all the attributes in the UD representation. The attributes of nodes include the attribute cat and a few others that we can ignore for now. Multi-word units also have attributes for word and lemma.", |
| "cite_spans": [ |
| { |
| "start": 239, |
| "end": 256, |
| "text": "(van Eynde, 2005;", |
| "ref_id": "BIBREF15" |
| }, |
| { |
| "start": 257, |
| "end": 280, |
| "text": "van Noord et al., 2019)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Treebanks as Graphs", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The edges come in four different types for the representation of dependencies: standard universal dependencies :ud, enhanced universal dependencies :eud, Lassy dependencies :rel and simplified Lassy dependencies :pair (inherited from the word-pair part of the PaQu search tool). A fifth type of edge is :next which links each word to the next word in the sentence.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Treebanks as Graphs", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The Lassy-type dependencies look as follows: Paths can be longer than an edge connecting two vertices. This path identifies the root of the sentence that has a subject:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Treebanks as Graphs", |
| "sec_num": "2" |
| }, |
| { |
| "text": "(:sentence) -[:ud]-> () -[:ud{rel:'nsubj'}]-> ()", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Treebanks as Graphs", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Simple AlpinoGraph queries can be built using the path expressions of the previous section. For example:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "AlpinoGraph by Example", |
| "sec_num": "3" |
| }, |
| { |
| "text": "match (:word{lemma:'drinken'})-[:ud{rel:'obj'}]->(o:word{upos:'NOUN'}) return o", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "AlpinoGraph by Example", |
| "sec_num": "3" |
| }, |
| { |
| "text": "For a given corpus, this query will return all direct object nouns of the verb with lemma to drink. It is straightforward to combine edges of different types in a query. For instance, suppose you are interested to find (heads of) direct objects which are double-quoted. This can be accomplished by identifying direct objects (in the first clause), and then requiring that both the words to the left and the right are double-quotes:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "AlpinoGraph by Example", |
| "sec_num": "3" |
| }, |
| { |
| "text": "match ()-[:ud{rel:'obj'}]->(o:word), (:word{lemma:'\"'}) -[:next]-> (o)-[:next]->(:word{lemma:'\"'}) return o", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "AlpinoGraph by Example", |
| "sec_num": "3" |
| }, |
| { |
| "text": "Queries can also return multiple values. And the values need not be vertices, but could also be edges. Using the '.'-operator you can also return the attributes of vertices or edges. The following example finds nodes with a verb as the head and an indirect object. The result is a table of pairs consisting of the lemma of the verb and the category of the indirect object.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "AlpinoGraph by Example", |
| "sec_num": "3" |
| }, |
| { |
| "text": "match (v:word{pt:'ww'})<-[:rel{rel:'hd'}]-(:node)-[:rel{rel:'obj2'}]->(w:node) return v.lemma, w.cat", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "AlpinoGraph by Example", |
| "sec_num": "3" |
| }, |
| { |
| "text": "It is straightforward to add further conditions on a pattern. The following example provides an illustration, where we want to collect direct objects of the verb \"to eat\", but ignoring the cases where the direct object is a pronoun: match (:word{lemma:'eten'})-[:ud{main:'obj'}]->(w2:word) where w2.upos != 'PRON' return w2", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "AlpinoGraph by Example", |
| "sec_num": "3" |
| }, |
| { |
| "text": "In addition to simply returning the matches, we can perform a variety of aggregations on those. match (:word{lemma:'eten'})-[:ud{main:'obj'}]->(w2) where w2.upos != 'PRON' return w2.lemma, count(w2.lemma) as frequency order by frequency desc This results in a table of lemmas with their respective frequencies in decreasing order.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "AlpinoGraph by Example", |
| "sec_num": "3" |
| }, |
| { |
| "text": "In the Lassy treebank, secondary edges are represented using an index attribute associated to nodes of the tree to indicate reentrancies in the graph. In AlpinoGraph, such secondary edges are represented in much the same way as primary edges (although an attribute is added to ensure that the difference can be recovered in the relevant cases). An example will illustrate this.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Representing secondary edges", |
| "sec_num": "4" |
| }, |
| { |
| "text": "In the annotation of passives, the subject of the passive auxiliary is also annotated to be the object of the embedded verb. An as example, sentence 1 gets analysed as in the left part of figure 1. In contrast, such \"secondary edges\" are represented in AlpinoGraph as first class citizens. Since AlpinoGraph is graph-based, there is no problem by having two edges connecting to \"het brood\". In AlpinoGraph, the resulting graph is displayed on the right of figure 1 (including the UD representation layer for further illustration). In this section, we compare the Cypher queries of AlpinoGraph with equivalent XPath queries used in the earlier treebank search systems DACT(van Noord et al., 2013), GrETEL (Augustinus et al., 2012) , PaQu (Odijk et al., 2017) . The comparison between XPath and Cypher is based on the same treebanks, for a large number of queries. We thus need a large number of relevant linguistic queries. This representative set of linguistic queries is taken from the SPOD extension of PaQu. SPOD (Syntactic Profiler of Dutch) (van Noord et al., 2020) provides an interface to a set of over a hundred linguistic queries which can be used to compare texts and corpora. These queries are supposed to be generally useful to obtain a good characterization of the syntactic properties of a text. SPOD has been used to study, for instance, the writing development of Dutch school children. The list of queries has been established in close connection with linguists. The queries are applied for four different treebanks, described here as follows.", |
| "cite_spans": [ |
| { |
| "start": 704, |
| "end": 729, |
| "text": "(Augustinus et al., 2012)", |
| "ref_id": "BIBREF0" |
| }, |
| { |
| "start": 737, |
| "end": 757, |
| "text": "(Odijk et al., 2017)", |
| "ref_id": "BIBREF9" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Representing secondary edges", |
| "sec_num": "4" |
| }, |
| { |
| "text": "Alpino Treebank. The Alpino Treebank (van der Beek et al., 2002) contains over 7 thousand manually annotated sentences which constitute the newspaper (\"cdbl\") part of the Eindhoven corpus (uit den Boogaart, 1975) . This treebank is one of the UD treebanks. It is available both in CoNLL-U and Lassy XML format.", |
| "cite_spans": [ |
| { |
| "start": 37, |
| "end": 64, |
| "text": "(van der Beek et al., 2002)", |
| "ref_id": "BIBREF14" |
| }, |
| { |
| "start": 188, |
| "end": 212, |
| "text": "(uit den Boogaart, 1975)", |
| "ref_id": "BIBREF13" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Representing secondary edges", |
| "sec_num": "4" |
| }, |
| { |
| "text": "CGN. The CGN treebank contains the manually syntactically annotated part of CGN (\"Corpus of Spoken Dutch\") (Schuurman et al., 2003) . The treebank consists of 1 million words. The CGN annotation format has been automatically converted to the Lassy XML format.", |
| "cite_spans": [ |
| { |
| "start": 107, |
| "end": 131, |
| "text": "(Schuurman et al., 2003)", |
| "ref_id": "BIBREF12" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Representing secondary edges", |
| "sec_num": "4" |
| }, |
| { |
| "text": "Eindhoven. The Eindhoven treebank contains over 40 thousand automatically annotated sentences. The annotations are provided by the Alpino parser (van Noord, 2006) , in the Lassy XML format.", |
| "cite_spans": [ |
| { |
| "start": 145, |
| "end": 162, |
| "text": "(van Noord, 2006)", |
| "ref_id": "BIBREF19" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Representing secondary edges", |
| "sec_num": "4" |
| }, |
| { |
| "text": "Lassy Small. The Lassy Small treebank (van Noord et al., 2013) is the de facto standard treebank of written Dutch. The size of the manually annotated corpus is 1 million words, and the corpus consists of a variety of text types. Part of this treebank is available as one of the UD treebanks (the limitation is due to copyright reasons).", |
| "cite_spans": [ |
| { |
| "start": 38, |
| "end": 62, |
| "text": "(van Noord et al., 2013)", |
| "ref_id": "BIBREF16" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Representing secondary edges", |
| "sec_num": "4" |
| }, |
| { |
| "text": "The list of linguistic queries from SPOD contains 102 items (we ignore the queries about parser performance since most of our treebanks are manually developed). Of those, 18 queries are not available for the timing experiment because the Cypher queries exploit an efficiency improvement which we will only discuss in section 5. Since that improvement is somewhat independent of the actual query engine, including those queries here would be unfair. A further complication is that the automatically annotated treebanks include some information on separable verb prefixes that is not available in the manually annotated treebanks. SPOD includes 6 queries which focus on that information, so naturally those 6 queries are only applied for the Eindhoven treebank. Finally, the CGN treebank pre-dates the other treebanks and does not include certain types of secondary edges which have been added systematically to later treebanks. For that reason, three queries are not applicable to the CGN treebank. Table 1 summarizes the number of queries used per treebank. We list both the number of queries used to compare the results (left) and the number of queries used in the timing experiment (right Table 1 : Number of queries used in the two experiments per treebank. On the left, the number of queries used to compare the number of results. On the right, the number of queries used for the timing experiment.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 998, |
| "end": 1005, |
| "text": "Table 1", |
| "ref_id": null |
| }, |
| { |
| "start": 1191, |
| "end": 1198, |
| "text": "Table 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Representing secondary edges", |
| "sec_num": "4" |
| }, |
| { |
| "text": "The queries available in SPOD have all been re-implemented in AlpinoGraph. As a consequence, we can compare the results of running the original XPath queries on the one hand, and running the newly implemented Cypher queries in AlpinoGraph on the other hand. During the development of the Cypher queries, we carefully compared if the Cypher queries returned the same hits as the corresponding XPath query. In a limited number of cases, it turned out quite hard to obtain precisely the same set of hits. There are two classes of cases where the number of hits differs for some of the queries. Firstly, while we were re-implementing the queries in AlpinoGraph we found a number of subtle problems with the original XPath queries. A few cases are reported below. Secondly, a further important difference is the representation of \"secondary edges\".", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Differences in query results", |
| "sec_num": "5.2" |
| }, |
| { |
| "text": "During the process of re-implementing the SPOD queries in AlpinoGraph, we encountered a small number of subtle problems with the original XPath queries. A simple example concerns the identification of noun phrases. Word groups are labeled by a category attribute, so any node with category \"np\" is a noun phrase. However, category features are used only for word groups and not for single words. Therefore, single-word noun phrases such as pronouns do not have a category attribute. If noun phrases have to be identified in XPath queries, a disjunction is used to include both word groups with the relevant category attribute as well as single words with appropriate part-of-speech attributes. A further complication arises for coordination. A coordination of two noun phrases is assigned \"conj\" as category attribute, not \"np\". In PaQu, a macro is defined to specify what it means to be a noun phrase. That macro essentially states that you are a noun phrase if you are a basic noun phrase, or if you are a coordination of basic noun phrases. And a basic noun phrase is a word group with category \"np\", or a word with the appropriate part of speech tag (noun, pronoun, proper name). This definition missed the cases where a conjunction was built up of two NP conjunctions, as in: A more intricate example concerns the definition of the topic position in main sentences, in Germanic studies often called the \"vorfeld\": the word group that precedes the finite verb in V2 main sentences. In the hybrid dependency annotation format, it is somewhat complicated to define this word group. The word group should be a dependent (either direct or indirectly) of the finite verb, and it should (directly) precede that finite verb. In this example, \"het huis op de heuvel\" satisfies those conditions and is a potential vorfeld. In order to rule out dependents of the actual vorfeld constituent, in the example \"op de heuvel\", the XPath query furthermore required that the vorfeld candidate should not be part of a constituent which is itself a vorfeld candidate. However, after comparing the results of the XPath query and the Cypher variant, it became apparent that this added condition was a bit too strict. That condition also rules out vorfelds of embedded main sentences. An example is listed where, with the analysis illustrated in figure 2. The original XPath query thus missed the fact that \"ik\" here also should be considered a vorfeld constituent. ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Query improvements", |
| "sec_num": "5.2.1" |
| }, |
| { |
| "text": "Complements of fixed verbal expressions are labeled using the relation \"svp\". In a few cases, such a fixed part of a fixed verbal expression also functions as the subject in a passive-like construction, as in example 5, analysed as in the left part of figure 3. One of the SPOD queries identifies complements of fixed verbal expressions. It does so using a simple query which identifies all nodes that have a \"svp\" dependency with a verbal head. In that query, however, no special consideration was made for cases where that node only contains an index. Therefore, the word group \"groot alarm\" is not found by the XPath query. The right part of figure 3 illustrates the representation used in AlpinoGraph. As a consequence, the AlpinoGraph variant of the query to identify complements of fixed verbal expressions will identify the \"groot alarm\" word group as a hit.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Differences for secondary edges", |
| "sec_num": "5.3" |
| }, |
| { |
| "text": "Almost all differences between XPath and Cypher are caused by this difference in representation of secondary edges, and in most of these cases, the Cypher version of the query is in fact closer to the linguistic intention of the query -as in our running example. As a side note, going over the differences revealed quite a few manual annotation mistakes too.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Differences for secondary edges", |
| "sec_num": "5.3" |
| }, |
| { |
| "text": "In addition to a comparison of the results of the various queries, it is also interesting to consider the speed of the various queries for both XPath and Cypher.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Timing experiment", |
| "sec_num": "5.4" |
| }, |
| { |
| "text": "As explained in the first paragraph of this section, we compare the cputime requirements for about 80 queries applied to four different treebanks. The results are presented in figure 4. Both axes of the graph are in logarithmic scale. Each dot in the graph represents the cputime it took to finish a particular query for a particular treebank. The Y-axis represents the cputime taken by the XPath queries, whereas the X-axis represents the time taken by the Cypher queries.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Timing experiment", |
| "sec_num": "5.4" |
| }, |
| { |
| "text": "As can be observed in the graph, in most cases, but not all, the evaluation of the Cypher queries by AlpinoGraph is much faster than the evaluation of the XPath queries. For the few cases for which the Cypher query is slower, the difference is relatively small.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Timing experiment", |
| "sec_num": "5.4" |
| }, |
| { |
| "text": "Both Cypher and XPath are expressive enough to define complex syntactic patterns. Some of these patterns occur quite frequently. For example, in the Lassy dependency structures, the topological fields known from Germanic syntax, such as vorfeld, mittelfeld and nachfeld are not explicitly encoded. Yet, it is possible to define Cypher expressions and XPath expressions which recover this information. However, such complicated patterns are relatively hard to compute.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Search optimization", |
| "sec_num": "6" |
| }, |
| { |
| "text": "The properties of nodes that we regularly want to refer to can be pre-computed. For instance, a special attribute _vorfeld has been added in the representation of treebanks in AlpinoGraph. This attribute is assigned the value \"True\" for the relevant nodes at the time when the corpus is loaded into AlpinoGraph.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Search optimization", |
| "sec_num": "6" |
| }, |
| { |
| "text": "Without such an attribute, it would be possible to identify vorfeld constituents using a Cypher query, but that query is quite complicated, since it must recover the surface syntax of the sentence on the basis of a dependency graph. The actual query identifies potential vorfelds which are (potentially indirect) dependents of the finite verb which precede that finite verb. From those potential vorfelds, the query then further extracts the maximal one. A further complication is that parts of the vorfeld constituent may actually be extraposed. The full query is given in the appendix. Running the complicated query over the Lassy Small corpus to identify vorfelds in the corpus takes almost four minutes. After coding the property as an attribute of the relevant nodes, the following, trivial, query finishes within 100 msec: match (n:nw{_vorfeld: true}) return n Properties of nodes that are often used in treebank queries can be encoded by simple attributes. We developed a tool which takes a treebank, a query, an attribute and a value. Each node in the treebank that satisfies the query is augmented with the given attribute and value. This way, treebanks can be enriched with, essentially, redundant information. The benefit will be that queries which rely on that information can be expressed much simpler and will be evaluated much faster.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Search optimization", |
| "sec_num": "6" |
| }, |
| { |
| "text": "In this paper, we introduced AlpinoGraph, a novel graph-based treebank search engine, based on the Cypher query language for graphs. We argued that graphs are an appropriate representation for linguistic annotation, in particular if several annotation layers are combined. We have compared the Cyper queries of AlpinoGraph with the XPath queries that can be used in PaQu, a popular existing treebank search tool for Dutch treebanks. This comparison is based on a large set of relevant syntactic queries, taken from SPOD. Both in XPath and Cypher, it is possible to recover fairly subtle and complicated syntactic patterns. And typically, the Cypher queries are evaluated much faster.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Concluding remarks", |
| "sec_num": "7" |
| }, |
| { |
| "text": "We also described a simple search optimization technique by adding special attributes to nodes which represent properties which are often referred to in queries, but slow to be evaluated on-line. This preprocessing technique is applicable to other treebank search engines too.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Concluding remarks", |
| "sec_num": "7" |
| }, |
| { |
| "text": "AlpinoGraph is open-source and can be used on-line, free of charge. The system is available via https://urd2.let.rug.nl/kleiweg/alpinograph/, and the sources are available via https:// github.com/rug-compling/alpinograph.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Concluding remarks", |
| "sec_num": "7" |
| }, |
| { |
| "text": "In order to identify the vorfeld, the following query first identifies the head of main sentences (the finite verb) and then selects embedded dependents for which it is the case that their head precede this finite verb. These potential vorfeld constituents include the actual vorfeld, but also most of the dependents of the vorfeld. Therefore, the query is complicated by removing from the set of potential vorfelds all those nodes that are dominated by a potential vorfeld.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Appendix: Query for vorfeld", |
| "sec_num": null |
| }, |
| { |
| "text": "Further complications arise because of the possibility of multi-word-units, and because of the fact that not only real heads (with relation \"hd\") are treated as heads here, but also dependents of type \"crd\" and \"cmp\". and htopic.begin < fin.begin and ( length(rel) = 0 or rel [0] .rel in ['hd','cmp',' crd'] ) ) or ( topic.begin < fin.begin and topic.end <= fin.begin ) match (topic) <-[:rel*1..]-(nt:node) <-[:rel*]-(n) match (nt) -[relt:rel*0..1]-> (hnt:nw) where ( ( not hnt.lemma is null ) and hnt.begin < fin.begin and ( length(relt) = 0 or relt [0] .rel in ['hd','cmp',' crd'] ) ) or ( nt.begin < fin.begin and nt.end <= fin.begin ) return topic.sentid as sentid, topic.id as id, n.id as nid ) as foo", |
| "cite_spans": [ |
| { |
| "start": 276, |
| "end": 279, |
| "text": "[0]", |
| "ref_id": null |
| }, |
| { |
| "start": 288, |
| "end": 301, |
| "text": "['hd','cmp','", |
| "ref_id": null |
| }, |
| { |
| "start": 551, |
| "end": 554, |
| "text": "[0]", |
| "ref_id": null |
| }, |
| { |
| "start": 563, |
| "end": 576, |
| "text": "['hd','cmp','", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Appendix: Query for vorfeld", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Example-based treebank querying", |
| "authors": [ |
| { |
| "first": "Liesbeth", |
| "middle": [], |
| "last": "Augustinus", |
| "suffix": "" |
| }, |
| { |
| "first": "Vincent", |
| "middle": [], |
| "last": "Vandeghinste", |
| "suffix": "" |
| }, |
| { |
| "first": "Frank", |
| "middle": [], |
| "last": "Van Eynde", |
| "suffix": "" |
| } |
| ], |
| "year": 2012, |
| "venue": "Proceedings of the 8th International Conference on Language Resources and Evaluation (LREC-2012)", |
| "volume": "", |
| "issue": "", |
| "pages": "3161--3167", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Liesbeth Augustinus, Vincent Vandeghinste, and Frank Van Eynde. 2012. Example-based treebank querying. In Proceedings of the 8th International Conference on Language Resources and Evaluation (LREC-2012), pages 3161-3167, Istanbul, Turkey.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "GrETEL. a tool for example-based treebank mining", |
| "authors": [ |
| { |
| "first": "Liesbeth", |
| "middle": [], |
| "last": "Augustinus", |
| "suffix": "" |
| }, |
| { |
| "first": "Vincent", |
| "middle": [], |
| "last": "Vandeghinste", |
| "suffix": "" |
| }, |
| { |
| "first": "Ineke", |
| "middle": [], |
| "last": "Schuurman", |
| "suffix": "" |
| }, |
| { |
| "first": "Frank", |
| "middle": [], |
| "last": "Van Eynde", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "Clarin in the low countries", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Liesbeth Augustinus, Vincent Vandeghinste, Ineke Schuurman, and Frank Van Eynde. 2017. GrETEL. a tool for example-based treebank mining. In Jan Odijk and Arjan van Hessen, editors, Clarin in the low countries. Ubiquity Press, London.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "Querying linguistic trees", |
| "authors": [ |
| { |
| "first": "Steven", |
| "middle": [], |
| "last": "Bird", |
| "suffix": "" |
| }, |
| { |
| "first": "Catherine", |
| "middle": [], |
| "last": "Lai", |
| "suffix": "" |
| } |
| ], |
| "year": 2010, |
| "venue": "Journal of Logic, Language and Information", |
| "volume": "19", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Steven Bird and Catherine Lai. 2010. Querying linguistic trees. Journal of Logic, Language and Information, 19:53-73, 06.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "Application of Graph Rewriting to Natural Language Processing", |
| "authors": [ |
| { |
| "first": "Guillaume", |
| "middle": [], |
| "last": "Bonfante", |
| "suffix": "" |
| }, |
| { |
| "first": "Bruno", |
| "middle": [], |
| "last": "Guillaume", |
| "suffix": "" |
| }, |
| { |
| "first": "Guy", |
| "middle": [], |
| "last": "Perrier", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Guillaume Bonfante, Bruno Guillaume, and Guy Perrier. 2018. Application of Graph Rewriting to Natural Lan- guage Processing. Wiley.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Increasing return on annotation investment: The automatic construction of a universal dependency treebank for Dutch", |
| "authors": [ |
| { |
| "first": "Gosse", |
| "middle": [], |
| "last": "Bouma", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Gertjan Van Noord", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "Proceedings of the NoDaLiDa 2017 Workshop on Universal Dependencies (UDW 2017)", |
| "volume": "", |
| "issue": "", |
| "pages": "19--26", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gosse Bouma and Gertjan van Noord. 2017. Increasing return on annotation investment: The automatic con- struction of a universal dependency treebank for Dutch. In Proceedings of the NoDaLiDa 2017 Workshop on Universal Dependencies (UDW 2017), pages 19-26, Gothenburg, Sweden, May. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "Tiger: Linguistic interpretation of a german corpus", |
| "authors": [ |
| { |
| "first": "Sabine", |
| "middle": [], |
| "last": "Brants", |
| "suffix": "" |
| }, |
| { |
| "first": "Stefanie", |
| "middle": [], |
| "last": "Dipper", |
| "suffix": "" |
| }, |
| { |
| "first": "Peter", |
| "middle": [], |
| "last": "Eisenberg", |
| "suffix": "" |
| }, |
| { |
| "first": "Silvia", |
| "middle": [], |
| "last": "Hansen-Schirra", |
| "suffix": "" |
| }, |
| { |
| "first": "Esther", |
| "middle": [], |
| "last": "K\u00f6nig", |
| "suffix": "" |
| }, |
| { |
| "first": "Wolfgang", |
| "middle": [], |
| "last": "Lezius", |
| "suffix": "" |
| }, |
| { |
| "first": "Christian", |
| "middle": [], |
| "last": "Rohrer", |
| "suffix": "" |
| }, |
| { |
| "first": "George", |
| "middle": [], |
| "last": "Smith", |
| "suffix": "" |
| }, |
| { |
| "first": "Hans", |
| "middle": [], |
| "last": "Uszkoreit", |
| "suffix": "" |
| } |
| ], |
| "year": 2004, |
| "venue": "Journal of Language and Computation", |
| "volume": "2", |
| "issue": "", |
| "pages": "597--620", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Sabine Brants, Stefanie Dipper, Peter Eisenberg, Silvia Hansen-Schirra, Esther K\u00f6nig, Wolfgang Lezius, Christian Rohrer, George Smith, and Hans Uszkoreit. 2004. Tiger: Linguistic interpretation of a german corpus. Journal of Language and Computation, 2:597-620, 12.", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Netgraph -making searching in treebanks easy", |
| "authors": [ |
| { |
| "first": "Ji\u0159\u00ed", |
| "middle": [], |
| "last": "M\u00edrovsk\u00fd", |
| "suffix": "" |
| } |
| ], |
| "year": 2008, |
| "venue": "IJCNLP 2008 Proceedings of the Third International Joint Conference on Natural Language Processing", |
| "volume": "", |
| "issue": "", |
| "pages": "945--950", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ji\u0159\u00ed M\u00edrovsk\u00fd. 2008. Netgraph -making searching in treebanks easy. In IJCNLP 2008 Proceedings of the Third In- ternational Joint Conference on Natural Language Processing, pages 945-950, Hyderabad, India. International Institute of Information Technology.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "Eric Villemonte de la Clergerie", |
| "authors": [ |
| { |
| "first": "Tanja", |
| "middle": [], |
| "last": "Saleh", |
| "suffix": "" |
| }, |
| { |
| "first": "Stephanie", |
| "middle": [], |
| "last": "Samard\u017ei\u0107", |
| "suffix": "" |
| }, |
| { |
| "first": "Manuela", |
| "middle": [], |
| "last": "Samson", |
| "suffix": "" |
| }, |
| { |
| "first": "Baiba", |
| "middle": [], |
| "last": "Sanguinetti", |
| "suffix": "" |
| }, |
| { |
| "first": "Yanin", |
| "middle": [], |
| "last": "Saul\u012bte", |
| "suffix": "" |
| }, |
| { |
| "first": "Nathan", |
| "middle": [], |
| "last": "Sawanakunanon", |
| "suffix": "" |
| }, |
| { |
| "first": "Sebastian", |
| "middle": [], |
| "last": "Schneider", |
| "suffix": "" |
| }, |
| { |
| "first": "Djam\u00e9", |
| "middle": [], |
| "last": "Schuster", |
| "suffix": "" |
| }, |
| { |
| "first": "Wolfgang", |
| "middle": [], |
| "last": "Seddah", |
| "suffix": "" |
| }, |
| { |
| "first": "Mojgan", |
| "middle": [], |
| "last": "Seeker", |
| "suffix": "" |
| }, |
| { |
| "first": "Mo", |
| "middle": [], |
| "last": "Seraji", |
| "suffix": "" |
| }, |
| { |
| "first": "Atsuko", |
| "middle": [], |
| "last": "Shen", |
| "suffix": "" |
| }, |
| { |
| "first": "Muh", |
| "middle": [], |
| "last": "Shimada", |
| "suffix": "" |
| }, |
| { |
| "first": "Dmitry", |
| "middle": [], |
| "last": "Shohibussirri", |
| "suffix": "" |
| }, |
| { |
| "first": "Natalia", |
| "middle": [], |
| "last": "Sichinava", |
| "suffix": "" |
| }, |
| { |
| "first": "Maria", |
| "middle": [], |
| "last": "Silveira", |
| "suffix": "" |
| }, |
| { |
| "first": "Radu", |
| "middle": [], |
| "last": "Simi", |
| "suffix": "" |
| }, |
| { |
| "first": "Katalin", |
| "middle": [], |
| "last": "Simionescu", |
| "suffix": "" |
| }, |
| { |
| "first": "M\u00e1ri\u01ce", |
| "middle": [], |
| "last": "Simk\u00f3", |
| "suffix": "" |
| }, |
| { |
| "first": "Kiril", |
| "middle": [], |
| "last": "Simkov\u00e1", |
| "suffix": "" |
| }, |
| { |
| "first": "Aaron", |
| "middle": [], |
| "last": "Simov", |
| "suffix": "" |
| }, |
| { |
| "first": "Isabela", |
| "middle": [], |
| "last": "Smith", |
| "suffix": "" |
| }, |
| { |
| "first": "Carolyn", |
| "middle": [], |
| "last": "Soares-Bastos", |
| "suffix": "" |
| }, |
| { |
| "first": "Antonio", |
| "middle": [], |
| "last": "Spadine", |
| "suffix": "" |
| }, |
| { |
| "first": "Milan", |
| "middle": [], |
| "last": "Stella", |
| "suffix": "" |
| }, |
| { |
| "first": "Jana", |
| "middle": [], |
| "last": "Straka", |
| "suffix": "" |
| }, |
| { |
| "first": "Alane", |
| "middle": [], |
| "last": "Strnadov\u00e1", |
| "suffix": "" |
| }, |
| { |
| "first": "Umut", |
| "middle": [], |
| "last": "Suhr", |
| "suffix": "" |
| }, |
| { |
| "first": "Zsolt", |
| "middle": [], |
| "last": "Sulubacak", |
| "suffix": "" |
| }, |
| { |
| "first": "Dima", |
| "middle": [], |
| "last": "Sz\u00e1nt\u00f3", |
| "suffix": "" |
| }, |
| { |
| "first": "Yuta", |
| "middle": [], |
| "last": "Taji", |
| "suffix": "" |
| }, |
| { |
| "first": "Takaaki", |
| "middle": [], |
| "last": "Takahashi", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Tanaka", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "Faculty of Mathematics and Physics", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Saleh, Tanja Samard\u017ei\u0107, Stephanie Samson, Manuela Sanguinetti, Baiba Saul\u012bte, Yanin Sawanakunanon, Nathan Schneider, Sebastian Schuster, Djam\u00e9 Seddah, Wolfgang Seeker, Mojgan Seraji, Mo Shen, Atsuko Shimada, Muh Shohibussirri, Dmitry Sichinava, Natalia Silveira, Maria Simi, Radu Simionescu, Katalin Simk\u00f3, M\u00e1ri\u01ce Simkov\u00e1, Kiril Simov, Aaron Smith, Isabela Soares-Bastos, Carolyn Spadine, Antonio Stella, Milan Straka, Jana Strnadov\u00e1, Alane Suhr, Umut Sulubacak, Zsolt Sz\u00e1nt\u00f3, Dima Taji, Yuta Takahashi, Takaaki Tanaka, Isabelle Tel- lier, Trond Trosterud, Anna Trukhina, Reut Tsarfaty, Francis Tyers, Sumire Uematsu, Zde\u0148ka Ure\u0161ov\u00e1, Larraitz Uria, Hans Uszkoreit, Sowmya Vajjala, Daniel van Niekerk, Gertjan van Noord, Viktor Varga, Eric Villemonte de la Clergerie, Veronika Vincze, Lars Wallin, Jing Xian Wang, Jonathan North Washington, Seyi Williams, Mats Wir\u00e9n, Tsegay Woldemariam, Tak-sum Wong, Chunxiao Yan, Marat M. Yavrumyan, Zhuoran Yu, Zden\u011b\u01e9 Zabokrtsk\u00fd, Amir Zeldes, Daniel Zeman, Manying Zhang, and Hanzhi Zhu. 2018. Universal dependencies 2.3. LINDAT/CLARIN digital library at the Institute of Formal and Applied Linguistics (\u00daFAL), Faculty of Mathematics and Physics, Charles University.", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "The parse and query (PaQu) application", |
| "authors": [ |
| { |
| "first": "Jan", |
| "middle": [], |
| "last": "Odijk", |
| "suffix": "" |
| }, |
| { |
| "first": "Peter", |
| "middle": [], |
| "last": "Gertjan Van Noord", |
| "suffix": "" |
| }, |
| { |
| "first": "Erik Tjong Kim", |
| "middle": [], |
| "last": "Kleiweg", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Sang", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "Clarin in the low countries", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Jan Odijk, Gertjan van Noord, Peter Kleiweg, and Erik Tjong Kim Sang. 2017. The parse and query (PaQu) application. In Jan Odijk and Arjan van Hessen, editors, Clarin in the low countries. Ubiquity Press, London.", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "Efficient Dependency Graph Matching with the IMS Open Corpus Workbench", |
| "authors": [ |
| { |
| "first": "Thomas", |
| "middle": [], |
| "last": "Proisl", |
| "suffix": "" |
| }, |
| { |
| "first": "Peter", |
| "middle": [], |
| "last": "Uhrig", |
| "suffix": "" |
| } |
| ], |
| "year": 2012, |
| "venue": "Proceedings of LREC", |
| "volume": "", |
| "issue": "", |
| "pages": "2750--2756", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Thomas Proisl and Peter Uhrig. 2012. Efficient Dependency Graph Matching with the IMS Open Corpus Work- bench. In Proceedings of LREC, page 2750-2756, Istanbul. ELRA.", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "Tgrep2 user manual", |
| "authors": [ |
| { |
| "first": "L", |
| "middle": [ |
| "T" |
| ], |
| "last": "Douglas", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Rohde", |
| "suffix": "" |
| } |
| ], |
| "year": 2001, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Douglas L. T. Rohde. 2001. Tgrep2 user manual.", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "Cgn, an annotated corpus of Spoken Dutch", |
| "authors": [ |
| { |
| "first": "I", |
| "middle": [], |
| "last": "Schuurman", |
| "suffix": "" |
| }, |
| { |
| "first": "M", |
| "middle": [], |
| "last": "Schouppe", |
| "suffix": "" |
| }, |
| { |
| "first": "T", |
| "middle": [], |
| "last": "Van Der Wouden", |
| "suffix": "" |
| }, |
| { |
| "first": "H", |
| "middle": [], |
| "last": "Hoekstra", |
| "suffix": "" |
| } |
| ], |
| "year": 2003, |
| "venue": "Proceedings of 4th International Workshop on Language Resources and Evaluation", |
| "volume": "", |
| "issue": "", |
| "pages": "340--347", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "I. Schuurman, M. Schouppe, T. Van der Wouden, and H. Hoekstra. 2003. Cgn, an annotated corpus of Spoken Dutch. In A. Abbeil\u00e9, S. Hansen-Schirra, and H. Uszkoreit, editors, Proceedings of 4th International Workshop on Language Resources and Evaluation, pages 340-347, Budapest.", |
| "links": null |
| }, |
| "BIBREF13": { |
| "ref_id": "b13", |
| "title": "Woordfrequenties in geschreven en gesproken Nederlands. Oosthoek, Scheltema & Holkema", |
| "authors": [ |
| { |
| "first": "P", |
| "middle": [ |
| "C" |
| ], |
| "last": "Uit Den", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Boogaart", |
| "suffix": "" |
| } |
| ], |
| "year": 1975, |
| "venue": "Werkgroep Frequentie-onderzoek van het Nederlands", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "P. C. uit den Boogaart. 1975. Woordfrequenties in geschreven en gesproken Nederlands. Oosthoek, Scheltema & Holkema, Utrecht. Werkgroep Frequentie-onderzoek van het Nederlands.", |
| "links": null |
| }, |
| "BIBREF14": { |
| "ref_id": "b14", |
| "title": "The Alpino dependency treebank", |
| "authors": [ |
| { |
| "first": "Gosse", |
| "middle": [], |
| "last": "Leonoor Van Der Beek", |
| "suffix": "" |
| }, |
| { |
| "first": "Robert", |
| "middle": [], |
| "last": "Bouma", |
| "suffix": "" |
| }, |
| { |
| "first": "Gertjan", |
| "middle": [], |
| "last": "Malouf", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Van Noord", |
| "suffix": "" |
| } |
| ], |
| "year": 2001, |
| "venue": "Computational Linguistics in the Netherlands", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Leonoor van der Beek, Gosse Bouma, Robert Malouf, and Gertjan van Noord. 2002. The Alpino dependency tree- bank. In Hendri Hondorp Mari\u00ebt Theune, Anton Nijholt, editor, Computational Linguistics in the Netherlands 2001. Rodopi.", |
| "links": null |
| }, |
| "BIBREF15": { |
| "ref_id": "b15", |
| "title": "Part of speech tagging en lemmatizering van het D-COI corpus", |
| "authors": [ |
| { |
| "first": "", |
| "middle": [], |
| "last": "Frank Van Eynde", |
| "suffix": "" |
| } |
| ], |
| "year": 2005, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Frank van Eynde. 2005. Part of speech tagging en lemmatizering van het D-COI corpus.", |
| "links": null |
| }, |
| "BIBREF16": { |
| "ref_id": "b16", |
| "title": "Jelmer van der Linde, Ineke Schuurman, Erik Tjong Kim Sang, and Vincent Vandeghinste", |
| "authors": [ |
| { |
| "first": "Gosse", |
| "middle": [], |
| "last": "Gertjan Van Noord", |
| "suffix": "" |
| }, |
| { |
| "first": "Frank", |
| "middle": [], |
| "last": "Bouma", |
| "suffix": "" |
| }, |
| { |
| "first": "Dani\u00ebl", |
| "middle": [], |
| "last": "Van Eynde", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "De Kok", |
| "suffix": "" |
| } |
| ], |
| "year": 2013, |
| "venue": "Essential Speech and Language Technology for Dutch: Results by the STEVIN programme", |
| "volume": "", |
| "issue": "", |
| "pages": "147--164", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gertjan van Noord, Gosse Bouma, Frank Van Eynde, Dani\u00ebl de Kok, Jelmer van der Linde, Ineke Schuurman, Erik Tjong Kim Sang, and Vincent Vandeghinste. 2013. Large scale syntactic annotation of written Dutch: Lassy. In Peter Spyns and Jan Odijk, editors, Essential Speech and Language Technology for Dutch: Results by the STEVIN programme, pages 147-164. Springer Berlin Heidelberg, Berlin, Heidelberg.", |
| "links": null |
| }, |
| "BIBREF18": { |
| "ref_id": "b18", |
| "title": "SPOD: Syntactic profiler of Dutch", |
| "authors": [ |
| { |
| "first": "Jack", |
| "middle": [], |
| "last": "Gertjan Van Noord", |
| "suffix": "" |
| }, |
| { |
| "first": "Peter", |
| "middle": [], |
| "last": "Hoeksema", |
| "suffix": "" |
| }, |
| { |
| "first": "Gosse", |
| "middle": [], |
| "last": "Kleiweg", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Bouma", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "Computational Linguistics in the Netherlands Journal", |
| "volume": "10", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gertjan van Noord, Jack Hoeksema, Peter Kleiweg, and Gosse Bouma. 2020. SPOD: Syntactic profiler of Dutch. Computational Linguistics in the Netherlands Journal, 10. Accepted.", |
| "links": null |
| }, |
| "BIBREF19": { |
| "ref_id": "b19", |
| "title": "At Last Parsing Is Now Operational", |
| "authors": [ |
| { |
| "first": "", |
| "middle": [], |
| "last": "Gertjan Van Noord", |
| "suffix": "" |
| } |
| ], |
| "year": 2006, |
| "venue": "TALN 2006 Verbum Ex Machina, Actes De La 13e Conference sur Le Traitement Automatique des Langues naturelles", |
| "volume": "", |
| "issue": "", |
| "pages": "20--42", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gertjan van Noord. 2006. At Last Parsing Is Now Operational. In TALN 2006 Verbum Ex Machina, Actes De La 13e Conference sur Le Traitement Automatique des Langues naturelles, pages 20-42, Leuven.", |
| "links": null |
| }, |
| "BIBREF20": { |
| "ref_id": "b20", |
| "title": "Huge parsed corpora in Lassy", |
| "authors": [ |
| { |
| "first": "", |
| "middle": [], |
| "last": "Gertjan Van Noord", |
| "suffix": "" |
| } |
| ], |
| "year": 2009, |
| "venue": "Proceedings of the Seventh International Workshop on Treebanks and Linguistic Theories", |
| "volume": "", |
| "issue": "", |
| "pages": "115--126", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gertjan van Noord. 2009. Huge parsed corpora in Lassy. In Frank van Eynde, Anette Frank, Koenraad De Smedt, and Gertjan van Noord, editors, Proceedings of the Seventh International Workshop on Treebanks and Linguistic Theories (TLT 7), number 12 in LOT Occasional Series, pages 115-126, Utrecht, The Netherlands. Netherlands Graduate School of Linguistics.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "text": ":sentence) -[:rel{rel: 'top'}]-> (:node{cat: 'top'}) (:node) -[:rel]-> (:node) (:node) -[:rel]-> (:word) (:node) -[:rel]-> (:nw) The standard UD-type dependencies look as follows: (:sentence) -[:ud{rel: 'root'}]-> (:word) (:word) -[:ud]-> (:word) And words are connected by means of the :next edges: (:word) -[:next]-> (:word)", |
| "type_str": "figure", |
| "uris": null, |
| "num": null |
| }, |
| "FIGREF1": { |
| "text": "Original Lassy annotation of Het brood wordt gebakken (left) and the representation in Alpino-Graph (right), displaying two (:rel and :ud) of the available representation layers.", |
| "type_str": "figure", |
| "uris": null, |
| "num": null |
| }, |
| "FIGREF2": { |
| "text": "Annotation of Voor kapitein Rijkers \"(ik was geen ogenblik bang)\" was dit de derde schipbreuk", |
| "type_str": "figure", |
| "uris": null, |
| "num": null |
| }, |
| "FIGREF5": { |
| "text": "however, a major alarm was immediately raised\" Representation of Wel werd meteen groot alarm geslagen in Lassy XML (left) and the :rel representation layer in AlpinoGraph (right)", |
| "type_str": "figure", |
| "uris": null, |
| "num": null |
| }, |
| "FIGREF6": { |
| "text": "Timing all queries. Note the logarithmic scale. All results above the straight line are cases where the Cypher queries are faster. The few results below the line indicate queries for which the Cypher queries were slower.", |
| "type_str": "figure", |
| "uris": null, |
| "num": null |
| }, |
| "FIGREF7": { |
| "text": "node{cat:'smain'}) -[:rel{rel:'hd'}]-> (fin:word) match (n) -[:rel*{primary:true}]-> (topic:nw) -[rel:rel*0..1]-> (htopic:nw) where ( ( not htopic.lemma is null ) and htopic.begin < fin.begin and ( length(rel) = 0 or rel[0].rel in ['hd','cmp','crd'] ) ) or ( topic.begin < fin.begin and topic.end <= fin.begin ) return topic.sentid as sentid, topic.id as id, n.id as nid except match (n:node{cat:'smain'}) -[:rel{rel:'hd'}]-> (fin:word) match (n) -[:rel*{primary:true}]-> (topic:nw) -[rel:rel*0..1]-> (htopic:nw) where ( ( not htopic.lemma is null )", |
| "type_str": "figure", |
| "uris": null, |
| "num": null |
| } |
| } |
| } |
| } |
