https://ir.unisa.ac.za/handle/10500/24281 2026-05-06T12:53:50Z https://ir.unisa.ac.za/handle/10500/24306 Die meting van sukses van naampassingsalgoritmes in 'n genealogiese databasis De Kock, G de V Norms to measure the success of surname matching algorithms for use in a South African Genealogical Database are proposed. Surnames in the database can be grouped in equivalence classes. These algorithms are taken from approximate word or string matching algorithms based on equivalence or similarity relations as proposed in the literature. 1988-01-01T00:00:00Z https://ir.unisa.ac.za/handle/10500/24305 Finding a cheap matching Smith, T.H.C. We propose an edge exchange algorithm/or finding a cheaper 1-matchingfrom a given ]-matching as well as a heuristic algorithm/or constructing a relatively cheap ]-matching from the optimal solution of a relaxation of the ]-matching problem. Computational experience with these two algorithms as well as two greedy algorithms from the literature is reported. 1988-01-01T00:00:00Z https://ir.unisa.ac.za/handle/10500/24304 Learning the first step in requirements specification Short, R.M.C. Learning about the domain into which an information system will fit is an essential part of the system development process. In this paper it is argued that the first stage of the development process should be learning undertaken by the designers in order to come to an understanding of the domain into which the information system is intended to fit. More specifically it is argued that this understanding must be an understanding of the "intended information system's user's" own view of the domain. Based on this contention a suggested sequence of foci to be adopted during the specification of information requirements is proposed. 1988-01-01T00:00:00Z https://ir.unisa.ac.za/handle/10500/24303 The parallel conditional Postma, Stef W.; Philips, N.C.K. The parallel conditional is a new but natural programming language construct. It is particularly suited to evaluation on parallel maclunes and generalizes other well known conditionals. 1988-01-01T00:00:00Z