Latvian and Finnic Linguistic Convergences
نویسندگان
چکیده
منابع مشابه
English-Latvian Toponym Processing: Translation Strategies and Linguistic Patterns
The paper presents a study of a challenging task in machine translation and crosslanguage information retrieval – translation of toponyms. Due to their linguistic and extra-linguistic nature, toponyms deserve a special treatment. The overall translation process includes two stages of processing: dictionary-based and out-ofvocabulary toponym translation. The latter is divided into three steps: s...
متن کاملSpaces not distinguishing convergences
In the present paper we introduce a convergence condition (Σ) and continue the study of “not distinguish” for various kinds of convergence of sequences of real functions on a topological space started in [2] and [3]. We compute cardinal invariants associated with introduced properties of spaces.
متن کاملCONNECTING T AND LATTICE-VALUED CONVERGENCES
$top$-filters can be used to define $top$-convergence spaces in the lattice-valued context. Connections between $top$-convergence spaces and lattice-valued convergence spaces are given. Regularity of a $top$-convergence space has recently been defined and studied by Fang and Yue. An equivalent characterization is given in the present work in terms of convergence of closures of $top$-filters. M...
متن کاملMorphological and molecular convergences in mammalian phylogenetics
Phylogenetic trees reconstructed from molecular sequences are often considered more reliable than those reconstructed from morphological characters, in part because convergent evolution, which confounds phylogenetic reconstruction, is believed to be rarer for molecular sequences than for morphologies. However, neither the validity of this belief nor its underlying cause is known. Here comparing...
متن کاملOn Clique Convergences of Graphs
Let G be a graph and KG be the set of all cliques of G, then the clique graph of G denoted by K(G) is the graph with vertex set KG and two elements Qi, Qj ∈ KG form an edge if and only if Qi ∩ Qj 6= ∅. Iterated clique graphs are defined by K0(G) = G, and K(G) = K(Kn−1(G)) for n > 0. In this paper we determine the number of cliques in K(G) when G = G1+G2, prove a necessary and sufficient conditi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Oriental Society
سال: 1962
ISSN: 0003-0279
DOI: 10.2307/597573