The AMC algorithm runs LDA on a set of documents from a variety of domains. This yields a set of topics - with possible (but not probable) overlapping topics across documents. This is labeled as the prior topic set. Then the AMC must-link and cannot-link parts are run on a new document set, using the information embedded in the distributions of the prior topic set. A must link between two words means that they belong to the same topic across a number of prior topics. Cannot-links are words which never occur concurrently in a prior topic. The links are generated using a multi-dimensional generalized Pólya \cite{P_lya_1966} process, in polynomial time.