The dictionary already allows searching based on anagrams, +1, and regular expressions (which implies also benjamins, prefixes, suffixes, ...) with a length limit.
It could be interesting to search using 1 or more rules, such as:
anagram match
number of vowels
included letters
excluded letters
takes prefix
takes suffix
number of unique letters
number of anagrams
length
regular expression
...
These rules should be combinable at will, to have a powerful search tool.
Some of these rules (like "number of anagrams") could be slow without indexing (i.e. a kind of database). Others (like "takes suffix") would be much faster with a GADDAG (see issue #1).
The dictionary already allows searching based on anagrams, +1, and regular expressions (which implies also benjamins, prefixes, suffixes, ...) with a length limit.
It could be interesting to search using 1 or more rules, such as:
These rules should be combinable at will, to have a powerful search tool. Some of these rules (like "number of anagrams") could be slow without indexing (i.e. a kind of database). Others (like "takes suffix") would be much faster with a GADDAG (see issue #1).