{'fraction_non_alphanumeric': 0.018148820326678767, 'fraction_numerical': 0.0, 'mean_word_length': 4.935483870967742, '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}}
Rewriting Systems in Alternating Knot Groups

Every tame, prime and alternating knot is equivalent to a tame, prime and alternating knot in regular position, with a common projection. In this work, we show that the augmented Dehn presentation of the knot group of a tame, prime, alternating knot in regular position, with a common projection has a finite and complete rewriting system. This provides an algorithm for solving the word problem with this presentation and we find an algorithm for solving the word problem with the Dehn presentation also.