1. A method for the efficient selection of runtime rules for programmable search, said method comprising: a processor of a computer system translating a plurality of runtime rules into a plurality of fielded documents, wherein a first runtime rule of said plurality of runtime rules comprises a first rule pattern and a first rewrite pattern, wherein said first rule pattern comprises a first set of tokens of a plurality of tokens, and wherein a first fielded document of said plurality of fielded documents comprises said first set of tokens; said processor partitioning said plurality of fielded documents into a plurality of disjoint clusters of fielded documents; said processor converting a first cluster of said plurality of disjoint clusters into a first inverted index of a plurality of inverted indices, wherein said first inverted index associates a first token comprised by said first cluster with a related subset of fielded documents of said first cluster, and wherein a fielded document of said related subset comprises said first token; said processor generating a set of fielded queries as a function of said plurality of inverted indices, wherein said set of fielded queries satisfies a set of conditions, and wherein a condition of the set of conditions is related to a parameter of the input query; and said processor selecting a set of candidate rules of said plurality of runtime rules as a function of said set of fielded queries and of said plurality of inverted indices, and wherein the number of candidate rules comprised by the set of candidate rules is reduced by the requirement that the set of fielded queries satisfy the condition of the set of conditions.