word_chewer iconword_chewer 0.5

A recursive anagram solver with brute-force dictionary checking implemented in Python
The word_chewer project can currently solve for all anagrams of a single word. The program performs two processor-intensive tasks: first generating all the potential permutations of a word, then comparing them to words in a dictionary file.

For longer words, the latter is the most time-consuming. Future plans include the implementation of a red/black tree for the dictionary file, to significantly decrease the processing time. Multiple-word anagrams are also a desirable feature, though their length would likely be prohibitive until the first issue (processing time) is resolved somewhat.

last updated on:
April 8th, 2010, 12:31 GMT
developed by:
Steve Kendall
license type:
MIT/X Consortium License 
ROOT \ Text Editing&Processing \ Others


In a hurry? Add it to your Download Basket!

user rating



1 Screenshot
word_chewer - Usage example
What's New in This Release:
  • Fulfills the centerpiece of its functionality, but not gracefully, and with very few frills.
read full changelog

Add your review!