That would be a rather large look-up table. E.g., the standard hash function these days is SHA1. Here is what it returns for 'null and void' as a password:
>>> from sha import sha
>>> sha('null and void').hexdigest()
'd8d8e866fb92a6b275dee8890ec80ad0776e1306'
>>> int('d8d8e866fb92a6b275dee8890ec80ad0776e1306', 16)
1237979212554367229448322411207458778802755080966L
>>> int('d8d8e866fb92a6b275dee8890ec80ad0776e1306', 16)/1e12
1.2379792125543673e+36
Even after dividing it by a trillion, we're still looking at a number with 37 digits to the left of the decimal point.
It would be much more efficient to brute-force all the 13-character strings until we happen upon 'null and void', running the SHA algorithm in parallel in a rack full of GPUs.
How big a look-up table can a facility larger than a major sports stadium hold?
The “an essay” has 7 such facilities, the one in Utah everyone talks about, and six more scattered across the land.