Home › Code › translate

translate

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

translate appears in the code Syntology harvested for 17 papers, as 24 distinct code bodies found in 24 places (a place is one code body under one paper). Of the 17 papers, 12 with a sample that ran: 7 with a run with no instrument failure, 5 where every run was a failure of Syntology's instrument. 4 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 translate 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 24 distinct code bodies named translate: 16 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 7 where Syntology's instrument failed) · 8 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:

1ran · honoured contract
0ran · violated contract
5ran · our draft was wrong
2ran; the contract check could not run
8ran
8unverified
4fingerprinted

Licence is a property of each copy, so it is counted per place: 6 of the 24 places are 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

17 papers shown of 17, newest first; 24 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, and the graph's for 3 papers added by Syntology. 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
Crys-JEPA: Accelerating Crystal Discovery via Embedding Screening and Generative Refinement added by Syntology 2026-05 (from id) liun-online/Crys_JEPA/components/jepa/frame/jepa.py d77256e535c6b4c9 ran · our draft was wrong no licence file found · pointer only
Exploring the Performance of ML/DL Architectures on the MNIST-1D Dataset added by Syntology 2026-02 (from id) michael-beebe/mnist1d/mnist1d/transform.py 62f92a4a7780fe57 ran; the contract check could not run (RAISES) Apache-2.0 (permissive)
Identifying and Mitigating Bottlenecks in Role-Playing Agents: A Systematic Study of Disentangling Character Profile Axes added by Syntology 2026-01 (from id) kwaroran/Risuai/t.py 628b9c2ba7b9a8c2 ran · our draft was wrong fingerprinted GPL-3.0 (copyleft) · pointer only
Lost in Transmission: When and Why LLMs Fail to Reason Globally 13 May 2025 microsoft/bapo/plot_results.py 6a1651f03df882eb ran MIT (permissive)
Large Language Models Share Representations of Latent Grammatical Concepts Across Typologically Diverse Languages 10 Jan 2025 jannik-brinkmann/multilingual-features/translation.py 0d142a44e09ac98d unverified MIT (permissive)
Ranked List Truncation for Large Language Model-based Re-Ranking 28 Apr 2024 chuanmeng/rlt4reranking/format.py a30bc6e83a6ddfa2 unverified no licence file found · pointer only
CultureLLM: Incorporating Cultural Differences into Large Language Models 9 Feb 2024 Scarelette/CultureLLM/data_process.py c6579ce09993d66e ran; the contract check could not run (DEP_MISSING) · metamorphic tier: deterministic no licence file found · pointer only
Regularity as Intrinsic Reward for Free Play 3 Dec 2023 orybkin/lexa-benchmark/envs/utils.py af79d1c1c616741a ran no licence file found · pointer only
OpenAnnotate3D: Open-Vocabulary Auto-Labeling System for Multi-modal 3D Data 20 Oct 2023 fudan-projecttitan/openannotate3d/ICRA24_OpenAnnotate3D/Server/utils/agent.py d9b53d1783cd3fc0 ran no licence file found · pointer only
Estimating Generic 3D Room Structures from 2D Annotations 15 Jun 2023 google-research/cad-estate/src/cad_estate/transformations.py 3d5abafbebad6155 ran fingerprinted Apache-2.0 (permissive)
Can Language Models Solve Graph Problems in Natural Language? 17 May 2023 arthur-heng/nlgraph/evaluation/connectivity.py fac4585dd50fc9b7 ran · our draft was wrong MIT (permissive)
Can Language Models Solve Graph Problems in Natural Language? 17 May 2023 arthur-heng/nlgraph/evaluation/cycle.py 38fdd534407c8c15 ran · our draft was wrong MIT (permissive)
Can Language Models Solve Graph Problems in Natural Language? 17 May 2023 Arthur-Heng/NLGraph/evaluation/flow.py 8e91c3d4139b8193 ran MIT (permissive)
Can Language Models Solve Graph Problems in Natural Language? 17 May 2023 Arthur-Heng/NLGraph/evaluation/gnn.py 04daf61e489de501 ran MIT (permissive)
Can Language Models Solve Graph Problems in Natural Language? 17 May 2023 Arthur-Heng/NLGraph/evaluation/topology.py c8139334cc727e15 ran MIT (permissive)
Can Language Models Solve Graph Problems in Natural Language? 17 May 2023 Arthur-Heng/NLGraph/evaluation/hamilton.py 503a4252204da5ca unverified MIT (permissive)
Can Language Models Solve Graph Problems in Natural Language? 17 May 2023 Arthur-Heng/NLGraph/evaluation/matching.py 92ac2d6e4ce50246 unverified MIT (permissive)
Can Language Models Solve Graph Problems in Natural Language? 17 May 2023 Arthur-Heng/NLGraph/evaluation/shortest_path.py 8ac657fd99c70d31 unverified MIT (permissive)
Help me write a poem: Instruction Tuning as a Vehicle for Collaborative Poetry Writing 25 Oct 2022 vishakhpk/creative-instructions/demo_poetic/demo_poetic.py 38ff82ed42c0eda8 unverified MIT (permissive)
TreeMix: Compositional Constituency-based Data Augmentation for Natural Language Understanding 12 May 2022 magiccircuit/treemix/Augmentation.py f097bb7bef545808 ran · our draft was wrong fingerprinted MIT (permissive)
Certified Defense to Image Transformations via Randomized Smoothing 27 Feb 2020 eth-sri/transformation-smoothing/classifyHeuristic.py 0416a70893e0650d ran · honoured contract Apache-2.0 (permissive)
Automatic Spanish Translation of the SQuAD Dataset for Multilingual Question Answering 11 Dec 2019 lmarent/TranslateAlignRetrieve/src/tar/src/retrieve/translate_retrieve_utils.py 1e4928b96c9f617a unverified MIT (permissive)
EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Tasks 31 Jan 2019 wac81/textda/textda/youdao_translate.py be53242ffe2dc1e4 unverified MIT (permissive)
TransferTransfo: A Transfer Learning Approach for Neural Network Based Conversational Agents 23 Jan 2019 liliaellouz/wabi-sabi/integrate_summary.py b4f520ecd9ceaa5e ran fingerprinted MIT (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