A4 Article in conference proceedings
SETS: Scalable and Efficient Tree Search in Dependency Graphs




List of Authors: Juhani Luotolahti, Jenna Kanerva, Sampo Pyysalo, Filip Ginter
Publication year: 2015
Book title *: Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Demonstrations
Number of pages: 5
ISBN: 978-1-941643-49-5

Abstract

We present a syntactic analysis query toolkit geared specifically towards massive dependency parsebanks and morphologically rich languages. The query language allows arbitrary tree queries, including negated branches, and is suitable for querying analyses with rich morphological annotation. Treebanks of over a million words can be comfortably queried on a low-end netbook, and a parsebank with over 100M words on a single consumer-grade server. We also introduce a web-based interface for interactive querying. All contributions are available under open licenses.


Downloadable publication

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.




Last updated on 2019-29-01 at 19:57