Home › Code › input_fn_builder

input_fn_builder

Syntologyentry name in harvested code

Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record.

input_fn_builder appears in the code Syntology harvested for 13 papers, as 8 distinct code bodies found in 16 places (a place is one code body under one paper). Of the 13 papers, 13 with a sample that ran: 13 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument. 0 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named input_fn_builder do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 8 distinct code bodies named input_fn_builder: 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
0ran · our draft was wrong
0ran; the contract check could not run
7ran
1unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 1 of the 16 places is pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

13 papers shown of 13, newest first; 16 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive; 2 papers have no page here and are shown by their id only (arXiv: for an arXiv id; an id from another venue, such as ACL Anthology or AAAI, is named as that venue's id, never as an arXiv id). Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
NapSS: Paragraph-level Medical Text Simplification via Narrative Prompting and Sentence-matching Summarization 11 Feb 2023 google-research/bert/extract_features.py 47a3c792cebb6603 ran Apache-2.0 (permissive)
Named Entity Recognition as Dependency Parsing 14 May 2020 juntaoy/biaffine-ner/extract_bert_features/extract_features.py fb8d325e40dbff1b ran Apache-2.0 (permissive)
Probabilistically Masked Language Model Capable of Autoregressive Generation in Arbitrary Word Order 24 Apr 2020 m-hahn/PMLM/extract_features.py 47a3c792cebb6603 ran Apache-2.0 (permissive)
Structured Pruning of Large Language Models 10 Oct 2019 Holldean/BERT-Pruning/bert/extract_features.py 47a3c792cebb6603 ran Apache-2.0 (permissive)
Addressing Semantic Drift in Question Generation for Semi-Supervised Question Answering 13 Sep 2019 ZhangShiyue/QGforQA/LIB/bert/extract_features.py 47a3c792cebb6603 ran MIT (permissive)
Well-Read Students Learn Better: On the Importance of Pre-training Compact Models 23 Aug 2019 Arthurizijar/Bert_Airport/extract_features.py 47a3c792cebb6603 ran Apache-2.0 (permissive)
Defending Against Neural Fake News 29 May 2019 rowanz/grover/lm/dataloader.py 677632c738689822 ran Apache-2.0 recorded; this copy not marked cleared · pointer only
Passage Re-ranking with BERT 13 Jan 2019 nyu-dl/dl4marco-bert/run_msmarco.py e010030ee57fe701 ran BSD-3-Clause (permissive)
Passage Re-ranking with BERT 13 Jan 2019 nyu-dl/dl4marco-bert/run_treccar.py 9fbf56276f399498 ran BSD-3-Clause (permissive)
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 11 Oct 2018 1wy/bert/extract_features.py 47a3c792cebb6603 ran Apache-2.0 (permissive)
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 11 Oct 2018 flyliu2017/bert/data_processor.py 58dd0d69e82ebdc9 ran Apache-2.0 (permissive)
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 11 Oct 2018 nmfisher/bert-modified/run_squad_slot_tagger.py 49b90dc3f10fce0a unverified Apache-2.0 (permissive)
Higher-order Coreference Resolution with Coarse-to-fine Inference 15 Apr 2018 bkntr/coref-ee/extract_features.py fb8d325e40dbff1b ran Apache-2.0 (permissive)
Deep Generative Stochastic Networks Trainable by Backprop 5 Jun 2013 cycentum/bert-based-text-generation/word_replacement/word_replacement.py 86dfb98ea090a3bd ran MIT (permissive)
ACL Anthology id 2024.findings-acl.532 kamigaito/SLAHAN/bert/extract_features.py 47a3c792cebb6603 ran MIT (permissive)
ACL Anthology id 2022.acl-long.56 juntaoy/dali-bridging/extract_bert_features/extract_features.py fb8d325e40dbff1b ran Apache-2.0 (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

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