word_chewer 0.5

A recursive anagram solver with brute-force dictionary checking implemented in Python

  Add it to your Download Basket!

 Add it to your Watch List!

0/5

Rate it!

What's new in word_chewer 0.5:

  • Fulfills the centerpiece of its functionality, but not gracefully, and with very few frills.
Read full changelog
send us
an update
LICENSE TYPE:
MIT/X Consortium License 
USER RATING:
UNRATED
  0.0/5
DEVELOPED BY:
Steve Kendall
HOMEPAGE:
launchpad.net
CATEGORY:
ROOT \ Text Editing&Processing \ Others
1 word_chewer Screenshot:
word_chewer - Usage example
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

requirements

#anagram solver #dictionary checker #anagram #solver #words #dictionary

Add your review!

SUBMIT