{'fraction_non_alphanumeric': 0.01466275659824047, 'fraction_numerical': 0.0, 'mean_word_length': 5.898989898989899, '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}}
Calculating Bivariate Orthonormal Polynomials By Recurrence

Emerson gave recurrence formulae for the calculation of orthonormal polynomials for univariate discrete random variables. He claimed that as these were based on the Christoffel–Darboux recurrence relation they were more efficient than those based on the Gram–Schmidt method. This approach was generalised by Rayner and colleagues to arbitrary univariate random variables. The only constraint was that the expectations needed are well‐defined. Here the approach is extended to arbitrary bivariate random variables for which the expectations needed are well‐defined. The extension to multivariate random variables is clear.