{"version":"1.0","type":"rich","title":"core trie code in new labMTsimple","description":"This example computes a sentiment score for a corpus by traversing two prefix trees stored in `self.data`. It first checks exact word matches in the non-regex trie, then falls back to a regex trie for stemmed words using `prefixes` and `prefix_items`. The code iterates over a `wordDict` hash mapping words to counts, accumulating weighted scores and total counts before returning the average. It relies on the `labMTsimple` internal trie structure rather than external visualization libraries, with no rendering or charting API present.","provider_name":"VizHub AI Studio","provider_url":"https://next.vizhub.com","html":"<iframe src=\"https://next.vizhub.com/viz/gist-af62a2dd3b5c6f93ea48?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"1\"></iframe>","width":960,"height":500,"cache_age":3600}