Results 31 to 40 of about 2,579 (237)
Lexical polysemy according to Chilean nineteenth century grammarians and lexicographers: linguistic attitudes and ideologies [PDF]
El presente trabajo analiza las actitudes hacia la polisemia léxica sostenidas por gramáticos y lexicógrafos chilenos hispanohablantes del siglo XIX.
Rojas Gallardo, Darío
core +1 more source
Essential work, invisible workers: The role of digital curation in COVID‐19 Open Science
Abstract In this paper, we examine the role digital curation practices and practitioners played in facilitating open science (OS) initiatives amid the COVID‐19 pandemic. In Summer 2023, we conducted a content analysis of available information regarding 50 OS initiatives that emerged—or substantially shifted their focus—between 2020 and 2022 to address ...
Irene V. Pasquetto +2 more
wiley +1 more source
Computing Lexicographic Parsings
We give a memory-friendly algorithm computing the compression scheme plcpcomp or lex-parse in linear or near-linear time.
openaire +2 more sources
Abstract Racial inequalities are pervasive in higher education despite concerted efforts to redress issues of access, progression and continuation. Little attention has been paid to how universities themselves construct race within their policy texts.
Benjamin Hart, Mirna Šumatić
wiley +1 more source
Systematising the Microstructure of a Modern Dictionary of the Arabic Language
This article is concerned with studying the influence of conservatism on the modern Arabic lexicography, namely the structure of its dictionary entries and interpretation methods.
Olzhas Mirzakhanovich Shayakhmetov +4 more
doaj +1 more source
Collocation ranking: frequency vs semantics
Collocations play a very important role in language description, especially in identifying meanings of words. Modern lexicography’s inevitable part of meaning deduction are lists of collocates ranked by some statistical measurement.
Nikola Ljubešić +2 more
doaj +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
ABSTRACT Chvátal showed that for any tree T $T$ with k $k$ edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1 $R(T,n)=k(n-1)+1$. For r = 3 $r=3$ or 4, we show that, if T $T$ is an r $r$‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ) $R(T,n)={\rm{\Theta }}({n}^{r-1})$.
Jiaxi Nie
wiley +1 more source
Towards a Typology of Definitions for LSP Dictionaries
Definitions are the pivotal parts of dictionaries. Every lexicographer always strives to write definitions which are not only accurate but also comprehensible to dictionary users.
Deny Arnos Kwary
doaj +1 more source
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke +3 more
wiley +1 more source
World-known lexicographers in the University Library collection [PDF]
The article deals with collection of dictionaries and encyclopedias of the Scientific Library USARB that appeared at the prestigious publishing houses bearing the names of the world-known lexicographers - Pierre Larousse, Noah Webster Jr.
Melnic, Lilia, Ababii, Lilia
core

