The monograph summarizes and analyzes the current state of development of computer and mathematical simulation and modeling, the automation of management processes, the use of information technologies in education, the design of information systems and software complexes, the development of computer telecommunication networks and technologies most areas that are united by the term Industry 4.0
translated by 谷歌翻译
Code generation from text requires understanding the user's intent from a natural language description (NLD) and generating an executable program code snippet that satisfies this intent. While recent pretrained language models (PLMs) demonstrate remarkable performance for this task, these models fail when the given NLD is ambiguous due to the lack of enough specifications for generating a high-quality code snippet. In this work, we introduce a novel and more realistic setup for this task. We hypothesize that ambiguities in the specifications of an NLD are resolved by asking clarification questions (CQs). Therefore, we collect and introduce a new dataset named CodeClarQA containing NLD-Code pairs with created CQAs. We evaluate the performance of PLMs for code generation on our dataset. The empirical results support our hypothesis that clarifications result in more precise generated code, as shown by an improvement of 17.52 in BLEU, 12.72 in CodeBLEU, and 7.7\% in the exact match. Alongside this, our task and dataset introduce new challenges to the community, including when and what CQs should be asked.
translated by 谷歌翻译
The publication rates are skyrocketing across many fields of science, and it is difficult to stay up to date with the latest research. This makes automatically summarizing the latest findings and helping scholars to synthesize related work in a given area an attractive research objective. In this paper we study the problem of citation text generation, where given a set of cited papers and citing context the model should generate a citation text. While citation text generation has been tackled in prior work, existing studies use different datasets and task definitions, which makes it hard to study citation text generation systematically. To address this, we propose CiteBench: a benchmark for citation text generation that unifies the previous datasets and enables standardized evaluation of citation text generation models across task settings and domains. Using the new benchmark, we investigate the performance of multiple strong baselines, test their transferability between the datasets, and deliver new insights into task definition and evaluation to guide the future research in citation text generation. We make CiteBench publicly available at https://github.com/UKPLab/citebench.
translated by 谷歌翻译
Persistence diagrams are common descriptors of the topological structure of data appearing in various classification and regression tasks. They can be generalized to Radon measures supported on the birth-death plane and endowed with an optimal transport distance. Examples of such measures are expectations of probability distributions on the space of persistence diagrams. In this paper, we develop methods for approximating continuous functions on the space of Radon measures supported on the birth-death plane, as well as their utilization in supervised learning tasks. Indeed, we show that any continuous function defined on a compact subset of the space of such measures (e.g., a classifier or regressor) can be approximated arbitrarily well by polynomial combinations of features computed using a continuous compactly supported function on the birth-death plane (a template). We provide insights into the structure of relatively compact subsets of the space of Radon measures, and test our approximation methodology on various data sets and supervised learning tasks.
translated by 谷歌翻译
Natural language processing researchers develop models of grammar, meaning and human communication based on written text. Due to task and data differences, what is considered text can vary substantially across studies. A conceptual framework for systematically capturing these differences is lacking. We argue that clarity on the notion of text is crucial for reproducible and generalizable NLP. Towards that goal, we propose common terminology to discuss the production and transformation of textual data, and introduce a two-tier taxonomy of linguistic and non-linguistic elements that are available in textual sources and can be used in NLP modeling. We apply this taxonomy to survey existing work that extends the notion of text beyond the conservative language-centered view. We outline key desiderata and challenges of the emerging inclusive approach to text in NLP, and suggest systematic community-level reporting as a crucial next step to consolidate the discussion.
translated by 谷歌翻译
激活功能可以对降低输入数据的拓扑复杂性产生重大影响，从而提高模型的性能。选择合适的激活函数是神经模型设计中的重要步骤。但是，在基于变压器的语言模型中很少讨论或探索激活功能的选择。事先选择它们的激活功能，然后从预训练中固定到微调。结果，在这个漫长的生命周期中，无法调整它们对模型的电感偏见。此外，随后开发的模型（例如Roberta，Bart和GPT-3）经常跟进先前的工作（例如BERT），以使用相同的激活函数而无需合理。在本文中，我们研究了变压器体系结构中使用理性激活函数（RAF）（RAF）的有效性。与常规，预定义的激活功能相反，RAF可以根据输入数据自适应地学习最佳激活功能。我们的实验表明，基于RAF的变压器（RAFT）比具有GELU函数的香草BERT的验证性更低。我们进一步评估了低和全数据设置中下游任务的筏。我们的结果表明，筏在大多数任务和设置上都优于对应模型。例如，在低数据表情况下（有100个训练示例），木筏在胶水基准上的表现平均高出5.71点，在全数据设置的小队中，平均得分为2.05分。对学到的RAF的形状的分析进一步揭示了它们在预训练模型的不同层之间有很大的变化，并且看起来与常规激活函数大多不同。 RAFT为根据学习的激活功能打开了一个新的研究方向，用于分析和解释预训练的模型。
translated by 谷歌翻译
问答（QA）系统越来越多地部署在支持现实世界决策的应用程序中。但是，最新的模型依赖于深层神经网络，这些网络很难被人类解释。固有的可解释模型或事后解释性方法可以帮助用户理解模型如何达到其预测，并在成功的情况下增加对系统的信任。此外，研究人员可以利用这些见解来开发更准确和偏见的新方法。在本文中，我们介绍了Square V2（Square的新版本），以根据图形和基于图形的说明等方法进行比较模型提供解释性基础架构。尽管显着图对于检查每个输入令牌对模型预测的重要性很有用，但来自外部知识图的基于图的解释使用户能够验证模型预测背后的推理。此外，我们提供了多种对抗性攻击，以比较质量检查模型的鲁棒性。通过这些解释性方法和对抗性攻击，我们旨在简化对可信赖的质量检查模型的研究。 Square可在https://square.ukp-lab.de上找到。
translated by 谷歌翻译
收集和注释面向任务的对话框数据很困难，尤其是对于需要专家知识的高度特定领域。同时，非正式的沟通渠道（例如即时使者）在工作中越来越多地使用。这导致了许多与工作相关的信息，这些信息通过这些渠道传播，需要由员工进行后处理。为了减轻这个问题，我们提出了TexPrax，这是一种消息传递系统，以收集和注释与工作有关的聊天中发生的问题，原因和解决方案。 TexPrax使用聊天机器人直接吸引员工，以提供对话的轻量级注释并简化文档工作。为了遵守数据隐私和安全法规，我们使用端到端消息加密，并使用户完全控制其数据，该数据比常规注释工具具有各种优势。我们与德国工厂员工一起在用户研究中评估TexPrax，他们要求同事提供有关日常工作中出现的问题的解决方案。总体而言，我们收集201个面向任务的德语对话，其中包含1,027个句子，并带有句子级专家注释。我们的数据分析还表明，现实世界对话经常包含具有代码转换，对同一实体的缩写的实例，以及NLP系统应该能够处理的方言。
translated by 谷歌翻译
自论证挖掘领域成立以来，在法律话语中识别，分类和分析的论点一直是研究的重要领域。但是，自然语言处理（NLP）研究人员的模型模型与法院决策中的注释论点与法律专家理解和分析法律论证的方式之间存在重大差异。尽管计算方法通常将论点简化为通用的前提和主张，但法律研究中的论点通常表现出丰富的类型，对于获得一般法律的特定案例和应用很重要。我们解决了这个问题，并做出了一些实质性的贡献，以推动该领域的前进。首先，我们在欧洲人权法院（ECHR）诉讼中为法律论点设计了新的注释计划，该计划深深植根于法律论证研究的理论和实践中。其次，我们编译和注释了373项法院判决（230万令牌和15K注释的论点跨度）的大量语料库。最后，我们训练一个论证挖掘模型，该模型胜过法律NLP领域中最先进的模型，并提供了彻底的基于专家的评估。所有数据集和源代码均可在https://github.com/trusthlt/mining-legal-arguments的开放lincenses下获得。
translated by 谷歌翻译
注释数据是用于培训和评估机器学习模型的自然语言处理中的重要成分。因此，注释具有高质量是非常理想的。但是，最近的工作表明，几个流行的数据集包含令人惊讶的注释错误或不一致之处。为了减轻此问题，多年来已经设计了许多注释错误检测方法。尽管研究人员表明他们的方法在新介绍的数据集上效果很好，但他们很少将其方法与以前的工作或同一数据集进行比较。这引起了人们对方法的一般表现的强烈关注，并且使他们的优势和劣势很难解决。因此，我们重新实现18种检测潜在注释错误的方法，并在9个英语数据集上对其进行评估，以进行文本分类以及令牌和跨度标签。此外，我们定义了统一的评估设置，包括注释错误检测任务，评估协议和一般最佳实践的新形式化。为了促进未来的研究和可重复性，我们将数据集和实施释放到易于使用和开源软件包中。
translated by 谷歌翻译