I ran across a blog post about an interesting word characteristic, and wondered if a regex can be written to match this (e.g., with the plan to search a dictionary file). I suspect the answer is no, without invoking the magic "code in a regex".

Unfortunately, I don't have time now to try my hand at it, but I thought I'd post it here for everyone to have a go.

Update: Possible puzzles:

1) Find the longest words where each letter used has a different frequency.
2) Find the longest words where letter frequencies are sequential (e.g., 3,4,5,6).
3) Find the longest words where letter frequencies are sequential starting from 1.

Use any dictionary you like. If you have a mahvelous dictionary, drop a link here.