A4 Refereed article in a conference publication
SETS: Scalable and Efficient Tree Search in Dependency Graphs
Authors: Juhani Luotolahti, Jenna Kanerva, Sampo Pyysalo, Filip Ginter
Editors: Rada Mihalcea, Joyce Chai, Anoop Sarkar
Conference name: CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS
Publication year: 2015
Book title : Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Demonstrations
First page : 51
Last page: 55
Number of pages: 5
ISBN: 978-1-941643-49-5
Web address : https://aclweb.org/anthology/N/N15/N15-3011.pdf(external)
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. |  |
