相关论文: D-Tree Grammars

We investigate schema languages for unordered XML having no relative order among siblings. First, we propose unordered regular expressions (UREs), essentially regular expressions with unordered concatenation instead of standard…

The Differentiable Search Index (DSI) is a novel information retrieval (IR) framework that utilizes a differentiable function to generate a sorted list of document identifiers in response to a given query. However, due to the black-box…

A tree functional is called additive if it satisfies a recursion of the form $F(T) = \sum_{j=1}^k F(B_j) + f(T)$, where $B_1,\ldots,B_k$ are the branches of the tree $T$ and $f(T)$ is a toll function. We prove a general central limit…

This paper explores how the Distantly Supervised Relation Extraction (DS-RE) can benefit from the use of a Universal Graph (UG), the combination of a Knowledge Graph (KG) and a large-scale text collection. A straightforward extension of a…

Let T be a weighted tree with n leaves. Let D_{i,j} be the distance between the leaves i and j. Let D_{i,j,k}= (D_{i,j} + D_{j,k} +D_{i,k})/2. We will call such numbers "triple weights" of the tree. In this paper, we give a…

Estimating the structure of directed acyclic graphs (DAGs, also known as Bayesian networks) is a challenging problem since the search space of DAGs is combinatorial and scales superexponentially with the number of nodes. Existing approaches…

This thesis deals with Double Field Theory (DFT), an effective field theory capturing the low energy dynamics of closed strings on a torus. It renders T-duality on a torus manifest by adding $D$ winding coordinates in addition to the $D$…

We present a new and powerful algebraic framework for graph rewriting, based on drags, a class of graphs enjoying a novel composition operator. Graphs are embellished with roots and sprouts, which can be wired together to form edges. Drags…

In this paper, we present a novel Deep Triphone Embedding (DTE) representation derived from Deep Neural Network (DNN) to encapsulate the discriminative information present in the adjoining speech frames. DTEs are generated using a four…

Tree tensor networks (TTNs) provide a compact and structured representation of high-dimensional data, making them valuable in various areas of computational mathematics and physics. In this paper, we present a rigorous mathematical…

We consider special cases of the two tree degree sequences problem. We show that if two tree degree sequences do not have common leaves then they always have edge-disjoint caterpillar realizations. By using a probabilistic method, we prove…

The $k^2$-tree is a successful compact representation of binary relations that exhibit sparseness and/or clustering properties. It can be extended to $d$ dimensions, where it is called a $k^d$-tree. The representation boils down to a long…

This paper is an extended abstract of an analysis of term rewriting where the terms in the rewrite rules as well as the term to be rewritten are compressed by a singleton tree grammar (STG). This form of compression is more general than…

We introduce DsDs: a cross-lingual neural part-of-speech tagger that learns from disparate sources of distant supervision, and realistically scales to hundreds of low-resource languages. The model exploits annotation projection, instance…

An optimal binary search tree for an access sequence on elements is a static tree that minimizes the total search cost. Constructing perfectly optimal binary search trees is expensive so the most efficient algorithms construct almost…

Head-driven phrase structure grammar (HPSG) enjoys a uniform formalism representing rich contextual syntactic and even semantic meanings. This paper makes the first attempt to formulate a simplified HPSG by integrating constituent and…

Btree and Rtree are two basic index structures; many different variants of them are proposed after them. Different variants are used in specific application for the performance optimization. In this paper different variants of Btree and…

We analyze breaking of symmetries that belong to the double point group D2h(TD) (three mutually perpendicular symmetry axes of the second order, inversion, and time reversal). Subgroup structure of the D2h(TD) group indicates that there can…

Subgraph matching is a fundamental building block for graph-based applications and is challenging due to its high-order combinatorial nature. Existing studies usually tackle it by combinatorial optimization or learning-based methods.…

Speculative decoding accelerates autoregressive language models by using a lightweight drafter to propose multiple future tokens, which the target model then verifies in parallel. DFlash shows that a block diffusion drafter can generate an…