MétaCan
ENFR
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

Export CSVExport JSONAPI query

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
→
Sort
Language
Type
Field
Venue
Topic
Natural Language Processing Techniques
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

3,084 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
3,084 works in the cohort · of 4,299,418page 57 of 62

Labels cover 10 of 3,084 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 3,084 of 3,084 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Asymmetry Theory and Asymmetry Based Parsing
Anna Maria Di Sciullo
2015· book-chapter· en· Communications in computer and information science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
The CASIA Entity linking System at TAC 2013
Guangyou Zhou, Liheng Xu, Shizhu He, Kang Liu, Jun Zhao
2013· article· en· Theory and applications of categories· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
A Parsing Tool for Short Linguistic Constructions
Priyanka Jain, Naman Jain, Hemant Darbari, Virendrakumar C. Bhavsar
2023· book-chapter· en· Communications in computer and information science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
UofL at TAC 2011 Guided Summarization Task
Yllias Chali, Sadid A. Hasan, Kaisar Imam, Siddharth Subramanian
2011· article· en· Theory and applications of categories· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Similarity Patterns in Words (Invited talk)
Grzegorz Kondrak
2012· article· en· Conference of the European Chapter of the Association for Computational Linguistics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
MSIIPL THU’s Slot-Filling Method for TAC-KBP 2015.
Yangcheng Zhang, Hengsheng Liu, Gang Zhao, Wu Ji
2015· article· en· Theory and applications of categories· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
A semantic interface for post secondary education programs
Eduardo Torres Schumann, Levin Brunner, Klaus U. Schulz, Christoph Ringlstetter
2008· article· en· Proceedings of the American Society for Information Science and Technology· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Manual vs Automatic Bitext Extraction
Aibek Makazhanov, Bagdat Myrzakhmetov, Zhenisbek Assylbekov
2018· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Contributions of action representations to tool naming.
Daniel N. Bub, Noah Moise, Michael E. J. Masson
2025· article· en· Journal of Experimental Psychology Human Perception & Performance· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Efficient Grammar Compression via RLZ-based RePair
Rahul Varki, Travis Gagie, Christina Boucher
2025· preprint· en· bioRxiv (Cold Spring Harbor Laboratory)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
SAT-MICRO: petit mais costaud !
Sylvain Conchon, Johannes Kanig, Stéphane Lescuyer
2008· article· pt· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affvenueunlabeled
Writing Practice in LIS
Hugh Samson, Jenna Hartel, Bharat Mehra, Mary Broussard, David Lévy
2025· article· en· Proceedings of the Annual Conference of CAIS / Actes du congrès annuel de l ACSI· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Paradoxes of MaxEnt markedness
Giorgio Magri, Artο Anttila
2023· article· en· Proceedings of the Annual Meetings on Phonology· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
5.7 Rule ordering relationships
John T. Jensen
2004· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About