This article describes a method used to calculate the similarity between short English texts, specifically of sentence length. The described algorithm calculates semantic and word order similarities of two sentences. In order to do so, it uses a structured lexical knowledge base and statistical information from a corpus. The described method works well in determining sentence similarity for mos...

This paper introduces the polarity classification system used by the SI-NAI team for the task 1 at the TASS 2016 workshop. Our approach is based on a supervised learning algorithm over vectors resulting from a weighted vector. This vector is computed using a deep-learning algorithm called Word2Vec. The algorithm is applied so as to generate a word vector from a deep neural net trained over a sp...

Multi-word lexical units are a typical feature of specialized dictionaries, in particular monolingual and bilingual maritime dictionaries. The paper studies the concept of the multi-word lexical unit and considers the similarities and differences of their selection and presentation in monolingual and bilingual maritime dictionaries. The work analyses such issues as the classification of multi-w...

Seksuele verhoudings is net so belangrik vir die gestremde as vir die normale mens. In gesinsbeplanning vir die gestremde is raadgewing een van die belangrikste aspekte. Vir die bepaling van die geskikte gesinsbeplanningsmetode vir die gestremde pasiënt moet die verpleegkundige kennis dra van die genetiese faktore wat met die gestremdheid verband hou, die aard van die gestremdheid, die kliënt s...

We present the lexical-semantic net for German "GermaNet" which integrates conceptual ontological information with lexical semantics, within and across word classes. It is compatible with the Princeton WordNet but integrates principlebased modifications on the constructional and organizational level as well as on the level of lexical and conceptual relations. GermaNet includes a new treatment o...

Consider a hyperbolic group G and a quasiconvex subgroup H ⊂ G with [G : H] = ∞. We construct a set-theoretic section s : G/H → G of the quotient map (of sets) G → G/H such that s(G/H) is a net in G; that is, any element of G is a bounded distance from s(G/H). This section arises naturally as a set of points minimizing word-length in each fixed coset gH. The left action of G on G/H induces an a...