{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/strip-accents","entry":"strip_accents","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":3,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":7,"n_places":10,"n_places_pointer_only":3,"n_places_pointer_only_link_open":2,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":7,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2601.02578","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-02578","title":"DataParasite Enables Scalable and Repurposable Online Data Curation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"emeryberger/CSrankings","path":"util/old/split-csrankings.py","file_url":"https://github.com/emeryberger/CSrankings/blob/HEAD/util/old/split-csrankings.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, emeryberger/CSrankings (NOASSERTION)","code_sha256":"b34f5dfa407987e8","code_sha256_prefix":"b34f5dfa407987e8","mcp_get_code":{"code_sha256":"b34f5dfa407987e8"}},{"arxiv_id":"2304.01196","arxiv_id_is_arxiv":true,"paper":"/paper/baize-an-open-source-chat-model-with","title":"Baize: An Open-Source Chat Model with Parameter-Efficient Tuning on Self-Chat Data","date":"2023-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ilyagusev/rulm","path":"data_processing/convert_wiki.py","file_url":"https://github.com/ilyagusev/rulm/blob/HEAD/data_processing/convert_wiki.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from emeryberger/CSrankings, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"b34f5dfa407987e8","code_sha256_prefix":"b34f5dfa407987e8","mcp_get_code":{"code_sha256":"b34f5dfa407987e8"}},{"arxiv_id":"2109.08359","arxiv_id_is_arxiv":true,"paper":"/paper/distilling-linguistic-context-for-language","title":"Distilling Linguistic Context for Language Model Compression","date":"2021-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"geondopark/ckd","path":"data_augment.py","file_url":"https://github.com/geondopark/ckd/blob/HEAD/data_augment.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"22fcb8611ccd6b38","code_sha256_prefix":"22fcb8611ccd6b38","mcp_get_code":{"code_sha256":"22fcb8611ccd6b38"}},{"arxiv_id":"2105.02732","arxiv_id_is_arxiv":true,"paper":"/paper/what-s-in-the-box-an-analysis-of-undesirable","title":"What's in the Box? A Preliminary Analysis of Undesirable Content in the Common Crawl Corpus","date":"2021-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"josephdviviano/whatsinthebox","path":"witb/utils/textutils.py","file_url":"https://github.com/josephdviviano/whatsinthebox/blob/HEAD/witb/utils/textutils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2e55f8f1a1f1444","code_sha256_prefix":"c2e55f8f1a1f1444","mcp_get_code":{"code_sha256":"c2e55f8f1a1f1444"}},{"arxiv_id":"2006.07264","arxiv_id_is_arxiv":true,"paper":"/paper/low-resource-languages-a-review-of-past-work","title":"Low-resource Languages: A Review of Past Work and Future Challenges","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielinux7/Multilingual-Parallel-Corpus","path":"src/utils/ab/parse_dictionary.py","file_url":"https://github.com/danielinux7/Multilingual-Parallel-Corpus/blob/HEAD/src/utils/ab/parse_dictionary.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"048d5b46b5abc501","code_sha256_prefix":"048d5b46b5abc501","mcp_get_code":{"code_sha256":"048d5b46b5abc501"}},{"arxiv_id":"2003.13027","arxiv_id_is_arxiv":true,"paper":"/paper/abstractive-text-summarization-based-on","title":"Abstractive Text Summarization based on Language Model Conditioning and Locality Modeling","date":"2020-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"axenov/BERT-Summ-OpenNMT","path":"summarizer.py","file_url":"https://github.com/axenov/BERT-Summ-OpenNMT/blob/HEAD/summarizer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4b6fcd8cda10ebc3","code_sha256_prefix":"4b6fcd8cda10ebc3","mcp_get_code":{"code_sha256":"4b6fcd8cda10ebc3"}},{"arxiv_id":"2003.10564","arxiv_id_is_arxiv":true,"paper":"/paper/improving-yoruba-diacritic-restoration","title":"Improving Yorùbá Diacritic Restoration","date":"2020-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Niger-Volta-LTI/yoruba-adr","path":"src/make_parallel_text.py","file_url":"https://github.com/Niger-Volta-LTI/yoruba-adr/blob/HEAD/src/make_parallel_text.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"043014f7b6c20907","code_sha256_prefix":"043014f7b6c20907","mcp_get_code":{"code_sha256":"043014f7b6c20907"}},{"arxiv_id":"1910.06262","arxiv_id_is_arxiv":true,"paper":"/paper/restoring-ancient-text-using-deep-learning-a","title":"Restoring ancient text using deep learning: a case study on Greek epigraphy","date":"2019-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sommerschield/ancient-text-restoration","path":"pythia/util/text_clean.py","file_url":"https://github.com/sommerschield/ancient-text-restoration/blob/HEAD/pythia/util/text_clean.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from emeryberger/CSrankings, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"b34f5dfa407987e8","code_sha256_prefix":"b34f5dfa407987e8","mcp_get_code":{"code_sha256":"b34f5dfa407987e8"}},{"arxiv_id":"1902.01718","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-open-domain-question-answering","title":"End-to-End Open-Domain Question Answering with BERTserini","date":"2019-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rsvp-ai/bertserini","path":"bertserini/utils/utils.py","file_url":"https://github.com/rsvp-ai/bertserini/blob/HEAD/bertserini/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b668a6a9dda0f7b1","code_sha256_prefix":"b668a6a9dda0f7b1","mcp_get_code":{"code_sha256":"b668a6a9dda0f7b1"}},{"arxiv_id":"1805.05492","arxiv_id_is_arxiv":true,"paper":"/paper/did-the-model-understand-the-question","title":"Did the Model Understand the Question?","date":"2018-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pramodkaushik/np_analysis","path":"neural_programmer/wiki_data.py","file_url":"https://github.com/pramodkaushik/np_analysis/blob/HEAD/neural_programmer/wiki_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8378d8e8e76a6e45","code_sha256_prefix":"8378d8e8e76a6e45","mcp_get_code":{"code_sha256":"8378d8e8e76a6e45"}}],"record_sha256":"7092cbe9ca9ed21aca8929c21b21d381804b785c7475bac986dcd9aedcef11cd","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}