{'fraction_non_alphanumeric': 0.017660044150110375, 'fraction_numerical': 0.0, 'mean_word_length': 5.394366197183099, '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}}
Slowly converging parafac sequences: Swamps and two‐factor degeneracies

The alternating least squares PARAFAC algorithm is a useful tool for resolving trilinear three‐way data arrays. Occasionally, however, it becomes bogged down for many iterations in the vicinity of a poor quality resolution before moving on to a much superior optimum fit. We investigate this behavior in a simulation study and suggest ways of overcoming the obstacles it presents.