English
Related papers

Related papers: Exponent-Strings and Their Edit Distance

200 papers

Abstract Meaning Representation (AMR) is a recently designed semantic representation language intended to capture the meaning of a sentence, which may be represented as a single-rooted directed acyclic graph with labeled nodes and edges.…

Computation and Language · Computer Science 2019-05-30 Rafael T. Anchieta , Marco A. S. Cabezudo , Thiago A. S. Pardo

Fractional superstrings are recently-proposed generalizations of the traditional superstrings and heterotic strings. They have critical spacetime dimensions which are less than ten, and in this paper we investigate model-building for the…

High Energy Physics - Theory · Physics 2009-10-22 Keith R. Dienes , S. -H. Henry Tye

Tandem duplication is the process of inserting a copy of a segment of DNA adjacent to the original position. Motivated by applications that store data in living organisms, Jain et al. (2017) proposed the study of codes that correct tandem…

Information Theory · Computer Science 2018-01-09 Yeow Meng Chee , Johan Chrisnata , Han Mao Kiah , Tuan Thanh Nguyen

We propose a new segmentation evaluation metric, called segmentation similarity (S), that quantifies the similarity between two segmentations as the proportion of boundaries that are not transformed when comparing them using edit distance,…

Computation and Language · Computer Science 2012-06-08 Chris Fournier , Diana Inkpen

Edit distance is a measurement of similarity between two sequences such as strings, point sequences, or polygonal curves. Many matching problems from a variety of areas, such as signal analysis, bioinformatics, etc., need to be solved in a…

Computational Geometry · Computer Science 2020-09-10 Kyle Fox , Xinyi Li

Recently, it was shown that any theory of strings containing the string-replace function (even the most restricted version where pattern/replacement strings are both constant strings) becomes undecidable if we do not impose some kind of…

Logic in Computer Science · Computer Science 2017-11-10 Taolue Chen , Yan Chen , Matthew Hague , Anthony W. Lin , Zhilin Wu

Dot plots are a standard method for local comparison of biological sequences. In a dot plot, a substring to substring distance is computed for all pairs of fixed-size windows in the input strings. Commonly, the Hamming distance is used…

Data Structures and Algorithms · Computer Science 2009-09-11 Peter Krusche , Alexander Tiskin

We revisit the derivation of expurgated error exponents using a method of type class enumeration, which is inspired by statistical-mechanical methods, and which has already been used in the derivation of random coding exponents in several…

Information Theory · Computer Science 2013-01-18 Neri Merhav

We study the duplication with transposition distance between strings of length $n$ over a $q$-ary alphabet and their roots. In other words, we investigate the number of duplication operations of the form $x = (abcd) \to y = (abcbd)$, where…

Information Theory · Computer Science 2020-01-20 Nikita Polyanskii , Ilya Vorobyev

This paper proposes an extension to classical regular expressions by the addition of two operators allowing the inclusion of boolean formulae from the zeroth order logic. These expressions are called constrained expressions. The associated…

Formal Languages and Automata Theory · Computer Science 2015-10-09 Jean-Marc Champarnaud , Ludovic Mignot , Florent Nicart

We introduce a monaural neural speaker embeddings extractor that computes an embedding for each speaker present in a speech mixture. To allow for supervised training, a teacher-student approach is employed: the teacher computes the target…

Audio and Speech Processing · Electrical Eng. & Systems 2023-09-20 Tobias Cord-Landwehr , Christoph Boeddeker , Cătălin Zorilă , Rama Doddipatla , Reinhold Haeb-Umbach

A tandem duplication denotes the process of inserting a copy of a segment of DNA adjacent to its original position. More formally, a tandem duplication can be thought of as an operation that converts a string $S = AXB$ into a string $T =…

Computational Complexity · Computer Science 2021-03-16 Ferdinando Cicalese , Nicolò Pilati

In this paper we introduce a word embedding composition method based on the intuitive idea that a fair embedding representation for a given set of words should satisfy that the new vector will be at the same distance of the vector…

Computation and Language · Computer Science 2024-06-18 Roberto Santana , Mauricio Romero Sicre

Phrase structure trees have a hierarchical structure. In many subjects, most notably in Taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierarchical phrase trees are subject to a similar analysis, which…

Computation and Language · Computer Science 2015-12-04 Mark D. Roberts

We study the Diophantine properties of a new class of transcendental real numbers which contains, among others, Roy's extremal numbers, Bugeaud-Laurent Sturmian continued fractions, and more generally the class of Sturmian type numbers. We…

Number Theory · Mathematics 2022-04-20 Anthony Poëls

Embedding spaces contain interpretable dimensions indicating gender, formality in style, or even object properties. This has been observed multiple times. Such interpretable dimensions are becoming valuable tools in different areas of…

Computation and Language · Computer Science 2024-04-04 Katrin Erk , Marianna Apidianaki

Introduced by Darwiche (2011), sentential decision diagrams (SDDs) are essentially as tractable as ordered binary decision diagrams (OBDDs), but tend to be more succinct in practice. This makes SDDs a prominent representation language, with…

Logic in Computer Science · Computer Science 2016-01-05 Simone Bova

We hereby present a solution to a semantic textual similarity (STS) problem in which it is necessary to match two sentences containing, as the only distinguishing factor, highly specific information (such as names, addresses, identification…

Computation and Language · Computer Science 2023-11-29 Gioele Cadamuro , Marco Gruppo

String theory suggests modifications of our spacetime such as extra dimensions and the existence of a mininal length scale. In models with addidional dimensions, the Planck scale can be lowered to values accessible by future colliders.…

High Energy Physics - Phenomenology · Physics 2009-11-10 S. Hossenfelder , M. Bleicher , H. Stocker

The theory of sequences, supported by many SMT solvers, can model program data types including bounded arrays and lists. Sequences are parameterized by the element data type and provide operations such as accessing elements, concatenation,…

Programming Languages · Computer Science 2025-09-09 Denghang Hu , Taolue Chen , Philipp Rümmer , Fu Song , Zhilin Wu