SETS: Scalable and Efficient Tree Search in Dependency Graphs

@inproceedings{Luotolahti2015SETSSA,
  title={SETS: Scalable and Efficient Tree Search in Dependency Graphs},
  author={Juhani Luotolahti and Jenna Kanerva and Sampo Pyysalo and Filip Ginter},
  booktitle={HLT-NAACL},
  year={2015}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Anders Björkelund

  • Markus Gärtner, Gregor Thiele, Wolfgang Seeker
  • and Jonas Kuhn.
  • 2013
Highly Influential
3 Excerpts

Universal dependencies 1.0

  • talia Silveira, Maria Simi, Aaron Smith, Reut Tsarfaty, Veronika Vincze, Daniel Zeman
  • 2015

Sophia Ananiadou

  • Pontus Stenetorp, Sampo Pyysalo, Goran Topić, Tomoko Ohta
  • and Jun’ichi Tsujii.
  • 2012
1 Excerpt

T

  • L Douglas
  • Rohde,
  • 2004

Similar Papers

Loading similar papers…