| LPath +: A First-Order Complete Language for Linguistic Tree Query (2008) | |||||||||||||||
Abstract | |||||||||||||||
| Large databases of linguistic annotations are used for testing linguistic hypotheses, and for training language processing models. Linguistic annotations are often syntactic or prosodic and typically have a tree structure. Our goal is to develop a language that can express a wide range of linguistic tree queries and has an efficient implementation. We argue that by adding some simple closures to the LPath language, we can meet this goal. We call this new addition to the XPath family LPath +. We place LPath and LPath + in the hierarchy of XPath languages and conclude that LPath + is first-order complete over trees. This means LPath + is efficiently implementable in SQL. 1 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||