Querying Linguistic Trees

  • Authors:
  • Catherine Lai;Steven Bird

  • Affiliations:
  • Department of Linguistics, University of Pennsylvania, Philadelphia, USA 19104-6305;Department of Computer Science and Software Engineering, University of Melbourne, Melbourne, Australia 3010 and Linguistic Data Consortium, University of Pennsylvania, Philadelphia, USA 19104-2653

  • Venue:
  • Journal of Logic, Language and Information
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.