10. A computer program product for entity resolution between traditional and non-traditional datasets, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to: create a deterministic model, comprising: defining an entity to be resolved; selecting two datasets for comparison, wherein a first of the two datasets is a traditional database comprising structured or semi-structured data, wherein a second of the two datasets is a non-traditional database comprising unstructured data; defining matching predicates for attributes of the two datasets to select a set of candidate matches; and defining at least one precedence rule for the candidate matches to select a subset of the candidate matches; run the deterministic model on the two datasets, the running comprising applying the matching predicates and the at least one precedence rule to data in the two datasets that correspond to the attributes; apply a cardinality rule to results of the running; output, via the processor, the matching candidates for which the cardinality rule is satisfied; create a probabilistic model, comprising: selecting records from the two datasets for comparison; implementing data derivation on the records, the data derivation resulting in standardized and bucketed data; defining blocking conditions for application to each of corresponding bucketed data; and defining a scoring rule for pairwise comparisons of the bucketed data; run the probabilistic model on the bucketed data; score results of the pairwise comparisons of the bucketed data; and combine the results of the deterministic model with the results of the probabilistic model.
10. A computer program product for entity resolution between traditional and non-traditional datasets, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to: create a deterministic model, comprising: defining an entity to be resolved; selecting two datasets for comparison, wherein a first of the two datasets is a traditional database comprising structured or semi-structured data, wherein a second of the two datasets is a non-traditional database comprising unstructured data; defining matching predicates for attributes of the two datasets to select a set of candidate matches; and defining at least one precedence rule for the candidate matches to select a subset of the candidate matches; run the deterministic model on the two datasets, the running comprising applying the matching predicates and the at least one precedence rule to data in the two datasets that correspond to the attributes; apply a cardinality rule to results of the running; output, via the processor, the matching candidates for which the cardinality rule is satisfied; create a probabilistic model, comprising: selecting records from the two datasets for comparison; implementing data derivation on the records, the data derivation resulting in standardized and bucketed data; defining blocking conditions for application to each of corresponding bucketed data; and defining a scoring rule for pairwise comparisons of the bucketed data; run the probabilistic model on the bucketed data; score results of the pairwise comparisons of the bucketed data; and combine the results of the deterministic model with the results of the probabilistic model. 11. The computer program product of claim 10 , wherein the program instructions further cause the processor to: upon determining that quality of the outputted matches falls below a threshold value, iteratively modify at least one of the matching predicates, the at least one precedence rule, and the cardinality rule and run the deterministic model until the quality of the results meets or exceeds the threshold value; wherein modification of at least one of the matching predicates includes at least one of: re-defining at least one of the attributes of one of the matching predicates at a coarser granularity to produce a greater number of the candidate matches; re-defining at least one of the matching predicates at a finer granularity to produce fewer of the candidate matches; and re-defining at least one of the at least one precedence rule to reduce a number of candidate matches that violate cardinality constraints.