{'fraction_non_alphanumeric': 0.02721774193548387, 'fraction_numerical': 0.005040322580645161, 'mean_word_length': 4.946107784431137, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Representations of Well-Founded Preference Orders

A preference order, or linear preorder, on a set X is a binary relation which is transitive, reflexive and total. This preorder partitions the set X into equivalence classes of the form . The natural relation induced by on the set of equivalence classes is a linear order. A well-founded preference order, or prewellordering, will similarly induce a well-ordering. A representation or Paretian utility function of a preference order is an order-preserving map f from X into the R of real numbers (provided with the standard ordering). Mathematicians and economists have studied the problem of obtaining continuous or measurable representations of suitably defined preference orders [4, 7]. Parametrized versions of this problem have also been studied [1, 7, 8]. Given a continuum of preference orders which vary in some reasonable sense with a parameter t, one would like to obtain a continuum of representations which similarly vary with t.