2,623 research outputs found
Graphene: Semantically-Linked Propositions in Open Information Extraction
We present an Open Information Extraction (IE) approach that uses a
two-layered transformation stage consisting of a clausal disembedding layer and
a phrasal disembedding layer, together with rhetorical relation identification.
In that way, we convert sentences that present a complex linguistic structure
into simplified, syntactically sound sentences, from which we can extract
propositions that are represented in a two-layered hierarchy in the form of
core relational tuples and accompanying contextual information which are
semantically linked via rhetorical relations. In a comparative evaluation, we
demonstrate that our reference implementation Graphene outperforms
state-of-the-art Open IE systems in the construction of correct n-ary
predicate-argument structures. Moreover, we show that existing Open IE
approaches can benefit from the transformation process of our framework.Comment: 27th International Conference on Computational Linguistics (COLING
2018
Splitting Spanner Atoms: A Tool for Acyclic Core Spanners
This paper investigates regex CQs with string equalities (SERCQs), a subclass of core spanners. As shown by Freydenberger, Kimelfeld, and Peterfreund (PODS 2018), these queries are intractable, even if restricted to acyclic queries. This previous result defines acyclicity by treating regex formulas as atoms. In contrast to this, we propose an alternative definition by converting SERCQs into FC-CQs - conjunctive queries in FC, a logic that is based on word equations. We introduce a way to decompose word equations of unbounded arity into a conjunction of binary word equations. If the result of the decomposition is acyclic, then evaluation and enumeration of results become tractable. The main result of this work is an algorithm that decides in polynomial time whether an FC-CQ can be decomposed into an acyclic FC-CQ. We also give an efficient conversion from synchronized SERCQs to FC-CQs with regular constraints. As a consequence, tractability results for acyclic relational CQs directly translate to a large class of SERCQs
Hopf Algebras of m-permutations, (m+1)-ary trees, and m-parking functions
The m-Tamari lattice of F. Bergeron is an analogue of the clasical Tamari
order defined on objects counted by Fuss-Catalan numbers, such as m-Dyck paths
or (m+1)-ary trees. On another hand, the Tamari order is related to the product
in the Loday-Ronco Hopf algebra of planar binary trees. We introduce new
combinatorial Hopf algebras based on (m+1)-ary trees, whose structure is
described by the m-Tamari lattices.
In the same way as planar binary trees can be interpreted as sylvester
classes of permutations, we obtain (m+1)-ary trees as sylvester classes of what
we call m-permutations. These objects are no longer in bijection with
decreasing (m+1)-ary trees, and a finer congruence, called metasylvester,
allows us to build Hopf algebras based on these decreasing trees. At the
opposite, a coarser congruence, called hyposylvester, leads to Hopf algebras of
graded dimensions (m+1)^{n-1}, generalizing noncommutative symmetric functions
and quasi-symmetric functions in a natural way. Finally, the algebras of packed
words and parking functions also admit such m-analogues, and we present their
subalgebras and quotients induced by the various congruences.Comment: 51 page
- …