English
Related papers

Related papers: Topology of words

200 papers

Word embeddings are powerful representations that form the foundation of many natural language processing architectures, both in English and in other languages. To gain further insight into word embeddings, we explore their stability (e.g.,…

Computation and Language · Computer Science 2021-09-13 Laura Burdick , Jonathan K. Kummerfeld , Rada Mihalcea

In this text we expose basic cases of some fundamental ideas and methods of topology. Namely, of homotopy, degree, fundamental group, covering, Whitehead invariant, etc. This is done by considering the elementary example: closed polygonal…

History and Overview · Mathematics 2026-05-07 E. Alkin , O. Nikitenko , A. Skopenkov

Attributes of words and relations between two words are central to numerous tasks in Artificial Intelligence such as knowledge representation, similarity measurement, and analogy detection. Often when two words share one or more attributes…

Computation and Language · Computer Science 2014-12-09 Danushka Bollegala , Takanori Maehara , Yuichi Yoshida , Ken-ichi Kawarabayashi

Words can be represented by composing the representations of subword units such as word segments, characters, and/or character n-grams. While such representations are effective and may capture the morphological regularities of words, they…

Computation and Language · Computer Science 2017-04-28 Clara Vania , Adam Lopez

Meaning can be generated when information is related at a systemic level. Such a system can be an observer, but also a discourse, for example, operationalized as a set of documents. The measurement of semantics as similarity in patterns…

Computation and Language · Computer Science 2011-02-01 Loet Leydesdorff , Kasper Welbers

We explore inflectional morphology as an example of the relationship of the discrete and the continuous in linguistics. The grammar requests a form of a lexeme by specifying a set of feature values, which corresponds to a corner M of a…

Computation and Language · Computer Science 2017-03-14 John Goldsmith , Eric Rosen

We investigate the number of sets of words that can be formed from a finite alphabet, counted by the total length of the words in the set. An explicit expression for the counting sequence is derived from the generating function, and…

Combinatorics · Mathematics 2010-01-26 Stefan Gerhold

We study the equality problem for infinite words obtained by iterating morphisms. In particular, we give a practical algorithm to decide whether or not two words generated by primitive morphisms are equal.

Formal Languages and Automata Theory · Computer Science 2009-04-16 Juha Honkala

Identifying the relations that exist between words (or entities) is important for various natural language processing tasks such as, relational search, noun-modifier classification and analogy detection. A popular approach to represent the…

Computation and Language · Computer Science 2017-09-06 Huda Hakami , Danushka Bollegala

Representing the semantics of linguistic items in a machine-interpretable form has been a major goal of Natural Language Processing since its earliest days. Among the range of different linguistic items, words have attracted the most…

Computation and Language · Computer Science 2016-08-04 José Camacho-Collados , Ignacio Iacobacci , Roberto Navigli , Mohammad Taher Pilehvar

We investigate cobordisms of free knots. Free knots and links are also called homotopy classes of Gauss words and phrases. We define a new strong invariant of free knots which allows to detect free knots not cobordant to the trivial one.

Geometric Topology · Mathematics 2009-04-21 Denis Petrovich Ilyutko , Vassily Olegovich Manturov

A standard form of analysis for linguistic typology is the universal implication. These implications state facts about the range of extant languages, such as ``if objects come after verbs, then adjectives come after nouns.'' Such…

Computation and Language · Computer Science 2009-07-07 Hal Daumé , Lyle Campbell

We consider a language together with the subword relation, the cover relation, and regular predicates. For such structures, we consider the extension of first-order logic by threshold- and modulo-counting quantifiers. Depending on the…

Formal Languages and Automata Theory · Computer Science 2019-01-09 Dietrich Kuske , Georg Zetzsche

This thesis investigates how the sub-structure of words can be accounted for in probabilistic models of language. Such models play an important role in natural language processing tasks such as translation or speech recognition, but often…

Computation and Language · Computer Science 2015-08-19 Jan A. Botha

Advances in natural language processing have resulted in increased capabilities with respect to multiple tasks. One of the possible causes of the observed performance gains is the introduction of increasingly sophisticated text…

Computation and Language · Computer Science 2020-11-19 Sarah Tymochko , Zachary New , Lucius Bynum , Emilie Purvine , Timothy Doster , Julien Chaput , Tegan Emerson

Language provides simple ways of communicating generalizable knowledge to each other (e.g., "Birds fly", "John hikes", "Fire makes smoke"). Though found in every language and emerging early in development, the language of generalization is…

Computation and Language · Computer Science 2018-12-17 Michael Henry Tessler , Noah D. Goodman

Does text have an intrinsic curvature? Language is increasingly modeled in curved geometries - hyperbolic spaces for hierarchy, mixed-curvature manifolds for compositional structure - yet a basic scientific question remains unresolved: what…

Machine Learning · Computer Science 2026-02-17 Karish Grover , Hanqing Zeng , Yinglong Xia , Christos Faloutsos , Geoffrey J. Gordon

Word embeddings allow natural language processing systems to share statistical information across related words. These embeddings are typically based on distributional statistics, making it difficult for them to generalize to rare or unseen…

Computation and Language · Computer Science 2016-09-27 Parminder Bhatia , Robert Guthrie , Jacob Eisenstein

Both topos theory and automata theory are known for their multi-faceted nature and relationship with topology, algebra, logic, and category theory. This paper aims to clarify the topos-theoretic aspects of automata theory, particularly…

Formal Languages and Automata Theory · Computer Science 2024-11-19 Ryuya Hora

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