Implementing Language-Dependent Lexicographic Orders in Scheme
Résumé
The lexicographical order relations used within dictionaries are language-dependent, and we explain how we implemented such orders in Scheme. We show how our sorting orders are derived from the Unicode collation algorithm. Since the result of a Scheme function can be itself a function, we use generators of sorting orders. Specifying a sorting order for a new natural language has been made as easy as possible and can be done by a programmer who just has basic knowledge of Scheme. We also show how Scheme data structures allow our functions to be programmed efficiently.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...