SETS: Scalable and Efficient Tree Search in Dependency Graphs
Jenna Kanerva; Filip Ginter; Juhani Luotolahti; Sampo Pyysalo
SETS: Scalable and Efficient Tree Search in Dependency Graphs
Jenna Kanerva
Filip Ginter
Juhani Luotolahti
Sampo Pyysalo
Julkaisun pysyvä osoite on:
https://urn.fi/URN:NBN:fi-fe2021042714407
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.
https://urn.fi/URN:NBN:fi-fe2021042714407
Tiivistelmä
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.
Kokoelmat
- Rinnakkaistallenteet [19207]