Abstract: Techniques for resolving a label are described. For example, a method of generating one or more labels corresponding to a substring of a tokenized utterance, each of the labels including one or more slot types, resolving the one or more generated labels into machine-readable values by: generating a tree of the generated one or more labels, the graph including a plurality of leaf nodes, wherein each rule of associated with a leaf node references a resolver, and resolving the generated tree from the leaf nodes to a root of the generated tree, by at each node, calling the referenced resolver and passing a result from each resolver to a subsequent resolver of the tree; and outputting a result of the resolving to an entity as dictated by the request is described.