Results 21 to 30 of about 14,101 (174)
The model of digitising archival lexicographic publications for the web
Studia LexicographicaThe paper presents a model designed to digitise old lexicographic publications from The Miroslav Krleža Institute of Lexicography for online publication (e-bastina.lzmk.hr).
Cvijeta Kraus +2 more
doaj +1 more source
The Utilisation of Outer Texts in the Practical Lexicography of African Languages [PDF]
, 2010 <p>ABSTRACT: In this article, an analysis of the utilisation of outer texts in recently compiled dictionaries of African languages is presented.
Dion Nkomo +5 more
core +1 more source
Protumodernost modernoga – pjesnički protusvijet Julija Benešića
Poznańskie Studia Slawistyczne, 2019 This article deals with the poetry of Julije Benešić (his collection Istrgnuti listovi – Torn Pages) in the context of Croatian modernist poetry based on three assumptions: the first, deductive one is that Benešić’s literary, literary-historical ...
Tea Rogić Musa
doaj +1 more source
, 2013 He aquí una breve presentación de los artículos publicados en este número extraordinario dedicado a la lexicografía dialectal y a los resultados obtenidos de los diferentes proyectos en curso. Los trabajos se centran en diversos aspectos de la presencia de los dialectos en diccionarios ya publicados, algunos de ellos históricos, así como en los ...
Fukushima, Chitsuko +2 more
openaire +3 more sources
Not mere lexicographic cosmetics: the compilation and structural features of Isichazamazwi SezoMculo [PDF]
, 2009 This article offers a brief overview of the compilation of the Ndebele music terms dictionary, Isichazamazwi SezoMculo (henceforth the ISM), paying particular attention to its struc-tural features.
Nkomo, Dion +5 more
core +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, EarlyView.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
Studia Lexicographica, 2021 The Miroslav Krleža Institute of Lexicography has been publishing general purpose geographical atlases since the 1960s. The most prominent of these is the World Atlas, which has seen seven editions, edited by several editors-in-chief, who mostly retained
Ivana Crljenko
doaj +1 more source
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, EarlyView.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
The Tshivenḓa-English Ṱahalusamaipfi/Dictionary as a Product of South African Lexicographic Processes [PDF]
, 2010 <p>ABSTRACT: The publication of a dictionary is regarded as the result of a lexicographic process. Three subtypes of a lexicographic process have been noted, namely the primary comprehensive, the secondary comprehensive and the dictionary specific ...
Dion Nkomo +7 more
core +1 more source
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, EarlyView.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source