Browse State-of-the-Art › Variable Detection

Variable Detection

2 papers with code · 1 benchmark · 2 datasets archive 2025-07-28

Natural Language Processing

Identifying whether a sentence contains a variable mention.

Description from the archive archive 2025-07-28.

Benchmarks archive 2025-07-28

1 leaderboard table shown for this task, 1 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.

DatasetBest model (first row in archive order)PaperCodeSyntologyCompare
SV-Ident (2 rows) SsciBERT Overview of the SV-Ident 2022 Shared Task on Survey Variable... code — Compare

Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

2 datasets whose archive record lists this task, ordered by the archive's paper count.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Parent tasks archive 2025-07-28

Papers archive 2025-07-28

archive papers tagged: 10 · with a code link: 2 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 10 tagged papers has a Syntology run on record

Page 1 of 1: papers 1 to 10 of 10, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.

Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.

  • 20 Dec 2023 1 repository listed
    The VADIS system addresses the demand of providing enhanced information access in the domain of the social sciences.
  • 19 Sep 2022 1 repository listed
    In this paper, we provide an overview of the SV-Ident shared task as part of the 3rd Workshop on Scholarly Document Processing (SDP) at COLING 2022.
  • A Composite Decomposition Method for Large-Scale Global Optimization
    2 Mar 2024 0 repositories listed
    Cooperative co-evolution (CC) algorithms, based on the divide-and-conquer strategy, have emerged as the predominant approach to solving large-scale global optimization (LSGO) problems.
  • Varanalysis@SV-Ident 2022: Variable Detection and Disambiguation Based on Semantic Similarity
    1 Oct 2022 0 repositories listed
    This paper describes an approach to the SV-Ident Shared Task which requires the detection and disambiguation of survey variables in sentences taken from social science publications.
  • Towards Automated Survey Variable Search and Summarization in Social Science Publications
    14 Sep 2022 0 repositories listed
    Nowadays there is a growing trend in many scientific disciplines to support researchers by providing enhanced information access through linking of publications and underlying datasets, so as to support research with…
  • Coarse-grained and emergent distributed parameter systems from data
    16 Nov 2020 0 repositories listed
    We explore the derivation of distributed parameter system evolution laws (and in particular, partial differential operators and associated partial differential equations, PDEs) from spatiotemporal data.
  • Instrument variable detection with graph learning : an application to high dimensional GIS-census data for house pricing
    30 Jul 2020 0 repositories listed
    In this paper, we merge two well-known tools from machine learning and biostatistics---variable selection algorithms and probablistic graphs---to estimate house prices and the corresponding causal structure using 2010…
  • Towards a Gold Standard Corpus for Variable Detection and Linking in Social Science Publications
    1 May 2018 0 repositories listed
  • Mining Social Science Publications for Survey Variables
    1 Aug 2017 0 repositories listed
    Research in Social Science is usually based on survey data where individual research questions relate to observable concepts (variables).
  • Efficient Relational Learning with Hidden Variable Detection
    1 Dec 2010 0 repositories listed
    Markov networks (MNs) can incorporate arbitrarily complex features in modeling relational data.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections