Hasil untuk "African languages and literature"

Precious Eze, Stephanie Lunn, Bruk Berhane

Employers increasingly expect graduates to utilize large language models (LLMs) in the workplace, yet the competencies needed for computing roles across Africa remain unclear given varying national contexts. This study examined how six LLMs, namely ChatGPT 4, DeepSeek, Gemini, Claude 3.5, Llama 3, and Mistral AI, describe entry-level computing career expectations across ten African countries. Using the Computing Curricula 2020 framework and drawing on Digital Colonialism Theory and Ubuntu Philosophy, content analysis of 60 LLM responses to standardized prompts reveals consistent coverage of technical competencies such as cloud computing and programming, but notable differences in non-technical competencies, particularly ethics and responsible AI use. Models vary considerably in recognizing country-specific factors, including local technology ecosystems, language requirements, and national policies averaging only 35.4% contextual awareness overall. Open-source models demonstrated stronger contextual awareness and better balance between technical and professional skills, with Llama (4.47/5) and DeepSeek (4.25/5) outperforming proprietary alternatives ChatGPT-4 (3.90/5) and Claude (3.46/5). However, Mistral's poor contextual performance (0.00/4) despite being open-source indicates that development philosophy alone does not guarantee contextual responsiveness. This first comprehensive comparison of LLM career guidance for African computing students uncovers entrenched infrastructure assumptions and Western-centric biases that create gaps between technical recommendations and local realities. The findings challenge assumptions about AI tool quality in resource-constrained settings and underscore the need for decolonial approaches to AI in education, emphasizing contextual relevance and hybrid human-AI guidance models.

Guilherme Duarte, Nelma Moreira, Luca Prigioniero et al.

In this paper we consider block languages, namely sets of words having the same length, and study the deterministic and nondeterministic state complexity of several operations on these languages. Being a subclass of finite languages, the upper bounds of operational state complexity known for finite languages apply for block languages as well. However, in several cases, smaller values were found. Block languages can be represented as bitmaps, which are a good tool to study their minimal finite automata and their operations, as we illustrate here.

Rose Bohrer

In the pedagogy of programming languages, one well-known course structure is to tour multiple languages as a means of touring paradigms. This tour-of-paradigms approach has long received criticism as lacking depth, distracting students from foundational issues in language theory and implementation. This paper argues for disentangling the idea of a tour-of-languages from the tour-of-paradigms. We make this argument by presenting, in depth, a series of case studies included in the Human-Centered Programming Languages curriculum. In this curriculum, case studies become deep, serving to tour the different intellectual foundations through which a scholar can approach programming languages, which one could call the tour-of-humans. In particular, the design aspect of programming languages has much to learn from the social sciences and humanities, yet these intellectual foundations would yield far fewer deep contributions if we did not permit them to employ case studies.

Matteo Cimini

Program logics are a powerful formal method in the context of program verification. Can we develop a counterpart of program logics in the context of language verification? This paper proposes language logics, which allow for statements of the form $\{P\}\ \mathcal{X}\ \{Q\}$ where $\mathcal{X}$, the subject of analysis, can be a language component such as a piece of grammar, a typing rule, a reduction rule or other parts of a language definition. To demonstrate our approach, we develop $\mathbb{L}$, a language logic that can be used to analyze language definitions on various aspects of language design. We illustrate $\mathbb{L}$ to the analysis of some selected aspects of a programming language. We have also implemented an automated prover for $\mathbb{L}$, and we confirm that the tool repeats these analyses. Ultimately, $\mathbb{L}$ cannot verify languages. Nonetheless, we believe that this paper provides a strong first step towards adopting the methods of program logics for the analysis of languages.

Elisabeth Griebl, Benedikt Fein, Florian Obermüller et al.

Block-based programming languages like Scratch are increasingly popular for programming education and end-user programming. Recent program analyses build on the insight that source code can be modelled using techniques from natural language processing. Many of the regularities of source code that support this approach are due to the syntactic overhead imposed by textual programming languages. This syntactic overhead, however, is precisely what block-based languages remove in order to simplify programming. Consequently, it is unclear how well this modelling approach performs on block-based programming languages. In this paper, we investigate the applicability of language models for the popular block-based programming language Scratch. We model Scratch programs using n-gram models, the most essential type of language model, and transformers, a popular deep learning model. Evaluation on the example tasks of code completion and bug finding confirm that blocks inhibit predictability, but the use of language models is nevertheless feasible. Our findings serve as foundation for improving tooling and analyses for block-based languages.

Keyan G. Tomaselli

Carla Sendra-Balcells, Víctor M. Campello, Jordina Torrents-Barrena et al.

Most artificial intelligence (AI) research have concentrated in high-income countries, where imaging data, IT infrastructures and clinical expertise are plentiful. However, slower progress has been made in limited-resource environments where medical imaging is needed. For example, in Sub-Saharan Africa the rate of perinatal mortality is very high due to limited access to antenatal screening. In these countries, AI models could be implemented to help clinicians acquire fetal ultrasound planes for diagnosis of fetal abnormalities. So far, deep learning models have been proposed to identify standard fetal planes, but there is no evidence of their ability to generalise in centres with limited access to high-end ultrasound equipment and data. This work investigates different strategies to reduce the domain-shift effect for a fetal plane classification model trained on a high-resource clinical centre and transferred to a new low-resource centre. To that end, a classifier trained with 1,792 patients from Spain is first evaluated on a new centre in Denmark in optimal conditions with 1,008 patients and is later optimised to reach the same performance in five African centres (Egypt, Algeria, Uganda, Ghana and Malawi) with 25 patients each. The results show that a transfer learning approach can be a solution to integrate small-size African samples with existing large-scale databases in developed countries. In particular, the model can be re-aligned and optimised to boost the performance on African populations by increasing the recall to $0.92\pm0.04$ and at the same time maintaining a high precision across centres. This framework shows promise for building new AI models generalisable across clinical centres with limited data acquired in challenging and heterogeneous conditions and calls for further research to develop new solutions for usability of AI in countries with less resources.

Ife Adebara, AbdelRahim Elmadany, Muhammad Abdul-Mageed et al.

Multilingual pretrained language models (mPLMs) acquire valuable, generalizable linguistic information during pretraining and have advanced the state of the art on task-specific finetuning. To date, only ~31 out of ~2,000 African languages are covered in existing language models. We ameliorate this limitation by developing SERENGETI, a massively multilingual language model that covers 517 African languages and language varieties. We evaluate our novel models on eight natural language understanding tasks across 20 datasets, comparing to 4 mPLMs that cover 4-23 African languages. SERENGETI outperforms other models on 11 datasets across the eights tasks, achieving 82.27 average F_1. We also perform analyses of errors from our models, which allows us to investigate the influence of language genealogy and linguistic similarity when the models are applied under zero-shot settings. We will publicly release our models for research.\footnote{\href{https://github.com/UBC-NLP/serengeti}{https://github.com/UBC-NLP/serengeti}}

Séverine Fratani, Guillaume Maurras, Pierre-Alain Reynier

Regular nested word languages (a.k.a. visibly pushdown languages) strictly extend regular word languages, while preserving their main closure and decidability properties. Previous works have shown that considering languages of 2-nested words, i.e. words enriched with two matchings (a.k.a. 2-visibly pushdown languages), is not as successful: the corresponding model of automata is not closed under determinization. In this work, inspired by homomorphic representations of indexed languages, we identify a subclass of 2-nested words, which we call 2-wave words. This class strictly extends the class of nested words, while preserving its main properties. More precisely, we prove closure under determinization of the corresponding automaton model, we provide a logical characterization of the recognized languages, and show that the corresponding graphs have bounded treewidth. As a consequence, we derive important closure and decidability properties. Last, we show that the word projections of the languages we define belong to the class of linear indexed languages.

Oscar H. Ibarra, Ian McQuillan

We look at nondeterministic finite automata augmented with multiple reversal-bounded counters where, during an accepting computation, the behavior of the counters is specified by some fixed pattern. These patterns can serve as a useful "bridge" to other important automata and grammar models in the theoretical computer science literature, thereby helping in their study. Various pattern behaviors are considered, together with characterizations and comparisons. For example, one such pattern defines exactly the smallest full trio containing all the bounded semilinear languages. Another pattern defines the smallest full trio containing all the bounded context-free languages. The "bridging" to other families is then applied, e.g. to certain Turing machine restrictions, as well as other families. Certain general decidability properties are also studied using this framework.

Amina Marzouk Chouchene

This article is about the rebellious behavior of the servant class and the consequent threat it posed to the established social order in the 1820 settlement. There were deep anxieties amongst the higher echelons of the settlement about maintaining class distinctions. Upper and middle class settlers relied on informal and formal strategies in order to keep social hierarchies intact. The concept of social control is applied in this respect to study the troubled master-servant relationship, emphasize an obsessive preoccupation with social order, and uncover the limits of upper and middle class settlers’ control. This focus on the troubled master servant relationship in the 1820 settlement and the failed attempts to control it is a helpful correction to the celebratory reverberations of early South African settler histories.

Uli Fahrenberg, Christian Johansen, Georg Struth et al.

We introduce languages of higher-dimensional automata (HDAs) and develop some of their properties. To this end, we define a new category of precubical sets, uniquely naturally isomorphic to the standard one, and introduce a notion of event consistency. HDAs are then finite, labeled, event-consistent precubical sets with distinguished subsets of initial and accepting cells. Their languages are sets of interval orders closed under subsumption; as a major technical step we expose a bijection between interval orders and a subclass of HDAs. We show that any finite subsumption-closed set of interval orders is the language of an HDA, that languages of HDAs are closed under binary unions and parallel composition, and that bisimilarity implies language equivalence.

Matteo Cimini, Benjamin Mourad

Language transformations are algorithms that take a language specification in input, and return the language specification modified. Language transformations are useful for automatically adding features such as subtyping to programming languages (PLs), and for automatically deriving abstract machines. In this paper, we set forth the thesis that teaching programming languages features with the help of language transformations, in addition to the planned material, can be beneficial for students to help them deepen their understanding of the features being taught. We have conducted a study on integrating language transformations into an undergraduate PL course. We describe our study, the material that we have taught, and the exam submitted to students, and we present the results from this study. Although we refrain from drawing general conclusions on the effectiveness of language transformations, this paper offers encouraging data. We also offer this paper to inspire similar studies.

Nathanaël Fijalkow

This paper studies the complexity of languages of finite words using automata theory. To go beyond the class of regular languages, we consider infinite automata and the notion of state complexity defined by Karp. Motivated by the seminal paper of Rabin from 1963 introducing probabilistic automata, we study the (deterministic) state complexity of probabilistic languages and prove that probabilistic languages can have arbitrarily high deterministic state complexity. We then look at alternating automata as introduced by Chandra, Kozen and Stockmeyer: such machines run independent computations on the word and gather their answers through boolean combinations. We devise a lower bound technique relying on boundedly generated lattices of languages, and give two applications of this technique. The first is a hierarchy theorem, stating that there are languages of arbitrarily high polynomial alternating state complexity, and the second is a linear lower bound on the alternating state complexity of the prime numbers written in binary. This second result strengthens a result of Hartmanis and Shank from 1968, which implies an exponentially worse lower bound for the same model.

F. I.J. van Rensburg

Throughout the years students of the work of N.P. van Wyk Louw tended to focus on its preoccupation with the “deeper” aspects of life, thereby losing sight of the wide spectrum of “surface” or lighter aspects contained in it, not only of a thematic, but also of a structural nature. Concentrating on the linguistic structure of a number of texts, a wide range of creative strategies based on playfulness was identified. The article explores this aspect of his work, particularly in his poetry, his theatrical work, and his reflective prose.

Gibson Ncube

This paper examines post-independent Zimbabwean literary narratives which engage with how the ruling ZANU-PF government frames dissenting voices as constituting dirt, filth and undesirability. Making use of Achille Mbembe's postulations on the "vulgarity of power" and Kenneth W. Harrow's readings of the politics of dirt, the central thesis of this paper is that the troping of dirt and state sponsored violence are closely related to the themes of memory and belonging. Literary works by writers such as Chistopher Mlalazi, NoViolet Bulawayo and John Eppel become self-effacing speech acts that are involved in reimagining and revisioning our understanding of power dynamics and how this affects human and social experiences.

N. P. van Wyk Louw

Jacomien van Niekerk

Oyeniyi Okunoye

This paper reads Odia Ofeimun’s London Letter and Other Poems (2000) in light of contestations with regard to the conception and location of home in postcolonial travel writing. The collection is seen as preoccupied with the burden of self-location and the associated problem of self-definition in this tradition. The migrant postcolonial writer is understood as almost always caught in a dilemma once a choice has to be made between identifying with the original homeland (which in most cases also coincides with the margins) and the colonial “mother country”, the metropolis. This necessitates either appreciating the burden of self-definition in a simplistic manner or realistically affirming the complexity that the heritage of colonial history introduces to problematise it. Ofeimun’s collection is read as presenting a blunt appraisal of the postcolonial condition and an acceptance of the challenges it poses for people in the postcolonial world: the inevitability of affirming an alternative space which is in-between the metropole and the margins.

Angelique van Niekerk

The intentional deviation from the norms of Standard Afrikaans in advertising. The visibility of Afrikaans in the market place (media) and the growth of a different type (non-Standard) of Afrikaans in industries such as the music, film, publication industry, et cetera may be indicative of the symbolic and instrumental positioning of Afrikaans in the market place, in contrast to the hostility sometimes experienced in the tertiary education sector. The advertising industry is one such public sphere where Afrikaans is used. Language is used in a distinct manner in different genres which often deviates in a specific way and for specific reasons from the norms of Standard Afrikaans. To classify language as a deviation implies measurement against one or other norm. In the analytical section of this article, the norms (internal, external and universal) of Standard Afrikaans will be applied to print advertising language to motivate the functionality and acceptance of such (strategic) deviation in the construction of a plausible marketing message. Based on the theoretic principles of text linguistics, the intentionality and acceptance of the deviations of the prescribed norms play a significant role in constructing an implied marketing message. This does not imply the acceptance of unintended language errors but intended deviations of the prescribed norms that have a functional (communicative) market-driven role accepted by the intended audience. The study concludes with an overview of the most evident grammatical characteristics of the Afrikaans language in advertising.