English
Related papers

Related papers: The complexity of tangent words

200 papers

In this paper we collect the main properties of free curves in the complex projective plane and a lot of conjectures and open problems, both old and new. In the quest to understand the mystery of free curves, many tools were developed and…

Algebraic Geometry · Mathematics 2023-12-22 Alexandru Dimca

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

The piecewise complexity $h(u)$ of a word is the minimal length of subwords needed to exactly characterise $u$. Its piecewise minimality index $\rho(u)$ is the smallest length $k$ such that $u$ is minimal among its order-$k$ class $[u]_k$…

Formal Languages and Automata Theory · Computer Science 2024-12-24 Philippe Schnoebelen , Isa Vialard

Linguistic variables represent crisp information in a form and precision appropriate for the problem. For example, to answer the question "How are you?" one may say "I am fine." the linguistic variables like "fine", so common in everyday…

Formal Languages and Automata Theory · Computer Science 2011-12-16 Supriya Raheja , Reena Dhadich , Smita Rajpal

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

We give a language for geometry which makes curves and number fields look alike.

Number Theory · Mathematics 2009-11-19 Shai M. J. Haran

We explain how certain tools from convex analysis and probability theory may be used in order to obtain counting results for the number of words with prescribed frequencies of letters in regular languages.

Combinatorics · Mathematics 2023-11-20 Rostislav Grigorchuk , Jean-François Quint

Lexical ambiguities naturally arise in languages. We present Lamb, a lexical analyzer that produces a lexical analysis graph describing all the possible sequences of tokens that can be found within the input string. Parsers can process such…

Computation and Language · Computer Science 2012-03-01 Luis Quesada , Fernando Berzal , Francisco J. Cortijo

The average uncertainty associated with words is an information-theoretic concept at the heart of quantitative and computational linguistics. The entropy has been established as a measure of this average uncertainty - also called average…

Computation and Language · Computer Science 2016-06-23 Christian Bentz , Dimitrios Alikaniotis

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

Infinite words, also known as streams, hold significant interest in computer science and mathematics, raising the natural question of how their complexity should be measured. We introduce cellular automaton reducibility as a measure of…

Formal Languages and Automata Theory · Computer Science 2026-01-30 Markel Zubia , Herman Geuvers

In this paper, we assess the complexity results of formalisms that describe the feature theories used in computational linguistics. We show that from these complexity results no immediate conclusions can be drawn about the complexity of the…

cmp-lg · Computer Science 2008-02-03 Marten Trautwein

This paper is an extended abstract of the dissertation presented by the author for the doctoral degree in physics and mathematics (in Russia). The main characteristic studied in the dissertation is combinatorial complexity, which is a…

Formal Languages and Automata Theory · Computer Science 2010-10-27 Arseny M. Shur

The height of a piecewise-testable language $L$ is the maximum length of the words needed to define $L$ by excluding and requiring given subwords. The height of $L$ is an important descriptive complexity measure that has not yet been…

Logic in Computer Science · Computer Science 2023-06-22 Prateek Karandikar , Philippe Schnoebelen

An atom of a regular language L with n (left) quotients is a non-empty intersection of uncomplemented or complemented quotients of L, where each of the n quotients appears in a term of the intersection. The quotient complexity of L, which…

Formal Languages and Automata Theory · Computer Science 2012-03-09 Janusz Brzozowski , Hellis Tamm

The Chapter starts with introductory information about quantitative linguistics notions, like rank--frequency dependence, Zipf's law, frequency spectra, etc. Similarities in distributions of words in texts with level occupation in quantum…

Data Analysis, Statistics and Probability · Physics 2024-01-04 Andrij Rovenchak

In the talk at the workshop my aim was to demonstrate the usefulness of graph techniques for tackling problems that have been studied predominantly as problems on the term level: increasing sharing in functional programs, and addressing…

Logic in Computer Science · Computer Science 2019-02-07 Clemens Grabmayer

We study the entropy of Chinese and English texts, based on characters in case of Chinese texts and based on words for both languages. Significant differences are found between the languages and between different personal styles of debating…

Computation and Language · Computer Science 2017-01-17 R. R. Xie , W. B. Deng , D. J. Wang , L. P. Csernai

There are many scientific problems generated by the multiple and conflicting alternative definitions of linguistic recursion and human recursive processing that exist in the literature. The purpose of this article is to make available to…

Computation and Language · Computer Science 2009-09-22 P. Gilkey , S. Lopez Ornat , A. Karousou

The work reported here is the result of a study done within a larger project on the ``Semantics of Natural Languages'' viewed from the field of Artificial Intelligence and Computational Linguistics. In this project, we have chosen a corpus…

cmp-lg · Computer Science 2016-08-31 Dominique Estival , Francoise Gayral