Of course, be warned, StringHash returns very large values, usually between a few hundred millions and a 2.1 billion, and often very small like -1.9 billion or something, so they are not siutable for array use.
Of course, here, Ascii takes the StringHash value, and minimizes it using division (dividing by something around 0x40000) and then adds a value to range it from 0 to 8192.
I'd only recommend using StringHash for hashtable keys.
You can however use my StringIndexer to get a unique id for each string that is in the range [0....8191]