Results 111 to 120 of about 2,068 (237)
One final dictionary from the first Faroese lexicographer
The Faroe Islands’ first lexicographer kept producing manuscripts of his dictionary until his death on 14 February 1824.
Vrieland, Seán D.
core +1 more source
The learner as lexicographer: using monolingual and bilingual corpora to deepen vocabulary knowledge
Acta Linguistica Asiatica, 2014 Learning vocabulary is one of the most challenging tasks faced by learners with a non-kanji background when learning Japanese as a foreign language. However, learners are often not aware of the range of different aspects of word knowledge they need in ...
Kristina HMELJAK SANGAWA
doaj +1 more source
Editorial: Spanish psycholinguistics in the 21st century. [PDF]
Front Psychol, 2022 Duñabeitia JA +3 more
europepmc +1 more source
Two Self‐Stabilizing Algorithms for the Maximal Pentagon Partitioning Problem
Concurrency and Computation: Practice and Experience, Volume 38, Issue 19, October 2026.ABSTRACT Given an undirected graph G=(V,E)$$ G=\left(V,E\right) $$, a collection of disjoint subsets of nodes π={V1,…,Vk}(V=V1∪⋯∪Vk)$$ \pi =\left\{{V}_1,\dots, {V}_k\right\}\kern0.3em \left(V={V}_1\cup \cdots \cup {V}_k\right) $$ is called a pentagon partition if each subset Vi(1≤i≤k)$$ {V}_i\kern0.3em \left(1\le i\le k\right) $$ satisfies one of the ...
Tota Yamada +2 more
wiley +1 more source
L’élaboration d’une banque de données textuelles du breton
La Bretagne Linguistique, 1993 The dictionaries of all the major languages with a long lexicographical tradition are generally referenced to the written language, particularly the literary language.
Yves Le Berre, Jean Le Dû
doaj +1 more source
'To Prone' or not 'To Prone': that is the grammatical question. [PDF]
Intensive Care Med, 2021 Wall A.
europepmc +1 more source
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, Volume 113, Issue 2, Page 252-273, October 2026.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 )
wiley +1 more source
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, Volume 113, Issue 2, Page 169-194, October 2026.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
Hermes, 2006 Multiword expressions – i.e. phraseological units – like idioms and collocations are one of the most interesting part of every language. In this article, I investigate phraseological units from a lexicographical point of view.
Erla Hallsteinsdóttir
doaj +1 more source
Analysis of Eigenvalue Clustering Leads to Optimal Scaling in Numerical Radiative Transfer
Numerical Linear Algebra with Applications, Volume 33, Issue 5, October 2026.ABSTRACT We consider a multidimensional polychromatic radiative transfer (RT) problem, accounting for scattering processes in a general form, that is, anisotropic (dipole) scattering with partial frequency redistribution. Given a discrete ordinates (SN$$ {S}_N $$) discretization, we report the corresponding matrix structures, depending on the model and
Pietro Benedusi +3 more
wiley +1 more source