Demo Data from SIGIR 2026 / reviewers in the wild / expert
Santiago Herrera
dblp:372/6479
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0001-7204-9434ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 1 heaviest of 1, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › RNA biology › RNA analysis › RNA bioinformatics
RNA-binding protein analysis |
0.2 | 1 | 2015 | BackCLIP: a tool to identify common background presence in PAR-CLIP datasets · Bioinform. 2015 |
Methods — techniques the papers use, named apart from their topics
dataset comparison · 0.2background scoring · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Sparse Logistic Regression with High-order Features for Automatic Grammar Rule Extraction from TreebanksabstractDescriptive grammars are highly valuable, but writing them is time-consuming and difficult. Furthermore, while linguists typically use corpora to create them, grammar descriptions often lack quantitative data. As for formal grammars, they can be challenging to interpret. In this paper, we propose a new method to extract and explore significant fine-grained grammar patterns and potential syntactic grammar rules from treebanks, in order to create an easy-to-understand corpus-based grammar. More specifically, we extract descriptions and rules across different languages for two linguistic phenomena, agreement and word order, using a large search space and paying special attention to the ranking order of the extracted rules. For that, we use a linear classifier to extract the most salient features that predict the linguistic phenomena under study. We associate statistical information to each rule, and we compare the ranking of the model’s results to those of other quantitative and statistical measures. Our method captures both well-known and less well-known significant grammar rules in Spanish, French, and Wolof. Santiago Herrera, Caio F. Corro, Sylvain Kahane |
LREC/COLING | 1 |
| 2024 | UCxn: Typologically-Informed Annotation of Constructions Atop Universal DependenciesabstractThe Universal Dependencies (UD) project has created an invaluable collection of treebanks with contributions in over 140 languages. However, the UD annotations do not tell the full story. Grammatical constructions that convey meaning through a particular combination of several morphosyntactic elements—for example, interrogative sentences with special markers and/or word orders—are not labeled holistically. We argue for (i) augmenting UD annotations with a ‘UCxn’ annotation layer for such meaning-bearing grammatical constructions, and (ii) approaching this in a typologically informed way so that morphosyntactic strategies can be compared across languages. As a case study, we consider five construction families in ten languages, identifying instances of each construction in UD treebanks through the use of morphosyntactic patterns. In addition to findings regarding these particular constructions, our study yields important insights on methodology for describing and identifying constructions in language-general and language-particular ways, and lays the foundation for future constructional enrichment of UD treebanks. Leonie Weissweiler, Nina Böbel, Kirian Guiller, Santiago Herrera, Wesley Scivetti, Arthur Lorenzi Almeida, Nurit Melnik, Archna Bhatia, Hinrich Schütze, Lori S. Levin, Amir Zeldes, Joakim Nivre, William Croft 0001, Nathan Schneider 0001 |
LREC/COLING | 4 |
| 2015 | BackCLIP: a tool to identify common background presence in PAR-CLIP datasetsabstractMOTIVATION: PAR-CLIP, a CLIP-seq protocol, derives a transcriptome wide set of binding sites for RNA-binding proteins. Even though the protocol uses stringent washing to remove experimental noise, some of it remains. A recent study measured three sets of non-specific RNA backgrounds which are present in several PAR-CLIP datasets. However, a tool to identify the presence of common background in PAR-CLIP datasets is not yet available. RESULTS: We used the measured sets of non-specific RNA backgrounds to build a common background set. Each element from the common background set has a score that reflects its presence in several PAR-CLIP datasets. We present a tool that uses this score to identify the amount of common backgrounds present in a PAR-CLIP dataset, and we provide the user the option to use or remove it. We used the proposed strategy in 30 PAR-CLIP datasets from nine proteins. It is possible to identify the presence of common backgrounds in a dataset and identify differences in datasets for the same protein. This method is the first step in the process of completely removing such backgrounds. AVAILABILITY: The tool was implemented in python. The common background set and the supplementary data are available at https://github.com/phrh/BackCLIP. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Paula Helena Reyes-Herrera, C. A. Speck-Hernandez, Carlos Andrés Sierra, Santiago Herrera |
Bioinform. | 4 |