{'fraction_non_alphanumeric': 0.029885057471264367, 'fraction_numerical': 0.0, 'mean_word_length': 4.972602739726027, '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}}
Path orderings, quasi-orderings and termination of term rewriting systems

In this paper we present some original variations of the recursive 
path ordering. Additionally we define a restricted semantic path 
ordering which, in general, does not include the subterm relation, 
but is shown to be monotonic. By combining both kind of 
orderings we can prove (automatically) the termination of several 
(non-simply terminating) examples.