Question: Is the Dialog de-duplication algorithm deterministic or non-deterministic?

Answer: The Dialog deduplication algorithm is deterministic. The same two documents fed through the deduplication algorithm will always either be duplicates or not (as long as the indexing fields remain the same). The algorithm is not a learning algorithm – it is static.