A4 Vertaisarvioitu artikkeli konferenssijulkaisussa
SETS: Scalable and Efficient Tree Search in Dependency Graphs
Tekijät: Juhani Luotolahti, Jenna Kanerva, Sampo Pyysalo, Filip Ginter
Toimittaja: Rada Mihalcea, Joyce Chai, Anoop Sarkar
Konferenssin vakiintunut nimi: CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS
Julkaisuvuosi: 2015
Kokoomateoksen nimi: Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Demonstrations
Aloitussivu: 51
Lopetussivu: 55
Sivujen määrä: 5
ISBN: 978-1-941643-49-5
Verkko-osoite: https://aclweb.org/anthology/N/N15/N15-3011.pdf
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.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
