Query to task mapping

摘要

Candidate mappings are generated between two sets of short strings. A set of files related to the two sets of strings is chosen. Each string from the two sets of strings is searched for in the set of files. Any two strings that match the same file are presumed to be related, and are mapped together. These candidate mappings may then be checked by annotators/reviewers.