{"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":"/task/machine-translation/papers/4","list_of":"/task/machine-translation","task":"Machine Translation","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_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_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_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":4,"pages_in_order":108,"rows_per_page":100,"rows":[301,400],"of":10752,"counts":{"archive_papers_tagged":10752,"with_a_code_link":2444,"where_syntology_ran_a_sample":477,"not_listed_spam_title":0,"listed":10752,"listed_where_code_ran":477,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":381,"every_run_a_failure_of_syntologys_instrument":96,"listed_with_a_run_with_no_instrument_failure":381,"listed_every_run_a_failure_of_syntologys_instrument":96,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/machine-translation","prev":"/task/machine-translation/papers/3","next":"/task/machine-translation/papers/5","papers":[{"url":"/paper/exploring-sequence-to-sequence-models-for","slug":"exploring-sequence-to-sequence-models-for","title":"Exploring Sequence-to-Sequence Models for SPARQL Pattern Composition","date":"2020-10-21","arxiv_id":"2010.10900","repositories_listed":2,"syntology":null},{"url":"/paper/on-the-potential-of-lexico-logical-alignments","slug":"on-the-potential-of-lexico-logical-alignments","title":"On the Potential of Lexico-logical Alignments for Semantic Parsing to SQL Queries","date":"2020-10-21","arxiv_id":"2010.11246","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-potential-of-lexico-logical-alignments#ran","syntology_url":"https://syntology.ai/paper/2010.11246","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11246"}},"official":{"repos":["tzshi/squall"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/with-little-power-comes-great-responsibility","slug":"with-little-power-comes-great-responsibility","title":"With Little Power Comes Great Responsibility","date":"2020-10-13","arxiv_id":"2010.06595","repositories_listed":2,"syntology":null},{"url":"/paper/gender-coreference-and-bias-evaluation-at-wmt","slug":"gender-coreference-and-bias-evaluation-at-wmt","title":"Gender Coreference and Bias Evaluation at WMT 2020","date":"2020-10-12","arxiv_id":"2010.06018","repositories_listed":2,"syntology":null},{"url":"/paper/converting-the-point-of-view-of-messages","slug":"converting-the-point-of-view-of-messages","title":"Converting the Point of View of Messages Spoken to Virtual Assistants","date":"2020-10-06","arxiv_id":"2010.02600","repositories_listed":2,"syntology":null},{"url":"/paper/why-skip-if-you-can-combine-a-simple","slug":"why-skip-if-you-can-combine-a-simple","title":"Why Skip If You Can Combine: A Simple Knowledge Distillation Technique for Intermediate Layers","date":"2020-10-06","arxiv_id":"2010.03034","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/why-skip-if-you-can-combine-a-simple#ran","syntology_url":"https://syntology.ai/paper/2010.03034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03034"}},"official":{"repos":["yimeng0701/CKD_pytorch"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/a-simple-but-tough-to-beat-data-augmentation","slug":"a-simple-but-tough-to-beat-data-augmentation","title":"A Simple but Tough-to-Beat Data Augmentation Approach for Natural Language Understanding and Generation","date":"2020-09-29","arxiv_id":"2009.13818","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-simple-but-tough-to-beat-data-augmentation#ran","syntology_url":"https://syntology.ai/paper/2009.13818","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13818"}},"official":{"repos":["dinghanshen/Cutoff"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/attention-aware-inference-for-neural","slug":"attention-aware-inference-for-neural","title":"Global-aware Beam Search for Neural Abstractive Summarization","date":"2020-09-15","arxiv_id":"2009.06891","repositories_listed":2,"syntology":null},{"url":"/paper/autoregressive-knowledge-distillation-through","slug":"autoregressive-knowledge-distillation-through","title":"Autoregressive Knowledge Distillation through Imitation Learning","date":"2020-09-15","arxiv_id":"2009.07253","repositories_listed":2,"syntology":null},{"url":"/paper/neural-machine-translation-without-embeddings","slug":"neural-machine-translation-without-embeddings","title":"Neural Machine Translation without Embeddings","date":"2020-08-21","arxiv_id":"2008.09396","repositories_listed":2,"syntology":null},{"url":"/paper/glancing-transformer-for-non-autoregressive","slug":"glancing-transformer-for-non-autoregressive","title":"Glancing Transformer for Non-Autoregressive Neural Machine Translation","date":"2020-08-18","arxiv_id":"2008.07905","repositories_listed":2,"syntology":null},{"url":"/paper/offline-meta-reinforcement-learning-with","slug":"offline-meta-reinforcement-learning-with","title":"Offline Meta-Reinforcement Learning with Advantage Weighting","date":"2020-08-13","arxiv_id":"2008.06043","repositories_listed":2,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/offline-meta-reinforcement-learning-with#ran","syntology_url":"https://syntology.ai/paper/2008.06043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.06043"}},"official":{"repos":["eric-mitchell/macaw"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/delight-very-deep-and-light-weight","slug":"delight-very-deep-and-light-weight","title":"DeLighT: Deep and Light-weight Transformer","date":"2020-08-03","arxiv_id":"2008.00623","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/delight-very-deep-and-light-weight#ran","syntology_url":"https://syntology.ai/paper/2008.00623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.00623"}},"official":{"repos":["sacmehta/delight"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/covost-2-a-massively-multilingual-speech-to","slug":"covost-2-a-massively-multilingual-speech-to","title":"CoVoST 2 and Massively Multilingual Speech-to-Text Translation","date":"2020-07-20","arxiv_id":"2007.10310","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/covost-2-a-massively-multilingual-speech-to#ran","syntology_url":"https://syntology.ai/paper/2007.10310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.10310"}},"official":{"repos":["facebookresearch/covost"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/voice-srib-at-semeval-2020-task-912-sentiment","slug":"voice-srib-at-semeval-2020-task-912-sentiment","title":"Voice@SRIB at SemEval-2020 Task 9 and 12: Stacked Ensembling method for Sentiment and Offensiveness detection in Social Media","date":"2020-07-20","arxiv_id":"2007.10021","repositories_listed":2,"syntology":null},{"url":"/paper/a-multilingual-parallel-corpora-collection-1","slug":"a-multilingual-parallel-corpora-collection-1","title":"A Multilingual Parallel Corpora Collection Effort for Indian Languages","date":"2020-07-15","arxiv_id":"2007.07691","repositories_listed":2,"syntology":{"n":10,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":10,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/a-multilingual-parallel-corpora-collection-1#ran","syntology_url":"https://syntology.ai/paper/2007.07691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.07691"}},"official":null}},{"url":"/paper/learn-to-use-future-information-in","slug":"learn-to-use-future-information-in","title":"Temporally Correlated Task Scheduling for Sequence Learning","date":"2020-07-10","arxiv_id":"2007.05290","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learn-to-use-future-information-in#ran","syntology_url":"https://syntology.ai/paper/2007.05290","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05290"}},"official":{"repos":["microsoft/qlib"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["named_in_paper"]}}},{"url":"/paper/paracrawl-web-scale-acquisition-of-parallel","slug":"paracrawl-web-scale-acquisition-of-parallel","title":"ParaCrawl: Web-Scale Acquisition of Parallel Corpora","date":"2020-07-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/gshard-scaling-giant-models-with-conditional","slug":"gshard-scaling-giant-models-with-conditional","title":"GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding","date":"2020-06-30","arxiv_id":"2006.16668","repositories_listed":2,"syntology":{"n":10,"n_ran":9,"n_constructed":2,"n_ran_checked":4,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":1,"phrase":"9 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gshard-scaling-giant-models-with-conditional#ran","syntology_url":"https://syntology.ai/paper/2006.16668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16668"}},"official":null}},{"url":"/paper/multi-head-attention-collaborate-instead-of","slug":"multi-head-attention-collaborate-instead-of","title":"Multi-Head Attention: Collaborate Instead of Concatenate","date":"2020-06-29","arxiv_id":"2006.16362","repositories_listed":2,"syntology":null},{"url":"/paper/deep-encoder-shallow-decoder-reevaluating-the","slug":"deep-encoder-shallow-decoder-reevaluating-the","title":"Deep Encoder, Shallow Decoder: Reevaluating Non-autoregressive Machine Translation","date":"2020-06-18","arxiv_id":"2006.10369","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-encoder-shallow-decoder-reevaluating-the#ran","syntology_url":"https://syntology.ai/paper/2006.10369","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10369"}},"official":{"repos":["jungokasai/deep-shallow"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/sparse-and-continuous-attention-mechanisms","slug":"sparse-and-continuous-attention-mechanisms","title":"Sparse and Continuous Attention Mechanisms","date":"2020-06-12","arxiv_id":"2006.07214","repositories_listed":2,"syntology":{"n":15,"n_ran":12,"n_constructed":9,"n_ran_checked":9,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"12 ran (of which 9 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sparse-and-continuous-attention-mechanisms#ran","syntology_url":"https://syntology.ai/paper/2006.07214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07214"}},"official":{"repos":["deep-spin/mcan-vqa-continuous-attention"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/cyclegt-unsupervised-graph-to-text-and-text","slug":"cyclegt-unsupervised-graph-to-text-and-text","title":"CycleGT: Unsupervised Graph-to-Text and Text-to-Graph Generation via Cycle Training","date":"2020-06-08","arxiv_id":"2006.04702","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"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) · 0 unverified","sample_list":"/paper/cyclegt-unsupervised-graph-to-text-and-text#ran","syntology_url":"https://syntology.ai/paper/2006.04702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04702"}},"official":{"repos":["QipengGuo/CycleGT"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/neural-syntactic-preordering-for-controlled","slug":"neural-syntactic-preordering-for-controlled","title":"Neural Syntactic Preordering for Controlled Paraphrase Generation","date":"2020-05-05","arxiv_id":"2005.02013","repositories_listed":2,"syntology":null},{"url":"/paper/textattack-a-framework-for-adversarial","slug":"textattack-a-framework-for-adversarial","title":"TextAttack: A Framework for Adversarial Attacks, Data Augmentation, and Adversarial Training in NLP","date":"2020-04-29","arxiv_id":"2005.05909","repositories_listed":2,"syntology":null},{"url":"/paper/towards-character-level-transformer-nmt-by","slug":"towards-character-level-transformer-nmt-by","title":"Towards Reasonably-Sized Character-Level Transformer NMT by Finetuning Subword Systems","date":"2020-04-29","arxiv_id":"2004.14280","repositories_listed":2,"syntology":null},{"url":"/paper/lite-transformer-with-long-short-range","slug":"lite-transformer-with-long-short-range","title":"Lite Transformer with Long-Short Range Attention","date":"2020-04-24","arxiv_id":"2004.11886","repositories_listed":2,"syntology":null},{"url":"/paper/understanding-the-difficulty-of-training","slug":"understanding-the-difficulty-of-training","title":"Understanding the Difficulty of Training Transformers","date":"2020-04-17","arxiv_id":"2004.08249","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":2,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/understanding-the-difficulty-of-training#ran","syntology_url":"https://syntology.ai/paper/2004.08249","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.08249"}},"official":{"repos":["LiyuanLucasLiu/Transforemr-Clinic"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/non-autoregressive-machine-translation-with-1","slug":"non-autoregressive-machine-translation-with-1","title":"Non-Autoregressive Machine Translation with Latent Alignments","date":"2020-04-16","arxiv_id":"2004.07437","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/non-autoregressive-machine-translation-with-1#ran","syntology_url":"https://syntology.ai/paper/2004.07437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.07437"}},"official":null}},{"url":"/paper/balancing-training-for-multilingual-neural","slug":"balancing-training-for-multilingual-neural","title":"Balancing Training for Multilingual Neural Machine Translation","date":"2020-04-14","arxiv_id":"2004.06748","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/balancing-training-for-multilingual-neural#ran","syntology_url":"https://syntology.ai/paper/2004.06748","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.06748"}},"official":{"repos":["cindyxinyiwang/multiDDS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/bleu-might-be-guilty-but-references-are-not","slug":"bleu-might-be-guilty-but-references-are-not","title":"BLEU might be Guilty but References are not Innocent","date":"2020-04-13","arxiv_id":"2004.06063","repositories_listed":2,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/bleu-might-be-guilty-but-references-are-not#ran","syntology_url":"https://syntology.ai/paper/2004.06063","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.06063"}},"official":{"repos":["google/wmt19-paraphrased-references"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/reducing-gender-bias-in-neural-machine","slug":"reducing-gender-bias-in-neural-machine","title":"Reducing Gender Bias in Neural Machine Translation as a Domain Adaptation Problem","date":"2020-04-09","arxiv_id":"2004.04498","repositories_listed":2,"syntology":null},{"url":"/paper/cross-lingual-emotion-intensity-prediction","slug":"cross-lingual-emotion-intensity-prediction","title":"Cross-lingual Emotion Intensity Prediction","date":"2020-04-08","arxiv_id":"2004.04103","repositories_listed":2,"syntology":null},{"url":"/paper/multilingual-enrichment-of-disease-biomedical","slug":"multilingual-enrichment-of-disease-biomedical","title":"Multilingual enrichment of disease biomedical ontologies","date":"2020-04-07","arxiv_id":"2004.03181","repositories_listed":2,"syntology":null},{"url":"/paper/variational-transformers-for-diverse-response","slug":"variational-transformers-for-diverse-response","title":"Variational Transformers for Diverse Response Generation","date":"2020-03-28","arxiv_id":"2003.12738","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/variational-transformers-for-diverse-response#ran","syntology_url":"https://syntology.ai/paper/2003.12738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.12738"}},"official":{"repos":["zlinao/Variational-Transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/synonymous-generalization-in-sequence-to","slug":"synonymous-generalization-in-sequence-to","title":"Revisit Systematic Generalization via Meaningful Learning","date":"2020-03-14","arxiv_id":"2003.06658","repositories_listed":2,"syntology":null},{"url":"/paper/masakhane-machine-translation-for-africa","slug":"masakhane-machine-translation-for-africa","title":"Masakhane -- Machine Translation For Africa","date":"2020-03-13","arxiv_id":"2003.11529","repositories_listed":2,"syntology":null},{"url":"/paper/train-large-then-compress-rethinking-model","slug":"train-large-then-compress-rethinking-model","title":"Train Large, Then Compress: Rethinking Model Size for Efficient Training and Inference of Transformers","date":"2020-02-26","arxiv_id":"2002.11794","repositories_listed":2,"syntology":null},{"url":"/paper/second-order-optimization-made-practical","slug":"second-order-optimization-made-practical","title":"Scalable Second Order Optimization for Deep Learning","date":"2020-02-20","arxiv_id":"2002.09018","repositories_listed":2,"syntology":null},{"url":"/paper/pmindia-a-collection-of-parallel-corpora-of","slug":"pmindia-a-collection-of-parallel-corpora-of","title":"PMIndia -- A Collection of Parallel Corpora of Languages of India","date":"2020-01-27","arxiv_id":"2001.09907","repositories_listed":2,"syntology":null},{"url":"/paper/oteann-estimating-the-transparency-of","slug":"oteann-estimating-the-transparency-of","title":"OTEANN: Estimating the Transparency of Orthographies with an Artificial Neural Network","date":"2019-12-31","arxiv_id":"1912.13321","repositories_listed":2,"syntology":null},{"url":"/paper/explicit-sparse-transformer-concentrated","slug":"explicit-sparse-transformer-concentrated","title":"Explicit Sparse Transformer: Concentrated Attention Through Explicit Selection","date":"2019-12-25","arxiv_id":"1912.11637","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/explicit-sparse-transformer-concentrated#ran","syntology_url":"https://syntology.ai/paper/1912.11637","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11637"}},"official":{"repos":["lancopku/Explicit-Sparse-Transformer"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/m2-meshed-memory-transformer-for-image","slug":"m2-meshed-memory-transformer-for-image","title":"Meshed-Memory Transformer for Image Captioning","date":"2019-12-17","arxiv_id":"1912.08226","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/m2-meshed-memory-transformer-for-image#ran","syntology_url":"https://syntology.ai/paper/1912.08226","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.08226"}},"official":{"repos":["aimagelab/meshed-memory-transformer"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-neural-dialect-translation-with","slug":"unsupervised-neural-dialect-translation-with","title":"Unsupervised Neural Dialect Translation with Commonality and Diversity Modeling","date":"2019-12-11","arxiv_id":"1912.05134","repositories_listed":2,"syntology":null},{"url":"/paper/pidginunmt-unsupervised-neural-machine","slug":"pidginunmt-unsupervised-neural-machine","title":"PidginUNMT: Unsupervised Neural Machine Translation from West African Pidgin to English","date":"2019-12-07","arxiv_id":"1912.03444","repositories_listed":2,"syntology":null},{"url":"/paper/neural-machine-translation-a-review","slug":"neural-machine-translation-a-review","title":"Neural Machine Translation: A Review and Survey","date":"2019-12-04","arxiv_id":"1912.02047","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-machine-translation-a-review#ran","syntology_url":"https://syntology.ai/paper/1912.02047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.02047"}},"official":null}},{"url":"/paper/word-class-embeddings-for-multiclass-text","slug":"word-class-embeddings-for-multiclass-text","title":"Word-Class Embeddings for Multiclass Text Classification","date":"2019-11-26","arxiv_id":"1911.11506","repositories_listed":2,"syntology":null},{"url":"/paper/korean-to-chinese-machine-translation-using","slug":"korean-to-chinese-machine-translation-using","title":"Korean-to-Chinese Machine Translation using Chinese Character as Pivot Clue","date":"2019-11-25","arxiv_id":"1911.11008","repositories_listed":2,"syntology":null},{"url":"/paper/go-from-the-general-to-the-particular-multi","slug":"go-from-the-general-to-the-particular-multi","title":"Go From the General to the Particular: Multi-Domain Translation with Domain Transformation Networks","date":"2019-11-22","arxiv_id":"1911.09912","repositories_listed":2,"syntology":null},{"url":"/paper/fine-tuning-by-curriculum-learning-for-non","slug":"fine-tuning-by-curriculum-learning-for-non","title":"Fine-Tuning by Curriculum Learning for Non-Autoregressive Neural Machine Translation","date":"2019-11-20","arxiv_id":"1911.08717","repositories_listed":2,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fine-tuning-by-curriculum-learning-for-non#ran","syntology_url":"https://syntology.ai/paper/1911.08717","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08717"}},"official":{"repos":["lemmonation/fcl-nat"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-and-improving-layer-1","slug":"understanding-and-improving-layer-1","title":"Understanding and Improving Layer Normalization","date":"2019-11-16","arxiv_id":"1911.07013","repositories_listed":2,"syntology":null},{"url":"/paper/bp-transformer-modelling-long-range-context","slug":"bp-transformer-modelling-long-range-context","title":"BP-Transformer: Modelling Long-Range Context via Binary Partitioning","date":"2019-11-11","arxiv_id":"1911.04070","repositories_listed":2,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/bp-transformer-modelling-long-range-context#ran","syntology_url":"https://syntology.ai/paper/1911.04070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04070"}},"official":{"repos":["yzh119/BPT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/distilling-the-knowledge-of-bert-for-text-1","slug":"distilling-the-knowledge-of-bert-for-text-1","title":"Distilling Knowledge Learned in BERT for Text Generation","date":"2019-11-10","arxiv_id":"1911.03829","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/distilling-the-knowledge-of-bert-for-text-1#ran","syntology_url":"https://syntology.ai/paper/1911.03829","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03829"}},"official":{"repos":["ChenRocks/Distill-BERT-Textgen"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-transformer-models-by-reordering","slug":"improving-transformer-models-by-reordering","title":"Improving Transformer Models by Reordering their Sublayers","date":"2019-11-10","arxiv_id":"1911.03864","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-copy-for-automatic-post-editing-1","slug":"learning-to-copy-for-automatic-post-editing-1","title":"Learning to Copy for Automatic Post-Editing","date":"2019-11-09","arxiv_id":"1911.03627","repositories_listed":2,"syntology":null},{"url":"/paper/domain-robustness-in-neural-machine","slug":"domain-robustness-in-neural-machine","title":"Domain Robustness in Neural Machine Translation","date":"2019-11-08","arxiv_id":"1911.03109","repositories_listed":2,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/domain-robustness-in-neural-machine#ran","syntology_url":"https://syntology.ai/paper/1911.03109","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03109"}},"official":{"repos":["ZurichNLP/domain-robustness","ZurichNLP/sockeye"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-arabic-text-diacritization-state-of-1","slug":"neural-arabic-text-diacritization-state-of-1","title":"Neural Arabic Text Diacritization: State of the Art Results and a Novel Approach for Machine Translation","date":"2019-11-08","arxiv_id":"1911.03531","repositories_listed":2,"syntology":null},{"url":"/paper/data-diversification-an-elegant-strategy-for","slug":"data-diversification-an-elegant-strategy-for","title":"Data Diversification: A Simple Strategy For Neural Machine Translation","date":"2019-11-05","arxiv_id":"1911.01986","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/data-diversification-an-elegant-strategy-for#ran","syntology_url":"https://syntology.ai/paper/1911.01986","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01986"}},"official":{"repos":["nxphi47/data_diversification"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/injecting-hierarchy-with-u-net-transformers","slug":"injecting-hierarchy-with-u-net-transformers","title":"Injecting Hierarchy with U-Net Transformers","date":"2019-10-16","arxiv_id":"1910.10488","repositories_listed":2,"syntology":null},{"url":"/paper/on-dimensional-linguistic-properties-of-the","slug":"on-dimensional-linguistic-properties-of-the","title":"On Dimensional Linguistic Properties of the Word Embedding Space","date":"2019-10-05","arxiv_id":"1910.02211","repositories_listed":2,"syntology":null},{"url":"/paper/slowmo-improving-communication-efficient","slug":"slowmo-improving-communication-efficient","title":"SlowMo: Improving Communication-Efficient Distributed SGD with Slow Momentum","date":"2019-10-01","arxiv_id":"1910.00643","repositories_listed":2,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 3 unverified","sample_list":"/paper/slowmo-improving-communication-efficient#ran","syntology_url":"https://syntology.ai/paper/1910.00643","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00643"}},"official":{"repos":["facebookresearch/fairscale"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/a-comparative-study-on-transformer-vs-rnn-in","slug":"a-comparative-study-on-transformer-vs-rnn-in","title":"A Comparative Study on Transformer vs RNN in Speech Applications","date":"2019-09-13","arxiv_id":"1909.06317","repositories_listed":2,"syntology":null},{"url":"/paper/flowseq-non-autoregressive-conditional","slug":"flowseq-non-autoregressive-conditional","title":"FlowSeq: Non-Autoregressive Conditional Sequence Generation with Generative Flow","date":"2019-09-05","arxiv_id":"1909.02480","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/flowseq-non-autoregressive-conditional#ran","syntology_url":"https://syntology.ai/paper/1909.02480","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.02480"}},"official":{"repos":["XuezheMax/flowseq"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/evaluating-pronominal-anaphora-in-machine","slug":"evaluating-pronominal-anaphora-in-machine","title":"Evaluating Pronominal Anaphora in Machine Translation: An Evaluation Measure and a Test Suite","date":"2019-08-31","arxiv_id":"1909.00131","repositories_listed":2,"syntology":null},{"url":"/paper/towards-making-the-most-of-bert-in-neural","slug":"towards-making-the-most-of-bert-in-neural","title":"Towards Making the Most of BERT in Neural Machine Translation","date":"2019-08-15","arxiv_id":"1908.05672","repositories_listed":2,"syntology":null},{"url":"/paper/structure-invariant-testing-for-machine","slug":"structure-invariant-testing-for-machine","title":"Structure-Invariant Testing for Machine Translation","date":"2019-07-19","arxiv_id":"1907.08710","repositories_listed":2,"syntology":null},{"url":"/paper/creating-a-neural-pedagogical-agent-by","slug":"creating-a-neural-pedagogical-agent-by","title":"Creating A Neural Pedagogical Agent by Jointly Learning to Review and Assess","date":"2019-06-26","arxiv_id":"1906.10910","repositories_listed":2,"syntology":null},{"url":"/paper/retrieving-sequential-information-for-non","slug":"retrieving-sequential-information-for-non","title":"Retrieving Sequential Information for Non-Autoregressive Neural Machine Translation","date":"2019-06-22","arxiv_id":"1906.09444","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/retrieving-sequential-information-for-non#ran","syntology_url":"https://syntology.ai/paper/1906.09444","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.09444"}},"official":{"repos":["ictnlp/RSI-NAT"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/neural-machine-translating-from-natural","slug":"neural-machine-translating-from-natural","title":"Neural Machine Translating from Natural Language to SPARQL","date":"2019-06-21","arxiv_id":"1906.09302","repositories_listed":2,"syntology":null},{"url":"/paper/learning-deep-transformer-models-for-machine","slug":"learning-deep-transformer-models-for-machine","title":"Learning Deep Transformer Models for Machine Translation","date":"2019-06-05","arxiv_id":"1906.01787","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":3,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learning-deep-transformer-models-for-machine#ran","syntology_url":"https://syntology.ai/paper/1906.01787","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01787"}},"official":{"repos":["wangqiangneu/dlcl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/190600591","slug":"190600591","title":"Evaluating Gender Bias in Machine Translation","date":"2019-06-03","arxiv_id":"1906.00591","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190600591#ran","syntology_url":"https://syntology.ai/paper/1906.00591","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00591"}},"official":null}},{"url":"/paper/190600376","slug":"190600376","title":"Domain Adaptation of Neural Machine Translation by Lexicon Induction","date":"2019-06-02","arxiv_id":"1906.00376","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190600376#ran","syntology_url":"https://syntology.ai/paper/1906.00376","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00376"}},"official":null}},{"url":"/paper/diabla-a-corpus-of-bilingual-spontaneous","slug":"diabla-a-corpus-of-bilingual-spontaneous","title":"DiaBLa: A Corpus of Bilingual Spontaneous Written Dialogues for Machine Translation","date":"2019-05-30","arxiv_id":"1905.13354","repositories_listed":2,"syntology":null},{"url":"/paper/revisiting-low-resource-neural-machine","slug":"revisiting-low-resource-neural-machine","title":"Revisiting Low-Resource Neural Machine Translation: A Case Study","date":"2019-05-28","arxiv_id":"1905.11901","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/revisiting-low-resource-neural-machine#ran","syntology_url":"https://syntology.ai/paper/1905.11901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11901"}},"official":null}},{"url":"/paper/cdsa-cross-dimensional-self-attention-for","slug":"cdsa-cross-dimensional-self-attention-for","title":"CDSA: Cross-Dimensional Self-Attention for Multivariate, Geo-tagged Time Series Imputation","date":"2019-05-23","arxiv_id":"1905.09904","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cdsa-cross-dimensional-self-attention-for#ran","syntology_url":"https://syntology.ai/paper/1905.09904","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09904"}},"official":null}},{"url":"/paper/190506596","slug":"190506596","title":"Joint Source-Target Self Attention with Locality Constraints","date":"2019-05-16","arxiv_id":"1905.06596","repositories_listed":2,"syntology":null},{"url":"/paper/synchronous-bidirectional-neural-machine","slug":"synchronous-bidirectional-neural-machine","title":"Synchronous Bidirectional Neural Machine Translation","date":"2019-05-13","arxiv_id":"1905.04847","repositories_listed":2,"syntology":null},{"url":"/paper/190409324","slug":"190409324","title":"Mask-Predict: Parallel Decoding of Conditional Masked Language Models","date":"2019-04-19","arxiv_id":"1904.09324","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190409324#ran","syntology_url":"https://syntology.ai/paper/1904.09324","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09324"}},"official":{"repos":["facebookresearch/Mask-Predict"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/consistency-by-agreement-in-zero-shot-neural","slug":"consistency-by-agreement-in-zero-shot-neural","title":"Consistency by Agreement in Zero-shot Neural Machine Translation","date":"2019-04-04","arxiv_id":"1904.02338","repositories_listed":2,"syntology":null},{"url":"/paper/a-large-scale-comparison-of-historical-text","slug":"a-large-scale-comparison-of-historical-text","title":"A Large-Scale Comparison of Historical Text Normalization Systems","date":"2019-04-03","arxiv_id":"1904.02036","repositories_listed":2,"syntology":null},{"url":"/paper/compare-mt-a-tool-for-holistic-comparison-of","slug":"compare-mt-a-tool-for-holistic-comparison-of","title":"compare-mt: A Tool for Holistic Comparison of Language Generation Systems","date":"2019-03-19","arxiv_id":"1903.07926","repositories_listed":2,"syntology":null},{"url":"/paper/two-new-evaluation-datasets-for-low-resource","slug":"two-new-evaluation-datasets-for-low-resource","title":"The FLoRes Evaluation Datasets for Low-Resource Machine Translation: Nepali-English and Sinhala-English","date":"2019-02-04","arxiv_id":"1902.01382","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/two-new-evaluation-datasets-for-low-resource#ran","syntology_url":"https://syntology.ai/paper/1902.01382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.01382"}},"official":{"repos":["facebookresearch/flores"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/glyce-glyph-vectors-for-chinese-character","slug":"glyce-glyph-vectors-for-chinese-character","title":"Glyce: Glyph-vectors for Chinese Character Representations","date":"2019-01-29","arxiv_id":"1901.10125","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/glyce-glyph-vectors-for-chinese-character#ran","syntology_url":"https://syntology.ai/paper/1901.10125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10125"}},"official":{"repos":["ShannonAI/glyce"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/found-in-translation-learning-robust-joint","slug":"found-in-translation-learning-robust-joint","title":"Found in Translation: Learning Robust Joint Representations by Cyclic Translations Between Modalities","date":"2018-12-19","arxiv_id":"1812.07809","repositories_listed":2,"syntology":null},{"url":"/paper/learning-continuous-and-data-driven-molecular","slug":"learning-continuous-and-data-driven-molecular","title":"Learning Continuous and Data-Driven Molecular Descriptors by Translating Equivalent Chemical Representations","date":"2018-11-19","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/transfer-learning-in-multilingual-neural","slug":"transfer-learning-in-multilingual-neural","title":"Transfer Learning in Multilingual Neural Machine Translation with Dynamic Vocabulary","date":"2018-11-03","arxiv_id":"1811.01137","repositories_listed":2,"syntology":null},{"url":"/paper/how2-a-large-scale-dataset-for-multimodal","slug":"how2-a-large-scale-dataset-for-multimodal","title":"How2: A Large-scale Dataset for Multimodal Language Understanding","date":"2018-11-01","arxiv_id":"1811.00347","repositories_listed":2,"syntology":null},{"url":"/paper/multi-source-synthetic-treebank-creation-for","slug":"multi-source-synthetic-treebank-creation-for","title":"Multi-source synthetic treebank creation for improved cross-lingual dependency parsing","date":"2018-11-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/abstractive-summarization-using-attentive","slug":"abstractive-summarization-using-attentive","title":"Abstractive Summarization Using Attentive Neural Techniques","date":"2018-10-20","arxiv_id":"1810.08838","repositories_listed":2,"syntology":null},{"url":"/paper/auto-encoding-dictionary-definitions-into","slug":"auto-encoding-dictionary-definitions-into","title":"Auto-Encoding Dictionary Definitions into Consistent Word Embeddings","date":"2018-10-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/semi-supervised-sequence-modeling-with-cross","slug":"semi-supervised-sequence-modeling-with-cross","title":"Semi-Supervised Sequence Modeling with Cross-View Training","date":"2018-09-22","arxiv_id":"1809.08370","repositories_listed":2,"syntology":null},{"url":"/paper/frage-frequency-agnostic-word-representation","slug":"frage-frequency-agnostic-word-representation","title":"FRAGE: Frequency-Agnostic Word Representation","date":"2018-09-18","arxiv_id":"1809.06858","repositories_listed":2,"syntology":null},{"url":"/paper/document-level-neural-machine-translation","slug":"document-level-neural-machine-translation","title":"Document-Level Neural Machine Translation with Hierarchical Attention Networks","date":"2018-09-05","arxiv_id":"1809.01576","repositories_listed":2,"syntology":null},{"url":"/paper/mtnt-a-testbed-for-machine-translation-of","slug":"mtnt-a-testbed-for-machine-translation-of","title":"MTNT: A Testbed for Machine Translation of Noisy Text","date":"2018-09-02","arxiv_id":"1809.00388","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mtnt-a-testbed-for-machine-translation-of#ran","syntology_url":"https://syntology.ai/paper/1809.00388","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.00388"}},"official":{"repos":["pmichel31415/mtnt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/neural-machine-translation-of-text-from-non","slug":"neural-machine-translation-of-text-from-non","title":"Neural Machine Translation of Text from Non-Native Speakers","date":"2018-08-19","arxiv_id":"1808.06267","repositories_listed":2,"syntology":null},{"url":"/paper/deepquest-a-framework-for-neural-based","slug":"deepquest-a-framework-for-neural-based","title":"deepQuest: A Framework for Neural-based Quality Estimation","date":"2018-08-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/encoder-decoder-methods-for-text","slug":"encoder-decoder-methods-for-text","title":"Encoder-Decoder Methods for Text Normalization","date":"2018-08-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/they-exist-introducing-plural-mentions-to","slug":"they-exist-introducing-plural-mentions-to","title":"They Exist! Introducing Plural Mentions to Coreference Resolution and Entity Linking","date":"2018-08-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/graph-to-sequence-learning-using-gated-graph","slug":"graph-to-sequence-learning-using-gated-graph","title":"Graph-to-Sequence Learning using Gated Graph Neural Networks","date":"2018-06-26","arxiv_id":"1806.09835","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-to-sequence-learning-using-gated-graph#ran","syntology_url":"https://syntology.ai/paper/1806.09835","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.09835"}},"official":{"repos":["beckdaniel/acl2018_graph2seq"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/multi-task-neural-models-for-translating","slug":"multi-task-neural-models-for-translating","title":"Multi-Task Neural Models for Translating Between Styles Within and Across Languages","date":"2018-06-12","arxiv_id":"1806.04357","repositories_listed":2,"syntology":null}],"record_sha256":"0f87c7de8563cc83bac10723cb1edd3eae1442f5fd6f4a9e3cd2d454f5c558ad","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}