is made at block 224 whether the user has accepted the proposed match if the match has been accepted mapping of that suggested match to that semantic attribute is stored and the lut may be updated at block 226 if the proposed match is not accepted that term may be ignored after storing the mapping or if the underlying input attribute is found in the initial case the underlying attribute is hashed at block 228 at block 230 the hash value of all identified underlying attributes and input attributes are summed the sum of the hash values is used to identify the closest structured request from the index in one embodiment the search of the index may be limited by the number of input attributes found from the search query for example if three attributes are present searching of requests having two or one attribute is avoided where no exact match is found additional iterations may be performed by subtraction term has values of one or more attributes until a suitable match is found by way of example if five input attributes exist or are derived from the unstructured query but the sum of the hash values of those five attributes is not found in the index the system will search for each of the sums of four attributes to the extent that more than one request is identified thereby in some embodiments the system will apply both requests and return the union or the intersection of those requests in one embodiment where.