Abstract
Large databases of linguistic annotations are used for testing linguistic hypotheses and for training language processing models. These linguistic annotations are often syntactic or prosodic in nature, and have a hierarchical structure. Query languages are used to select particular structures of interest, or to project out large slices of a corpus for external analysis. Existing languages suffer from a variety of problems in the areas of expressiveness, efficiency, and naturalness for linguistic query. We describe the domain of linguistic trees and discuss the expressive requirements for a query language. Then we present a language that can express a wide range of queries over these trees, and show that the language is first-order complete over trees.
Keywords Linguistic databases  Treebank  Tree query  XPath  Annotation  First order logic
Categories (categorize this paper)
Reprint years 2009, 2010
ISBN(s)
DOI 10.1007/s10849-009-9086-9
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,231
Through your library

References found in this work BETA

Modal Logic.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - Studia Logica 76 (1):142-148.
Dynamic Logic.Lenore D. Zuck & David Harel - 1989 - Journal of Symbolic Logic 54 (4):1480.
Modal Logic.Yde Venema - 2000 - Philosophical Review 109 (2):286-289.

View all 11 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-06-01

Total views
82 ( #143,039 of 2,518,215 )

Recent downloads (6 months)
1 ( #408,577 of 2,518,215 )

How can I increase my downloads?

Downloads

My notes