Querying large treebanks : benchmarking GrETEL indexing

Publication type
A2
Publication status
Published
Authors
Vanroy, B., Vandeghinste, V., & Augustinus, L.
Editor
Vincent Vandeghinste and Frank Van Eynde
Journal
COMPUTATIONAL LINGUISTICS IN THE NETHERLANDS JOURNAL
Volume
7
Pagination
145-166
Conference
27th Conference of Computational Linguistics in the Netherlands (Leuven)
Download
(.pdf)
View in Biblio
(externe link)

Abstract

The amount of data that is available for research grows rapidly, yet technology to efficiently interpret and excavate these data lags behind. For instance, when using large treebanks for linguistic research, the speed of a query leaves much to be desired. GrETEL Indexing, or GrInding, tackles this issue. The idea behind GrInding is to make the search space as small as possible before actually starting the treebank search, by pre-processing the treebank at hand. We recursively divide the treebank into smaller parts, called subtree-banks, which are then converted into database files. All subtree-banks are organized according to their linguistic dependency pattern, and labeled as such. Additionally, general patterns are linked to more specific ones. By doing so, we create millions of databases, and given a linguistic structure we know in which databases that structure can occur, leading up to a significant efficiency boost. We present the results of a benchmark experiment, testing the effect of the GrInding procedure on the SoNaR-500 treebank.