English
Related papers

Related papers: Density of rational languages under shift invarian…

200 papers

In this thesis, we study the place of regular languages within the communication complexity setting. In particular, we are interested in the non-deterministic communication complexity of regular languages. We show that a regular language…

Computational Complexity · Computer Science 2008-02-01 Anil Ada

Recent approaches to cross-lingual word embedding have generally been based on linear transformations between the sets of embedding vectors in the two languages. In this paper, we propose an approach that instead expresses the two…

Computation and Language · Computer Science 2019-10-08 Chunting Zhou , Xuezhe Ma , Di Wang , Graham Neubig

Current definitions of notions of lexical density and semantic weight are based on the division of words into closed and open classes, and on intuition. This paper develops a computationally tractable definition of semantic weight,…

cmp-lg · Computer Science 2008-02-03 Mark Dras

The languages of infinite timed words accepted by timed automata are traditionally defined using Buchi-like conditions. These acceptance conditions focus on the set of locations visited infinitely often along a run, but completely ignore…

Formal Languages and Automata Theory · Computer Science 2013-09-12 Nathalie Bertrand , Patricia Bouyer , Thomas Brihaye , Amelie Stainer

Zipf's law of abbreviation, namely the tendency of more frequent words to be shorter, has been viewed as a manifestation of compression, i.e. the minimization of the length of forms -- a universal principle of natural communication.…

Computation and Language · Computer Science 2026-03-31 Sonia Petrini , Antoni Casas-i-Muñoz , Jordi Cluet-i-Martinell , Mengxue Wang , Christian Bentz , Ramon Ferrer-i-Cancho

Words shift in meaning for many reasons, including cultural factors like new technologies and regular linguistic processes like subjectification. Understanding the evolution of language and culture requires disentangling these underlying…

Computation and Language · Computer Science 2016-09-27 William L. Hamilton , Jure Leskovec , Dan Jurafsky

Word embeddings are computed by a class of techniques within natural language processing (NLP), that create continuous vector representations of words in a language from a large text corpus. The stochastic nature of the training process of…

Computation and Language · Computer Science 2020-08-03 Lucas Rettenmeier

Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…

Dynamical Systems · Mathematics 2020-04-14 Dan Rust , Timo Spindeler

The evaluative character of a word is called its semantic orientation. Positive semantic orientation indicates praise (e.g., "honest", "intrepid") and negative semantic orientation indicates criticism (e.g., "disturbing", "superfluous").…

Computation and Language · Computer Science 2007-05-23 Peter D. Turney , Michael L. Littman

Lexical semantic typology has identified important cross-linguistic generalizations about the variation and commonalities in polysemy patterns---how languages package up meanings into words. Recent computational research has enabled…

Computation and Language · Computer Science 2020-06-04 Ella Rabinovich , Yang Xu , Suzanne Stevenson

We consider the problem of computing the measure of a regular set of infinite binary trees. While the general case remains unsolved, we show that the measure of a language can be computed when the set is given in one of the following three…

Formal Languages and Automata Theory · Computer Science 2020-02-03 Marcin Przybyłko , Michał Skrzypczak

Languages emerge and change over time at the population level though interactions between individual speakers. It is, however, hard to directly observe how a single speaker's linguistic innovation precipitates a population-wide change in…

Computation and Language · Computer Science 2021-06-04 Richard A Blythe , William Croft

We consider the problem of inferring the probability distribution associated with a language, given data consisting of an infinite sequence of elements of the languge. We do this under two assumptions on the algorithms concerned: (i) like a…

Machine Learning · Computer Science 2014-07-16 Paul M. B. Vitanyi , Nick Chater

We resolve a long-standing open question on the relationship between measure-theoretic dynamical complexity and symbolic complexity by establishing the exact word complexity at which measure-theoretic strong mixing manifests: For every…

Dynamical Systems · Mathematics 2025-10-14 Darren Creutz

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

Formal Languages and Automata Theory · Computer Science 2020-08-27 Mikołaj Bojańczyk

We introduce and study some families of groups whose irreducible characters take values on quadratic extensions of the rationals. We focus mostly on a generalization of inverse semi-rational groups, which we call uniformly semi-rational…

Group Theory · Mathematics 2025-07-01 Ángel del Río , Marco Vergani

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

Artificial Intelligence · Computer Science 2013-03-26 Jerome Lang , Didier Dubois , Henri Prade

The inverse relationship between the length of a word and the frequency of its use, first identified by G.K. Zipf in 1935, is a classic empirical law that holds across a wide range of human languages. We demonstrate that length is one…

Computation and Language · Computer Science 2017-06-02 Stephan C. Meylan , Thomas L. Griffiths

We study a new class of so-called rational-infinitely (or quasi-infinitely) divisible probability laws on the real line. The characteristic functions of these distributions are ratios of the characteristic functions of classical infinitely…

Probability · Mathematics 2025-10-29 Alexey Khartov

Written language is a complex communication signal capable of conveying information encoded in the form of ordered sequences of words. Beyond the local order ruled by grammar, semantic and thematic structures affect long-range patterns in…

Physics and Society · Physics 2010-05-17 Marcelo A. Montemurro , Damian Zanette
‹ Prev 1 3 4 5 6 7 10 Next ›