Efficient Dependency Graph Matching with the IMS Open Corpus Workbench

Thomas Proisl, Peter Uhrig


Abstract
State-of-the-art dependency representations such as the Stanford Typed Dependencies may represent the grammatical relations in a sentence as directed, possibly cyclic graphs. Querying a syntactically annotated corpus for grammatical structures that are represented as graphs requires graph matching, which is a non-trivial task. In this paper, we present an algorithm for graph matching that is tailored to the properties of large, syntactically annotated corpora. The implementation of the algorithm is built on top of the popular IMS Open Corpus Workbench, allowing corpus linguists to re-use existing infrastructure. An evaluation of the resulting software, CWB-treebank, shows that its performance in real world applications, such as a web query interface, compares favourably to implementations that rely on a relational database or a dedicated graph database while at the same time offering a greater expressive power for queries. An intuitive graphical interface for building the query graphs is available via the Treebank.info project.
Anthology ID:
L12-1412
Volume:
Proceedings of the Eighth International Conference on Language Resources and Evaluation (LREC'12)
Month:
May
Year:
2012
Address:
Istanbul, Turkey
Venue:
LREC
SIG:
Publisher:
European Language Resources Association (ELRA)
Note:
Pages:
2750–2756
Language:
URL:
http://www.lrec-conf.org/proceedings/lrec2012/pdf/709_Paper.pdf
DOI:
Bibkey:
Cite (ACL):
Thomas Proisl and Peter Uhrig. 2012. Efficient Dependency Graph Matching with the IMS Open Corpus Workbench. In Proceedings of the Eighth International Conference on Language Resources and Evaluation (LREC'12), pages 2750–2756, Istanbul, Turkey. European Language Resources Association (ELRA).
Cite (Informal):
Efficient Dependency Graph Matching with the IMS Open Corpus Workbench (Proisl & Uhrig, LREC 2012)
Copy Citation:
PDF:
http://www.lrec-conf.org/proceedings/lrec2012/pdf/709_Paper.pdf