Querying Linguistic Treebanks with Monadic Second-Order Logic in Linear Time
Author: Kepser, Stephan
Source: Journal of Logic, Language and Information, Volume 13, Number 4, March 2004 , pp. 457-470(14)
Abstract:In recent years large amounts of electronic texts have become available. While the first of these corpora had only a low level of annotation, the more recent ones are annotated with refined syntactic information. To make these rich annotations accessible for linguists, the development of query systems has become an important goal. One of the main difficulties in this task consists in the choice of the right query language, a language which at the same time should be powerful enough to let users formulate the queries they want and which should be efficiently evaluable to keep query response times short. There is a widespread belief that such a query language does not exist. It is therefore the aim of this paper to show that there is indeed a powerful query language that can be efficiently evaluated. We propose the use of monadic second-order logic as a query language. We show that a query in this language can be evaluated in linear time in the size of a tree in the corpus. We also provide examples of complicated linguistic queries expressed in monadic second-order logic thereby demonstrating the high expressive power of the language.
Document Type: Research Article
Affiliations: SFB 441, University of Tübingen, Germany, Email: firstname.lastname@example.org
Publication date: March 1, 2004