In predicate-argument structure analysis, it is important to capture non-local dependencies among arguments and interdependencies between the sense of a predicate and the semantic roles of its arguments. However, no existing approach explicitly handles both non-local dependencies and semantic dependencies between predicates and arguments.
HIS BOOK, LIKE THE first and second editions before it, is for the
working SQL programmer who wants to pick up some advanced
programming tips and techniques. It assumes that the reader is an
SQL programmer with a year or more of experience. It is not an
introductory book, so let’s not have any gripes in the Amazon.com
reviews about that, as we did with the prior editions.
The first edition was published ten years ago and became a minor
classic among working SQL programmers.
Continuous queries are persistent queries that allow users to
receive new results when they become available. While
continuous query systems can transform a passive web into an
active environment, they need to be able to support millions of
queries due to the scale of the Internet. No existing systems have
achieved this level of scalability. NiagaraCQ addresses this
problem by grouping continuous queries based on the
observation that many web queries share similar structures.
Query processing in the original TinyDB implementation
works as follows. The query is input on the user’s PC, or
basestation. This query is optimized to improve execution;
currently, TinyDB only considers the order of selection
predicates during optimization (as the existing version does
not support joins). Once optimized, the query is translated
into a sensor-network specific format and injected into the
network via a gateway node.
In the Japanese language, as a predicate is placed at the end of a sentence, the content of a sentence cannot be inferred until reaching the end. However, when the content is complicated and the sentence is long, people want to know at an earlier stage in the sentence whether the content is negative, affirmative, or interrogative. In Japanese, the grammatical form called the KO-OU relation exists. The KO-OU relation is a kind of concord. If a KO element appears, then an OU element appears in the latter part of a sentence. ...
This paper describes a wide-coverage statistical parser that uses Combinatory Categorial Grammar (CCG) to derive dependency structures. The parser differs from most existing wide-coverage treebank parsers in capturing the long-range dependencies inherent in constructions such as coordination, extraction, raising and control, as well as the standard local predicate-argument dependencies. A set of dependency structures used for training and testing the parser is obtained from a treebank of CCG normal-form derivations, which have been derived (semi-) automatically from the Penn Treebank. ...
Existing work in the extraction of commonsense knowledge from text has been primarily restricted to factoids that serve as statements about what may possibly obtain in the world. We present an approach to deriving stronger, more general claims by abstracting over large sets of factoids. Our goal is to coalesce the observed nominals for a given predicate argument into a few predominant types, obtained as WordNet synsets. The results can be construed as generically quantiﬁed sentences restricting the semantic type of an argument position of a predicate....
For sentence compression, we propose new semantic constraints to directly capture the relations between a predicate and its arguments, whereas the existing approaches have focused on relatively shallow linguistic properties, such as lexical and syntactic information. These constraints are based on semantic roles and superior to the constraints of syntactic dependencies.