{"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/lowercase","entry":"lowercase","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":1,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":1,"n_places_pointer_only_link_open":0,"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":2,"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":"2305.19709","arxiv_id_is_arxiv":true,"paper":"/paper/xphonebert-a-pre-trained-multilingual-model","title":"XPhoneBERT: A Pre-trained Multilingual Model for Phoneme Representations for Text-to-Speech","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinairesearch/xphonebert","path":"VITS_with_XPhoneBERT/text/cleaners.py","file_url":"https://github.com/vinairesearch/xphonebert/blob/HEAD/VITS_with_XPhoneBERT/text/cleaners.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":"296274b940cb0b32","code_sha256_prefix":"296274b940cb0b32","mcp_get_code":{"code_sha256":"296274b940cb0b32"}},{"arxiv_id":"2305.11938","arxiv_id_is_arxiv":true,"paper":"/paper/xtreme-up-a-user-centric-scarce-data","title":"XTREME-UP: A User-Centric Scarce-Data Benchmark for Under-Represented Languages","date":"2023-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/xtreme-up","path":"baseline/retrieval_tasks.py","file_url":"https://github.com/google-research/xtreme-up/blob/HEAD/baseline/retrieval_tasks.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":"7a4a03eb0fe8c1df","code_sha256_prefix":"7a4a03eb0fe8c1df","mcp_get_code":{"code_sha256":"7a4a03eb0fe8c1df"}},{"arxiv_id":"2108.02271","arxiv_id_is_arxiv":true,"paper":"/paper/daft-exprt-robust-prosody-transfer-across","title":"Daft-Exprt: Cross-Speaker Prosody Transfer on Any Text for Expressive Speech Synthesis","date":null,"month_inferred_from_arxiv_id":"2021-08","title_source":"archive","repo":"ubisoft/ubisoft-laforge-daft-exprt","path":"src/daft_exprt/cleaners.py","file_url":"https://github.com/ubisoft/ubisoft-laforge-daft-exprt/blob/HEAD/src/daft_exprt/cleaners.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":"296274b940cb0b32","code_sha256_prefix":"296274b940cb0b32","mcp_get_code":{"code_sha256":"296274b940cb0b32"}},{"arxiv_id":"2106.06103","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-variational-autoencoder-with","title":"Conditional Variational Autoencoder with Adversarial Learning for End-to-End Text-to-Speech","date":null,"month_inferred_from_arxiv_id":"2021-06","title_source":"archive","repo":"jaywalnut310/glow-tts","path":"text/cleaners.py","file_url":"https://github.com/jaywalnut310/glow-tts/blob/HEAD/text/cleaners.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":"296274b940cb0b32","code_sha256_prefix":"296274b940cb0b32","mcp_get_code":{"code_sha256":"296274b940cb0b32"}},{"arxiv_id":"2105.06337","arxiv_id_is_arxiv":true,"paper":"/paper/grad-tts-a-diffusion-probabilistic-model-for","title":"Grad-TTS: A Diffusion Probabilistic Model for Text-to-Speech","date":"2021-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WelkinYang/GradTTS","path":"text/cleaners.py","file_url":"https://github.com/WelkinYang/GradTTS/blob/HEAD/text/cleaners.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":"296274b940cb0b32","code_sha256_prefix":"296274b940cb0b32","mcp_get_code":{"code_sha256":"296274b940cb0b32"}},{"arxiv_id":"2009.14394","arxiv_id_is_arxiv":true,"paper":"/paper/multiple-word-embeddings-for-increased","title":"Multiple Word Embeddings for Increased Diversity of Representation","date":"2020-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blester125/multi-look-embeddings","path":"scripts/attested.py","file_url":"https://github.com/blester125/multi-look-embeddings/blob/HEAD/scripts/attested.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, blester125/multi-look-embeddings when it was checked","code_sha256":"264e0dff51042ff3","code_sha256_prefix":"264e0dff51042ff3","mcp_get_code":{"code_sha256":"264e0dff51042ff3"}},{"arxiv_id":"2005.11129","arxiv_id_is_arxiv":true,"paper":"/paper/glow-tts-a-generative-flow-for-text-to-speech","title":"Glow-TTS: A Generative Flow for Text-to-Speech via Monotonic Alignment Search","date":"2020-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ankurdhuriya/multispeaker-glow-tts","path":"text/cleaners.py","file_url":"https://github.com/ankurdhuriya/multispeaker-glow-tts/blob/HEAD/text/cleaners.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":"296274b940cb0b32","code_sha256_prefix":"296274b940cb0b32","mcp_get_code":{"code_sha256":"296274b940cb0b32"}},{"arxiv_id":"2005.01245","arxiv_id_is_arxiv":true,"paper":"/paper/can-speaker-augmentation-improve-multi","title":"Can Speaker Augmentation Improve Multi-Speaker End-to-End TTS?","date":"2020-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nii-yamagishilab/multi-speaker-tacotron","path":"synthesize_new_texts/datasets/cleaners.py","file_url":"https://github.com/nii-yamagishilab/multi-speaker-tacotron/blob/HEAD/synthesize_new_texts/datasets/cleaners.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"296274b940cb0b32","code_sha256_prefix":"296274b940cb0b32","mcp_get_code":{"code_sha256":"296274b940cb0b32"}},{"arxiv_id":"1703.10135","arxiv_id_is_arxiv":true,"paper":"/paper/tacotron-towards-end-to-end-speech-synthesis","title":"Tacotron: Towards End-to-End Speech Synthesis","date":"2017-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keithito/tacotron","path":"text/cleaners.py","file_url":"https://github.com/keithito/tacotron/blob/HEAD/text/cleaners.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":"296274b940cb0b32","code_sha256_prefix":"296274b940cb0b32","mcp_get_code":{"code_sha256":"296274b940cb0b32"}}],"record_sha256":"49fe3392a150b76e813b92599f335c3c8ab3dcf7e6b1d7f4166c3b392b0f314b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}