Results 21 to 30 of about 21,612,637 (211)
Lexicography's identity crisis leads to a shift towards electronic lexicographic tools. The rise of mobile phone and smartphone usage in South Africa also creates the opportunity for lexicographers to exploit a new market.
André Du Plessis
doaj +1 more source
The Utilisation of Outer Texts in the Practical Lexicography of African Languages [PDF]
<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
Lexicografia e ensino: reflexões necessárias
Resumo: A partir de um tratamento inicial acerca do que vem a ser a ciência da Lexicografia e os principais tipos de obras lexicográficas, pretendemos estabelecer uma discussão a respeito da utilização de dicionários no ensino de Língua Portuguesa. Nossa
Rejane Centurion +1 more
doaj +1 more source
Development in Lexicography: From Polyfunctional to Monofunctional Accounting Dictionaries
This article describes the theoretical foundation of the accounting dictionaries as well as its practical results. Furthermore, the implementation of the project shows how the constant interaction of lexicographical theory with practical dictionary work ...
Sandro Nielsen, Pedro A. Fuertes-Olivera
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
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
A Coarse Geometric Approach to Graph Layout Problems
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
Os dicionários para aprendizes de línguas estrangeiras são obras relativamente recentes no mercado editorial e atendem uma demanda por obras pedagógicas que foi ignorada pelos lexicógrafos durante muito tempo.
Magali Sanches Duran +1 more
doaj +1 more source
Four‐Dimensional pp‐Wave Lie Groups and Harmonic Curvature
ABSTRACT We determine all four‐dimensional Lie groups which have harmonic curvature. In parallel, a description of four‐dimensional pp‐wave Lie groups is obtained.
E. García‐Río +2 more
wiley +1 more source
Not mere lexicographic cosmetics: the compilation and structural features of Isichazamazwi SezoMculo [PDF]
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

