{"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/19","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":19,"pages_in_order":108,"rows_per_page":100,"rows":[1801,1900],"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/18","next":"/task/machine-translation/papers/20","papers":[{"url":"/paper/sedar-a-large-scale-french-english-financial","slug":"sedar-a-large-scale-french-english-financial","title":"SEDAR: a Large Scale French-English Financial Domain Parallel Corpus","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/accurate-word-alignment-induction-from-neural","slug":"accurate-word-alignment-induction-from-neural","title":"Accurate Word Alignment Induction from Neural Machine Translation","date":"2020-04-30","arxiv_id":"2004.14837","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-machine-translation-evaluation-in","slug":"automatic-machine-translation-evaluation-in","title":"Automatic Machine Translation Evaluation in Many Languages via Zero-Shot Paraphrasing","date":"2020-04-30","arxiv_id":"2004.14564","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-linguistic-typology-and-multilingual","slug":"bridging-linguistic-typology-and-multilingual","title":"Bridging Linguistic Typology and Multilingual Machine Translation with Multi-View Language Representations","date":"2020-04-30","arxiv_id":"2004.14923","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bridging-linguistic-typology-and-multilingual#ran","syntology_url":"https://syntology.ai/paper/2004.14923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14923"}},"official":{"repos":["aoncevay/multiview-langrep"],"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":["official"]}}},{"url":"/paper/explicit-representation-of-the-translation","slug":"explicit-representation-of-the-translation","title":"A Study in Improving BLEU Reference Coverage with Diverse Automatic Paraphrasing","date":"2020-04-30","arxiv_id":"2004.14989","repositories_listed":1,"syntology":null},{"url":"/paper/imitation-attacks-and-defenses-for-black-box","slug":"imitation-attacks-and-defenses-for-black-box","title":"Imitation Attacks and Defenses for Black-box Machine Translation Systems","date":"2020-04-30","arxiv_id":"2004.15015","repositories_listed":1,"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":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) · 0 unverified","sample_list":"/paper/imitation-attacks-and-defenses-for-black-box#ran","syntology_url":"https://syntology.ai/paper/2004.15015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.15015"}},"official":{"repos":["Eric-Wallace/adversarial-mt"],"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/language-model-prior-for-low-resource-neural","slug":"language-model-prior-for-low-resource-neural","title":"Language Model Prior for Low-Resource Neural Machine Translation","date":"2020-04-30","arxiv_id":"2004.14928","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/language-model-prior-for-low-resource-neural#ran","syntology_url":"https://syntology.ai/paper/2004.14928","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14928"}},"official":{"repos":["cbaziotis/lm-prior-for-nmt"],"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":["official"]}}},{"url":"/paper/nubia-neural-based-interchangeability","slug":"nubia-neural-based-interchangeability","title":"NUBIA: NeUral Based Interchangeability Assessor for Text Generation","date":"2020-04-30","arxiv_id":"2004.14667","repositories_listed":1,"syntology":null},{"url":"/paper/simulated-multiple-reference-training","slug":"simulated-multiple-reference-training","title":"Simulated Multiple Reference Training Improves Low-Resource Machine Translation","date":"2020-04-30","arxiv_id":"2004.14524","repositories_listed":1,"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/simulated-multiple-reference-training#ran","syntology_url":"https://syntology.ai/paper/2004.14524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14524"}},"official":null}},{"url":"/paper/use-of-machine-translation-to-obtain-labeled","slug":"use-of-machine-translation-to-obtain-labeled","title":"Data and Representation for Turkish Natural Language Inference","date":"2020-04-30","arxiv_id":"2004.14963","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-subword-regularization-for-robust","slug":"adversarial-subword-regularization-for-robust","title":"Adversarial Subword Regularization for Robust Neural Machine Translation","date":"2020-04-29","arxiv_id":"2004.14109","repositories_listed":1,"syntology":null},{"url":"/paper/learning-non-monotonic-automatic-post-editing","slug":"learning-non-monotonic-automatic-post-editing","title":"Learning Non-Monotonic Automatic Post-Editing of Translations from Human Orderings","date":"2020-04-29","arxiv_id":"2004.14120","repositories_listed":1,"syntology":null},{"url":"/paper/multiscale-collaborative-deep-models-for","slug":"multiscale-collaborative-deep-models-for","title":"Multiscale Collaborative Deep Models for Neural Machine Translation","date":"2020-04-29","arxiv_id":"2004.14021","repositories_listed":1,"syntology":null},{"url":"/paper/conversational-word-embedding-for-retrieval","slug":"conversational-word-embedding-for-retrieval","title":"Conversational Word Embedding for Retrieval-Based Dialog System","date":"2020-04-28","arxiv_id":"2004.13249","repositories_listed":1,"syntology":null},{"url":"/paper/scheduled-drophead-a-regularization-method","slug":"scheduled-drophead-a-regularization-method","title":"Scheduled DropHead: A Regularization Method for Transformer Models","date":"2020-04-28","arxiv_id":"2004.13342","repositories_listed":1,"syntology":null},{"url":"/paper/towards-prediction-explainability-through","slug":"towards-prediction-explainability-through","title":"The Explanation Game: Towards Prediction Explainability through Sparse Communication","date":"2020-04-28","arxiv_id":"2004.13876","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/towards-prediction-explainability-through#ran","syntology_url":"https://syntology.ai/paper/2004.13876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13876"}},"official":{"repos":["deep-spin/spec"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lexically-constrained-neural-machine","slug":"lexically-constrained-neural-machine","title":"Lexically Constrained Neural Machine Translation with Levenshtein Transformer","date":"2020-04-27","arxiv_id":"2004.12681","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"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) · 2 unverified","sample_list":"/paper/lexically-constrained-neural-machine#ran","syntology_url":"https://syntology.ai/paper/2004.12681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12681"}},"official":{"repos":["raymondhs/constrained-levt"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-machine-translation-with-monte-carlo","slug":"neural-machine-translation-with-monte-carlo","title":"Neural Machine Translation with Monte-Carlo Tree Search","date":"2020-04-27","arxiv_id":"2004.12527","repositories_listed":1,"syntology":null},{"url":"/paper/all-word-embeddings-from-one-embedding","slug":"all-word-embeddings-from-one-embedding","title":"All Word Embeddings from One Embedding","date":"2020-04-25","arxiv_id":"2004.12073","repositories_listed":1,"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/all-word-embeddings-from-one-embedding#ran","syntology_url":"https://syntology.ai/paper/2004.12073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12073"}},"official":{"repos":["takase/alone_seq2seq"],"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/on-sparsifying-encoder-outputs-in-sequence-to","slug":"on-sparsifying-encoder-outputs-in-sequence-to","title":"On Sparsifying Encoder Outputs in Sequence-to-Sequence Models","date":"2020-04-24","arxiv_id":"2004.11854","repositories_listed":1,"syntology":null},{"url":"/paper/practical-comparable-data-collection-for-low","slug":"practical-comparable-data-collection-for-low","title":"Practical Comparable Data Collection for Low-Resource Languages via Images","date":"2020-04-24","arxiv_id":"2004.11954","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/practical-comparable-data-collection-for-low#ran","syntology_url":"https://syntology.ai/paper/2004.11954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11954"}},"official":{"repos":["madaan/PML4DC-Comparable-Data-Collection"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/correct-me-if-you-can-learning-from-error","slug":"correct-me-if-you-can-learning-from-error","title":"Correct Me If You Can: Learning from Error Corrections and Markings","date":"2020-04-23","arxiv_id":"2004.11222","repositories_listed":1,"syntology":null},{"url":"/paper/residual-energy-based-models-for-text-1","slug":"residual-energy-based-models-for-text-1","title":"Residual Energy-Based Models for Text Generation","date":"2020-04-22","arxiv_id":"2004.11714","repositories_listed":1,"syntology":null},{"url":"/paper/attention-module-is-not-only-a-weight","slug":"attention-module-is-not-only-a-weight","title":"Attention is Not Only a Weight: Analyzing Transformers with Vector Norms","date":"2020-04-21","arxiv_id":"2004.10102","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attention-module-is-not-only-a-weight#ran","syntology_url":"https://syntology.ai/paper/2004.10102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10102"}},"official":{"repos":["gorokoba560/norm-analysis-of-transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/contextual-neural-machine-translation","slug":"contextual-neural-machine-translation","title":"Contextual Neural Machine Translation Improves Translation of Cataphoric Pronouns","date":"2020-04-21","arxiv_id":"2004.09894","repositories_listed":1,"syntology":null},{"url":"/paper/espnet-st-all-in-one-speech-translation","slug":"espnet-st-all-in-one-speech-translation","title":"ESPnet-ST: All-in-One Speech Translation Toolkit","date":"2020-04-21","arxiv_id":"2004.10234","repositories_listed":1,"syntology":null},{"url":"/paper/neural-machine-translation-for-low-resourced","slug":"neural-machine-translation-for-low-resourced","title":"Neural Machine Translation for Low-Resourced Indian Languages","date":"2020-04-19","arxiv_id":"2004.13819","repositories_listed":1,"syntology":null},{"url":"/paper/transformer-based-grapheme-to-phoneme-1","slug":"transformer-based-grapheme-to-phoneme-1","title":"Transformer based Grapheme-to-Phoneme Conversion","date":"2020-04-14","arxiv_id":"2004.06338","repositories_listed":1,"syntology":null},{"url":"/paper/neural-machine-translation-challenges","slug":"neural-machine-translation-challenges","title":"Neural Machine Translation: Challenges, Progress and Future","date":"2020-04-13","arxiv_id":"2004.05809","repositories_listed":1,"syntology":null},{"url":"/paper/lareqa-language-agnostic-answer-retrieval","slug":"lareqa-language-agnostic-answer-retrieval","title":"LAReQA: Language-agnostic answer retrieval from a multilingual pool","date":"2020-04-11","arxiv_id":"2004.05484","repositories_listed":1,"syntology":null},{"url":"/paper/on-optimal-transformer-depth-for-low-resource","slug":"on-optimal-transformer-depth-for-low-resource","title":"On Optimal Transformer Depth for Low-Resource Language Translation","date":"2020-04-09","arxiv_id":"2004.04418","repositories_listed":1,"syntology":null},{"url":"/paper/translation-artifacts-in-cross-lingual","slug":"translation-artifacts-in-cross-lingual","title":"Translation Artifacts in Cross-lingual Transfer Learning","date":"2020-04-09","arxiv_id":"2004.04721","repositories_listed":1,"syntology":null},{"url":"/paper/transfer-learning-and-subword-sampling-for","slug":"transfer-learning-and-subword-sampling-for","title":"Transfer learning and subword sampling for asymmetric-resource one-to-many neural translation","date":"2020-04-08","arxiv_id":"2004.04002","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-data-selection-and-weighting-for","slug":"dynamic-data-selection-and-weighting-for","title":"Dynamic Data Selection and Weighting for Iterative Back-Translation","date":"2020-04-07","arxiv_id":"2004.03672","repositories_listed":1,"syntology":null},{"url":"/paper/graph-to-tree-neural-networks-for-learning","slug":"graph-to-tree-neural-networks-for-learning","title":"Graph-to-Tree Neural Networks for Learning Structured Input-Output Translation with Applications to Semantic Parsing and Math Word Problem","date":"2020-04-07","arxiv_id":"2004.13781","repositories_listed":1,"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-tree-neural-networks-for-learning#ran","syntology_url":"https://syntology.ai/paper/2004.13781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13781"}},"official":{"repos":["IBM/Graph2Tree"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-multimodal-simultaneous-neural","slug":"towards-multimodal-simultaneous-neural","title":"Towards Multimodal Simultaneous Neural Machine Translation","date":"2020-04-07","arxiv_id":"2004.03180","repositories_listed":1,"syntology":null},{"url":"/paper/bootstrapping-a-crosslingual-semantic-parser","slug":"bootstrapping-a-crosslingual-semantic-parser","title":"Bootstrapping a Crosslingual Semantic Parser","date":"2020-04-06","arxiv_id":"2004.02585","repositories_listed":1,"syntology":null},{"url":"/paper/neural-machine-translation-with-imbalanced","slug":"neural-machine-translation-with-imbalanced","title":"Finding the Optimal Vocabulary Size for Neural Machine Translation","date":"2020-04-05","arxiv_id":"2004.02334","repositories_listed":1,"syntology":null},{"url":"/paper/reference-language-based-unsupervised-neural","slug":"reference-language-based-unsupervised-neural","title":"Reference Language based Unsupervised Neural Machine Translation","date":"2020-04-05","arxiv_id":"2004.02127","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-domain-clusters-in-pretrained","slug":"unsupervised-domain-clusters-in-pretrained","title":"Unsupervised Domain Clusters in Pretrained Language Models","date":"2020-04-05","arxiv_id":"2004.02105","repositories_listed":1,"syntology":null},{"url":"/paper/a-set-of-recommendations-for-assessing-human","slug":"a-set-of-recommendations-for-assessing-human","title":"A Set of Recommendations for Assessing Human-Machine Parity in Language Translation","date":"2020-04-03","arxiv_id":"2004.01694","repositories_listed":1,"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-set-of-recommendations-for-assessing-human#ran","syntology_url":"https://syntology.ai/paper/2004.01694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01694"}},"official":{"repos":["ZurichNLP/mt-parity-assessment-data"],"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/aligned-cross-entropy-for-non-autoregressive","slug":"aligned-cross-entropy-for-non-autoregressive","title":"Aligned Cross Entropy for Non-Autoregressive Machine Translation","date":"2020-04-03","arxiv_id":"2004.01655","repositories_listed":1,"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/aligned-cross-entropy-for-non-autoregressive#ran","syntology_url":"https://syntology.ai/paper/2004.01655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01655"}},"official":null}},{"url":"/paper/low-resource-neural-machine-translation-a","slug":"low-resource-neural-machine-translation-a","title":"Low Resource Neural Machine Translation: A Benchmark for Five African Languages","date":"2020-03-31","arxiv_id":"2003.14402","repositories_listed":1,"syntology":null},{"url":"/paper/towards-supervised-and-unsupervised-neural","slug":"towards-supervised-and-unsupervised-neural","title":"Towards Supervised and Unsupervised Neural Machine Translation Baselines for Nigerian Pidgin","date":"2020-03-27","arxiv_id":"2003.12660","repositories_listed":1,"syntology":null},{"url":"/paper/ffr-v1-0-fon-french-neural-machine","slug":"ffr-v1-0-fon-french-neural-machine","title":"FFR V1.0: Fon-French Neural Machine Translation","date":"2020-03-26","arxiv_id":"2003.12111","repositories_listed":1,"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/ffr-v1-0-fon-french-neural-machine#ran","syntology_url":"https://syntology.ai/paper/2003.12111","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.12111"}},"official":{"repos":["bonaventuredossou/ffr-v1"],"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/language-technology-programme-for-icelandic","slug":"language-technology-programme-for-icelandic","title":"Language Technology Programme for Icelandic 2019-2023","date":"2020-03-20","arxiv_id":"2003.09244","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-batch-normalization-in","slug":"rethinking-batch-normalization-in","title":"PowerNorm: Rethinking Batch Normalization in Transformers","date":"2020-03-17","arxiv_id":"2003.07845","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-encode-position-for-transformer","slug":"learning-to-encode-position-for-transformer","title":"Learning to Encode Position for Transformer with Continuous Dynamical Model","date":"2020-03-13","arxiv_id":"2003.09229","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":2,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"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) · 3 unverified","sample_list":"/paper/learning-to-encode-position-for-transformer#ran","syntology_url":"https://syntology.ai/paper/2003.09229","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09229"}},"official":null}},{"url":"/paper/investigating-entity-knowledge-in-bert-with-1","slug":"investigating-entity-knowledge-in-bert-with-1","title":"Investigating Entity Knowledge in BERT with Simple Neural End-To-End Entity Linking","date":"2020-03-11","arxiv_id":"2003.05473","repositories_listed":1,"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/investigating-entity-knowledge-in-bert-with-1#ran","syntology_url":"https://syntology.ai/paper/2003.05473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05473"}},"official":{"repos":["samuelbroscheit/entity_knowledge_in_bert"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tigrinya-neural-machine-translation-with","slug":"tigrinya-neural-machine-translation-with","title":"Tigrinya Neural Machine Translation with Transfer Learning for Humanitarian Response","date":"2020-03-09","arxiv_id":"2003.11523","repositories_listed":1,"syntology":null},{"url":"/paper/morfessor-emprune-improved-subword","slug":"morfessor-emprune-improved-subword","title":"Morfessor EM+Prune: Improved Subword Segmentation with Expectation Maximization and Pruning","date":"2020-03-06","arxiv_id":"2003.03131","repositories_listed":1,"syntology":null},{"url":"/paper/towards-automatic-face-to-face-translation-1","slug":"towards-automatic-face-to-face-translation-1","title":"Towards Automatic Face-to-Face Translation","date":"2020-03-01","arxiv_id":"2003.00418","repositories_listed":1,"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/towards-automatic-face-to-face-translation-1#ran","syntology_url":"https://syntology.ai/paper/2003.00418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00418"}},"official":{"repos":["Rudrabha/LipGAN"],"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/marathi-to-english-neural-machine-translation","slug":"marathi-to-english-neural-machine-translation","title":"Marathi To English Neural Machine Translation With Near Perfect Corpus And Transformers","date":"2020-02-26","arxiv_id":"2002.11643","repositories_listed":1,"syntology":null},{"url":"/paper/guiding-attention-in-sequence-to-sequence","slug":"guiding-attention-in-sequence-to-sequence","title":"Guiding attention in Sequence-to-sequence models for Dialogue Act prediction","date":"2020-02-20","arxiv_id":"2002.08801","repositories_listed":1,"syntology":null},{"url":"/paper/toward-making-the-most-of-context-in-neural","slug":"toward-making-the-most-of-context-in-neural","title":"Towards Making the Most of Context in Neural Machine Translation","date":"2020-02-19","arxiv_id":"2002.07982","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-of-deep-learning-techniques-for-2","slug":"a-survey-of-deep-learning-techniques-for-2","title":"A Survey of Deep Learning Techniques for Neural Machine Translation","date":"2020-02-18","arxiv_id":"2002.07526","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-in-structured-prediction","slug":"uncertainty-in-structured-prediction","title":"Uncertainty Estimation in Autoregressive Structured Prediction","date":"2020-02-18","arxiv_id":"2002.07650","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-discrepancy-between-density-estimation","slug":"on-the-discrepancy-between-density-estimation","title":"On the Discrepancy between Density Estimation and Sequence Generation","date":"2020-02-17","arxiv_id":"2002.07233","repositories_listed":1,"syntology":null},{"url":"/paper/multi-layer-representation-fusion-for-neural-2","slug":"multi-layer-representation-fusion-for-neural-2","title":"Multi-layer Representation Fusion for Neural Machine Translation","date":"2020-02-16","arxiv_id":"2002.06714","repositories_listed":1,"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/multi-layer-representation-fusion-for-neural-2#ran","syntology_url":"https://syntology.ai/paper/2002.06714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06714"}},"official":null}},{"url":"/paper/neural-machine-translation-with-joint","slug":"neural-machine-translation-with-joint","title":"Neural Machine Translation with Joint Representation","date":"2020-02-16","arxiv_id":"2002.06546","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-for-source-code-modeling-and","slug":"deep-learning-for-source-code-modeling-and","title":"Deep Learning for Source Code Modeling and Generation: Models, Applications and Challenges","date":"2020-02-13","arxiv_id":"2002.05442","repositories_listed":1,"syntology":null},{"url":"/paper/time-aware-large-kernel-convolutions","slug":"time-aware-large-kernel-convolutions","title":"Time-aware Large Kernel Convolutions","date":"2020-02-08","arxiv_id":"2002.03184","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":2,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"6 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/time-aware-large-kernel-convolutions#ran","syntology_url":"https://syntology.ai/paper/2002.03184","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03184"}},"official":{"repos":["lioutasb/TaLKConvolutions"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-machine-translation-system-of-indic","slug":"neural-machine-translation-system-of-indic","title":"Neural Machine Translation System of Indic Languages -- An Attention based Approach","date":"2020-02-02","arxiv_id":"2002.02758","repositories_listed":1,"syntology":null},{"url":"/paper/massively-multilingual-document-alignment","slug":"massively-multilingual-document-alignment","title":"Massively Multilingual Document Alignment with Cross-lingual Sentence-Mover's Distance","date":"2020-01-31","arxiv_id":"2002.00761","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-multilingual-alignment-using","slug":"unsupervised-multilingual-alignment-using","title":"Unsupervised Multilingual Alignment using Wasserstein Barycenter","date":"2020-01-28","arxiv_id":"2002.00743","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-domain-adaptation-for-neural-2","slug":"unsupervised-domain-adaptation-for-neural-2","title":"A Simple Baseline to Semi-Supervised Domain Adaptation for Machine Translation","date":"2020-01-22","arxiv_id":"2001.08140","repositories_listed":1,"syntology":null},{"url":"/paper/parallel-machine-translation-with","slug":"parallel-machine-translation-with","title":"Non-Autoregressive Machine Translation with Disentangled Context Transformer","date":"2020-01-15","arxiv_id":"2001.05136","repositories_listed":1,"syntology":null},{"url":"/paper/improving-transformer-optimization-through","slug":"improving-transformer-optimization-through","title":"Improving Transformer Optimization Through Better Initialization","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/improving-transformer-optimization-through-1","slug":"improving-transformer-optimization-through-1","title":"Improving Transformer Optimization Through Better Initialization","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/non-autoregressive-translation-with","slug":"non-autoregressive-translation-with","title":"Non-autoregressive Translation with Disentangled Context Transformer","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/encoding-word-order-in-complex-embeddings-1","slug":"encoding-word-order-in-complex-embeddings-1","title":"Encoding word order in complex embeddings","date":"2019-12-27","arxiv_id":"1912.12333","repositories_listed":1,"syntology":null},{"url":"/paper/explicit-sentence-compression-for-neural","slug":"explicit-sentence-compression-for-neural","title":"Explicit Sentence Compression for Neural Machine Translation","date":"2019-12-27","arxiv_id":"1912.11980","repositories_listed":1,"syntology":null},{"url":"/paper/coursera-corpus-mining-and-multistage-fine","slug":"coursera-corpus-mining-and-multistage-fine","title":"Coursera Corpus Mining and Multistage Fine-Tuning for Improving Lectures Translation","date":"2019-12-26","arxiv_id":"1912.11739","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-document-level-machine","slug":"a-survey-on-document-level-machine","title":"A Survey on Document-level Neural Machine Translation: Methods and Evaluation","date":"2019-12-18","arxiv_id":"1912.08494","repositories_listed":1,"syntology":null},{"url":"/paper/document-sub-structure-in-neural-machine","slug":"document-sub-structure-in-neural-machine","title":"Document Sub-structure in Neural Machine Translation","date":"2019-12-13","arxiv_id":"1912.06598","repositories_listed":1,"syntology":null},{"url":"/paper/machine-translation-with-cross-lingual-word","slug":"machine-translation-with-cross-lingual-word","title":"Machine Translation with Cross-lingual Word Embeddings","date":"2019-12-10","arxiv_id":"1912.10167","repositories_listed":1,"syntology":null},{"url":"/paper/re-translation-strategies-for-long-form","slug":"re-translation-strategies-for-long-form","title":"Re-Translation Strategies For Long Form, Simultaneous, Spoken Language Translation","date":"2019-12-06","arxiv_id":"1912.03393","repositories_listed":1,"syntology":null},{"url":"/paper/a-resource-for-computational-experiments-on","slug":"a-resource-for-computational-experiments-on","title":"A Resource for Computational Experiments on Mapudungun","date":"2019-12-04","arxiv_id":"1912.01772","repositories_listed":1,"syntology":null},{"url":"/paper/memory-efficient-adaptive-optimization","slug":"memory-efficient-adaptive-optimization","title":"Memory Efficient Adaptive Optimization","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/neural-machine-translation-with-soft","slug":"neural-machine-translation-with-soft","title":"Neural Machine Translation with Soft Prototype","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/modeling-fluency-and-faithfulness-for-diverse","slug":"modeling-fluency-and-faithfulness-for-diverse","title":"Modeling Fluency and Faithfulness for Diverse Neural Machine Translation","date":"2019-11-30","arxiv_id":"1912.00178","repositories_listed":1,"syntology":null},{"url":"/paper/define-deep-factorized-input-word-embeddings-1","slug":"define-deep-factorized-input-word-embeddings-1","title":"DeFINE: DEep Factorized INput Token Embeddings for Neural Sequence Modeling","date":"2019-11-27","arxiv_id":"1911.12385","repositories_listed":1,"syntology":null},{"url":"/paper/jejueo-datasets-for-machine-translation-and","slug":"jejueo-datasets-for-machine-translation-and","title":"Jejueo Datasets for Machine Translation and Speech Synthesis","date":"2019-11-27","arxiv_id":"1911.12071","repositories_listed":1,"syntology":null},{"url":"/paper/effective-modeling-of-encoder-decoder","slug":"effective-modeling-of-encoder-decoder","title":"Effective Modeling of Encoder-Decoder Architecture for Joint Entity and Relation Extraction","date":"2019-11-22","arxiv_id":"1911.09886","repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-data-usage-via-differentiable-1","slug":"optimizing-data-usage-via-differentiable-1","title":"Optimizing Data Usage via Differentiable Rewards","date":"2019-11-22","arxiv_id":"1911.10088","repositories_listed":1,"syntology":null},{"url":"/paper/minimizing-the-bag-of-ngrams-difference-for","slug":"minimizing-the-bag-of-ngrams-difference-for","title":"Minimizing the Bag-of-Ngrams Difference for Non-Autoregressive Neural Machine Translation","date":"2019-11-21","arxiv_id":"1911.09320","repositories_listed":1,"syntology":null},{"url":"/paper/controlling-neural-machine-translation","slug":"controlling-neural-machine-translation","title":"Controlling Neural Machine Translation Formality with Synthetic Supervision","date":"2019-11-20","arxiv_id":"1911.08706","repositories_listed":1,"syntology":null},{"url":"/paper/graph-transformer-for-graph-to-sequence","slug":"graph-transformer-for-graph-to-sequence","title":"Graph Transformer for Graph-to-Sequence Learning","date":"2019-11-18","arxiv_id":"1911.07470","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/graph-transformer-for-graph-to-sequence#ran","syntology_url":"https://syntology.ai/paper/1911.07470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.07470"}},"official":{"repos":["jcyk/gtos"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-reinforced-generation-of-adversarial","slug":"a-reinforced-generation-of-adversarial","title":"A Reinforced Generation of Adversarial Examples for Neural Machine Translation","date":"2019-11-09","arxiv_id":"1911.03677","repositories_listed":1,"syntology":null},{"url":"/paper/improving-grammatical-error-correction-with","slug":"improving-grammatical-error-correction-with","title":"Improving Grammatical Error Correction with Machine Translation Pairs","date":"2019-11-07","arxiv_id":"1911.02825","repositories_listed":1,"syntology":null},{"url":"/paper/multi-domain-neural-machine-translation-with-1","slug":"multi-domain-neural-machine-translation-with-1","title":"Multi-Domain Neural Machine Translation with Word-Level Adaptive Layer-wise Domain Mixing","date":"2019-11-07","arxiv_id":"1911.02692","repositories_listed":1,"syntology":null},{"url":"/paper/transition-based-deep-input-linearization-1","slug":"transition-based-deep-input-linearization-1","title":"Transition-Based Deep Input Linearization","date":"2019-11-07","arxiv_id":"1911.02808","repositories_listed":1,"syntology":null},{"url":"/paper/controlling-text-complexity-in-neural-machine-1","slug":"controlling-text-complexity-in-neural-machine-1","title":"Controlling Text Complexity in Neural Machine Translation","date":"2019-11-03","arxiv_id":"1911.00835","repositories_listed":1,"syntology":null},{"url":"/paper/active-learning-with-siamese-twins-for","slug":"active-learning-with-siamese-twins-for","title":"Active$^2$ Learning: Actively reducing redundancies in Active Learning methods for Sequence Tagging and Machine Translation","date":"2019-11-01","arxiv_id":"1911.00234","repositories_listed":1,"syntology":null},{"url":"/paper/deep-copycat-networks-for-text-to-text","slug":"deep-copycat-networks-for-text-to-text","title":"Deep Copycat Networks for Text-to-Text Generation","date":"2019-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/improving-neural-machine-translation-1","slug":"improving-neural-machine-translation-1","title":"Improving Neural Machine Translation Robustness via Data Augmentation: Beyond Back-Translation","date":"2019-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/inmt-interactive-neural-machine-translation","slug":"inmt-interactive-neural-machine-translation","title":"INMT: Interactive Neural Machine Translation Prediction","date":"2019-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sequence-modeling-with-unconstrained","slug":"sequence-modeling-with-unconstrained","title":"Sequence Modeling with Unconstrained Generation Order","date":"2019-11-01","arxiv_id":"1911.00176","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":9,"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, 1 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sequence-modeling-with-unconstrained#ran","syntology_url":"https://syntology.ai/paper/1911.00176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00176"}},"official":{"repos":["TIXFeniks/neurips2019_intrus"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/the-flores-evaluation-datasets-for-low","slug":"the-flores-evaluation-datasets-for-low","title":"The FLORES Evaluation Datasets for Low-Resource Machine Translation: Nepali--English and Sinhala--English","date":"2019-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/university-of-edinburghs-submission-to-the","slug":"university-of-edinburghs-submission-to-the","title":"University of Edinburgh's submission to the Document-level Generation and Translation Shared Task","date":"2019-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"7d49c9f836ac539c9cdaf3c350cc82932bb3989b5aa36e0ef4351b3fee3d8623","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}