<commit_before>wordament-solver
================

(English) Wordament solver that handles digrams, prefixes, suffixes, and either/or tiles.

(/Screenshots/1.PNG)
(/Screenshots/2.PNG)

Implementation
--------------

Storing the dictionary in a trie wasn't necessary for this, so I'm just using a list of list strings, where each list string (each group) contains words sharing the same 3-letter prefix. The algorithm goes from the dictionary to the board, checking first for the existence of a group's prefix, and if finding it, checking the entire group. Words are checked by looking recursively (in adjacent tiles) for the word's (remaining) letters.
<commit_msg>Screenshot test 4<commit_after>wordament-solver
================

(English) Wordament solver that handles digrams, prefixes, suffixes, and either/or tiles.

![before](/Screenshots/1.PNG)
![after](/Screenshots/2.PNG)

Implementation
--------------

Storing the dictionary in a trie wasn't necessary for this, so I'm just using a list of list strings, where each list string (each group) contains words sharing the same 3-letter prefix. The algorithm goes from the dictionary to the board, checking first for the existence of a group's prefix, and if finding it, checking the entire group. Words are checked by looking recursively (in adjacent tiles) for the word's (remaining) letters.

{'fraction_non_alphanumeric': 0.10822831727205337, 'fraction_numerical': 0.005189028910303929, 'mean_word_length': 4.555555555555555, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, '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}}
{'dir': 'git-commits-cleaned', 'id': '5030713', 'n_tokens_mistral': 373, 'n_tokens_neox': 346, 'n_words': 176}