English
Related papers

Related papers: Ultrametric Distance in Syntax

200 papers

Given a distance matrix consisting of pairwise distances between species, a distance-based phylogenetic reconstruction method returns a tree metric or equidistant tree metric (ultrametric) that best fits the data. We investigate…

Combinatorics · Mathematics 2017-02-20 Daniel Irving Bernstein , Colby Long

This paper provides a geometric characterization of subclasses of the regular languages. We use finite model theory to characterize objects like strings and trees as relational structures. Logical statements meeting certain criteria over…

Formal Languages and Automata Theory · Computer Science 2019-08-23 Jonathan Rawski

Networks are structures that encode relationships between pairs of elements or nodes. However, there is no imposed connection between these relationships, i.e., the relationship between two nodes can be independent of every other one in the…

Social and Information Networks · Computer Science 2025-09-30 Santiago Segarra , Gunnar Carlsson , Facundo Memoli , Alejandro Ribeiro

Graphs are interesting structures: extremely useful to depict real-life problems, extremely easy to understand given a sketch, extremely complicated to represent formally, extremely complicated to compare. Phylogeny is the study of the…

Data Structures and Algorithms · Computer Science 2019-01-18 Bernardo Lopo Tavares

Based on solid theoretical foundations, we present strong evidences that a number of real-life networks, taken from different domains like Internet measurements, biological data, web graphs, social and collaboration networks, exhibit…

Social and Information Networks · Computer Science 2014-02-24 Muad Abu-Ata , Feodor F. Dragan

The matrices of spanning rooted forests are studied as a tool for analysing the structure of digraphs and measuring their characteristics. The problems of revealing the basis bicomponents, measuring vertex proximity, and ranking from…

Combinatorics · Mathematics 2007-05-23 Pavel Chebotarev , Rafig Agaev

Human language is known to exhibit a nested, hierarchical structure, allowing us to form complex sentences out of smaller pieces. However, many state-of-the-art neural networks models such as Transformers have no explicit hierarchical…

Computation and Language · Computer Science 2023-07-12 Nilay Patel , Jeffrey Flanigan

This paper introduces \textit{measurement trees}, a novel class of metrics designed to combine various constructs into an interpretable multi-level representation of a measurand. Unlike conventional metrics that yield single values,…

Artificial Intelligence · Computer Science 2025-10-01 Craig Greenberg , Patrick Hall , Theodore Jensen , Kristen Greene , Razvan Amironesei

Given a non-negative $n \times n$ matrix viewed as a set of distances between $n$ points, we consider the property testing problem of deciding if it is a metric. We also consider the same problem for two special classes of metrics, tree…

Discrete Mathematics · Computer Science 2024-11-15 Yiqiao Bao , Sampath Kannan , Erik Waingarten

A central question in psycholinguistics is the timing of syntax in sentence processing. Much of the existing evidence comes from violation paradigms, which conflate two separable processes - syntactic category detection and phrase structure…

Computation and Language · Computer Science 2025-09-30 Nan Wang , Jiaxuan Li

Separation Logic is a widely used formalism for describing dynamically allocated linked data structures, such as lists, trees, etc. The decidability status of various fragments of the logic constitutes a long standing open problem. Current…

Logic in Computer Science · Computer Science 2013-04-02 Radu Iosif , Adam Rogalewicz , Jiri Simacek

Semantics of a sentence is defined with much less ambiguity than semantics of a single word, and we assume that it should be better preserved by translation to another language. If multilingual sentence embeddings intend to represent…

Computation and Language · Computer Science 2024-06-28 Oleg Vasilyev , Fumika Isono , John Bohannon

Given two binary trees on $N$ labeled leaves, the quartet distance between the trees is the number of disagreeing quartets. By permuting the leaves at random, the expected quartets distance between the two trees is…

Combinatorics · Mathematics 2021-01-01 Benny Chor , Péter L. Erdős , Yonatan Komornik

We define, analyze, and give efficient algorithms for two kinds of distance measures for rooted and unrooted phylogenies. For rooted trees, our measures are based on the topologies the input trees induce on triplets; that is, on…

Data Structures and Algorithms · Computer Science 2009-06-30 Mukul S. Bansal , Jianrong Dong , David Fernández-Baca

We propose a novel method of introducing structure into existing machine learning techniques by developing structure-based similarity and distance measures. To learn structural information, low-dimensional structure of the data is captured…

Machine Learning · Statistics 2011-10-27 Joseph Wang , Venkatesh Saligrama , David A. Castañón

Syntax is a latent hierarchical structure which underpins the robust and compositional nature of human language. In this work, we explore the hypothesis that syntactic dependencies can be represented in language model attention…

Computation and Language · Computer Science 2023-10-24 Jasper Jian , Siva Reddy

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle

Human syntactic structures are usually represented as graphs. Much research has focused on the mapping between such graphs and linguistic sequences, but less attention has been paid to the shapes of the graphs themselves: their topologies.…

Computation and Language · Computer Science 2023-02-02 Fermín Moscoso del Prado Martín

In this paper, a unified framework for representing uncertain information based on the notion of an interval structure is proposed. It is shown that the lower and upper approximations of the rough-set model, the lower and upper bounds of…

Artificial Intelligence · Computer Science 2013-03-25 Michael S. K. M. Wong , L. S. Wang , Y. Y. Yao

Sparse structures are frequently sought when pursuing tractability in optimization problems. They are exploited from both theoretical and computational perspectives to handle complex problems that become manageable when sparsity is present.…

Discrete Mathematics · Computer Science 2019-03-21 Yuri Faenza , Gonzalo Muñoz , Sebastian Pokutta