Query to task mapping

Details Query to task mapping Query to task mapping

G - Physics

06

F

G06F 17/00 (2006.01) G06F 17/30 (2006.01)

Patent

CA 2505294

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.

Affiliated with

Also associated with

Rating

Query to task mapping does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Query to task mapping, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Query to task mapping will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1433732