SETS: Scalable and Efficient Tree Search in Dependency Graphs

Tietueen suppeat tiedot
dc.contributor.authorJuhani Luotolahti
dc.contributor.authorJenna Kanerva
dc.contributor.authorSampo Pyysalo
dc.contributor.authorFilip Ginter
dc.contributor.organizationfi=tietojenkäsittelytiede|en=Computer Science|
dc.contributor.organization-code2606803
dc.converis.publication-id2024928
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/2024928
dc.date.accessioned2022-10-28T14:05:11Z
dc.date.available2022-10-28T14:05:11Z
dc.description.abstract<div> 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.</div>
dc.format.pagerange55
dc.identifier.isbn978-1-941643-49-5
dc.identifier.olddbid186172
dc.identifier.oldhandle10024/169266
dc.identifier.urihttps://www.utupub.fi/handle/11111/32233
dc.identifier.urlhttps://aclweb.org/anthology/N/N15/N15-3011.pdf
dc.identifier.urnURN:NBN:fi-fe2021042714407
dc.language.isoen
dc.okm.affiliatedauthorLuotolahti, Matti
dc.okm.affiliatedauthorKanerva, Jenna
dc.okm.affiliatedauthorPyysalo, Sampo
dc.okm.affiliatedauthorGinter, Filip
dc.okm.discipline113 Computer and information sciencesen_GB
dc.okm.discipline113 Tietojenkäsittely ja informaatiotieteetfi_FI
dc.okm.internationalcopublicationnot an international co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA4 Conference Article
dc.publisher.countryUnited Statesen_GB
dc.publisher.countryYhdysvallat (USA)fi_FI
dc.publisher.country-codeUS
dc.relation.conferenceCONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS
dc.source.identifierhttps://www.utupub.fi/handle/10024/169266
dc.titleSETS: Scalable and Efficient Tree Search in Dependency Graphs
dc.title.bookProceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Demonstrations
dc.year.issued2015

Tiedostot

Näytetään 1 - 1 / 1
Name:
paper.pdf
Size:
241.84 KB
Format:
Adobe Portable Document Format
Lataa

Kokoelmat

Rinnakkaistallenteet