A global approach for a dictionary of Lingála: from the localization of software to a lemmatization strategy

Lingála is the national language spoken in Kinshasa, the capital of the country. Even if this language is going through a straightforward empowering process, its progress is still hindered by the lack of terminological and lexicographic tools; hence the need of providing monolingual or plurilingual dictionaries for this language, according to what is a demand of society. This is why we have undertaken this research on lexicography. It consists in producing lexicons as teaching aids and in making them available to primary users, i.e. teachers and students. In this communication, firstly, we will observe the approach followed by authors of existing Lingála dictionaries (monolingual and bilingual). This review aims to improve, if necessary, the presentation of entries, so as to help readers find the words they are looking for. The variations in the current spoken language (the so-called Kinshasa Lingála) and in the so-called standard language (Makanza Lingála) will be important in the choice we will make for recording occurrences in the dictionary. This concerns the orthography of words, as well as lemmatized forms and register. Secondly, we will describe the process of localization of software we will use to process the corpus. Finally, we will also very briefly describe the corpus we are processing

Random semicomputable reals revisited

The aim of this expository paper is to present a nice series of results, obtained in the papers of Chaitin (1976), Solovay (1975), Calude et al. (1998), Kucera and Slaman (2001). This joint effort led to a full characterization of lower semicomputable random reals, both as those that can be expressed as a "Chaitin Omega" and those that are maximal for the Solovay reducibility. The original proofs were somewhat involved; in this paper, we present these results in an elementary way, in particular requiring only basic knowledge of algorithmic randomness. We add also several simple observations relating lower semicomputable random reals and busy beaver functions.Comment: 15 page

Kolmogorov Complexity and Solovay Functions

Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) <= f (x)+O(1) for all x and f (x) <= K(x) + O(1) for infinitely many x, which we call Solovay functions. We show that Solovay functions present interesting connections with randomness notions such as Martin-L\"of randomness and K-triviality

K-trivial, K-low and MLR-low sequences: a tutorial

A remarkable achievement in algorithmic randomness and algorithmic information theory was the discovery of the notions of K-trivial, K-low and Martin-Lof-random-low sets: three different definitions turns out to be equivalent for very non-trivial reasons. This paper, based on the course taught by one of the authors (L.B.) in Poncelet laboratory (CNRS, Moscow) in 2014, provides an exposition of the proof of this equivalence and some related results. We assume that the reader is familiar with basic notions of algorithmic information theory.Comment: 25 page