Paper Group NANR 161
Modeling French Sign Language: a proposal for a semantically compositional system. Leveraging Multimodal Dialog Technology for the Design of Automated and Interactive Student Agents for Teacher Training. Integrating Multiple NLP Technologies into an Open-source Platform for Multilingual Media Monitoring. Decision Conversations Decoded. Style Detect …
Modeling French Sign Language: a proposal for a semantically compositional system
| Title | Modeling French Sign Language: a proposal for a semantically compositional system |
| Authors | Mohamed Nassime Hadjadj, Michael Filhol, Annelies Braffort |
| Abstract | |
| Tasks | |
| Published | 2018-05-01 |
| URL | https://www.aclweb.org/anthology/L18-1671/ |
| https://www.aclweb.org/anthology/L18-1671 | |
| PWC | https://paperswithcode.com/paper/modeling-french-sign-language-a-proposal-for |
| Repo | |
| Framework | |
Leveraging Multimodal Dialog Technology for the Design of Automated and Interactive Student Agents for Teacher Training
| Title | Leveraging Multimodal Dialog Technology for the Design of Automated and Interactive Student Agents for Teacher Training |
| Authors | David Pautler, Vikram Ramanarayanan, Kirby Cofino, Patrick Lange, David Suendermann-Oeft |
| Abstract | We present a paradigm for interactive teacher training that leverages multimodal dialog technology to puppeteer custom-designed embodied conversational agents (ECAs) in student roles. We used the open-source multimodal dialog system HALEF to implement a small-group classroom math discussion involving Venn diagrams where a human teacher candidate has to interact with two student ECAs whose actions are controlled by the dialog system. Such an automated paradigm has the potential to be extended and scaled to a wide range of interactive simulation scenarios in education, medicine, and business where group interaction training is essential. |
| Tasks | |
| Published | 2018-07-01 |
| URL | https://www.aclweb.org/anthology/W18-5029/ |
| https://www.aclweb.org/anthology/W18-5029 | |
| PWC | https://paperswithcode.com/paper/leveraging-multimodal-dialog-technology-for |
| Repo | |
| Framework | |
Integrating Multiple NLP Technologies into an Open-source Platform for Multilingual Media Monitoring
| Title | Integrating Multiple NLP Technologies into an Open-source Platform for Multilingual Media Monitoring |
| Authors | Ulrich Germann, Ren{=a}rs Liepins, Didzis Gosko, Guntis Barzdins |
| Abstract | The open-source SUMMA Platform is a highly scalable distributed architecture for monitoring a large number of media broadcasts in parallel, with a lag behind actual broadcast time of at most a few minutes. It assembles numerous state-of-the-art NLP technologies into a fully automated media ingestion pipeline that can record live broadcasts, detect and transcribe spoken content, translate from several languages (original text or transcribed speech) into English, recognize Named Entities, detect topics, cluster and summarize documents across language barriers, and extract and store factual claims in these news items. This paper describes the intended use cases and discusses the system design decisions that allowed us to integrate state-of-the-art NLP modules into an effective workflow with comparatively little effort. |
| Tasks | Machine Translation, Speech Recognition |
| Published | 2018-07-01 |
| URL | https://www.aclweb.org/anthology/W18-2508/ |
| https://www.aclweb.org/anthology/W18-2508 | |
| PWC | https://paperswithcode.com/paper/integrating-multiple-nlp-technologies-into-an |
| Repo | |
| Framework | |
Decision Conversations Decoded
| Title | Decision Conversations Decoded |
| Authors | L{'e}a Deleris, Debasis Ganguly, Killian Levacher, Martin Stephenson, Francesca Bonin |
| Abstract | We describe the vision and current version of a Natural Language Processing system aimed at group decision making facilitation. Borrowing from the scientific field of Decision Analysis, its essential role is to identify alternatives and criteria associated with a given decision, to keep track of who proposed them and of the expressed sentiment towards them. Based on this information, the system can help identify agreement and dissent or recommend an alternative. Overall, it seeks to help a group reach a decision in a natural yet auditable fashion. |
| Tasks | Decision Making |
| Published | 2018-06-01 |
| URL | https://www.aclweb.org/anthology/N18-5019/ |
| https://www.aclweb.org/anthology/N18-5019 | |
| PWC | https://paperswithcode.com/paper/decision-conversations-decoded |
| Repo | |
| Framework | |
Style Detection for Free Verse Poetry from Text and Speech
| Title | Style Detection for Free Verse Poetry from Text and Speech |
| Authors | Timo Baumann, Hussein Hussein, Burkhard Meyer-Sickendiek |
| Abstract | Modern and post-modern free verse poems feature a large and complex variety in their poetic prosodies that falls along a continuum from a more fluent to a more disfluent and choppy style. As the poets of modernism overcame rhyme and meter, they oriented themselves in these two opposing directions, creating a free verse spectrum that calls for new analyses of prosodic forms. We present a method, grounded in philological analysis and current research on cognitive (dis)fluency, for automatically analyzing this spectrum. We define and relate six classes of poetic styles (ranging from parlando to lettristic decomposition) by their gradual differentiation. Based on this discussion, we present a model for automatic prosodic classification of spoken free verse poetry that uses deep hierarchical attention networks to integrate the source text and audio and predict the assigned class. We evaluate our model on a large corpus of German author-read post-modern poetry and find that classes can reliably be differentiated, reaching a weighted f-measure of 0.73, when combining textual and phonetic evidence. In our further analyses, we validate the model{'}s decision-making process, the philologically hypothesized continuum of fluency and investigate the relative importance of various features. |
| Tasks | Decision Making |
| Published | 2018-08-01 |
| URL | https://www.aclweb.org/anthology/C18-1164/ |
| https://www.aclweb.org/anthology/C18-1164 | |
| PWC | https://paperswithcode.com/paper/style-detection-for-free-verse-poetry-from |
| Repo | |
| Framework | |
Cross-media User Profiling with Joint Textual and Social User Embedding
| Title | Cross-media User Profiling with Joint Textual and Social User Embedding |
| Authors | Jingjing Wang, Shoushan Li, Mingqi Jiang, Hanqian Wu, Guodong Zhou |
| Abstract | In realistic scenarios, a user profiling model (e.g., gender classification or age regression) learned from one social media might perform rather poorly when tested on another social media due to the different data distributions in the two media. In this paper, we address cross-media user profiling by bridging the knowledge between the source and target media with a uniform user embedding learning approach. In our approach, we first construct a cross-media user-word network to capture the relationship among users through the textual information and a modified cross-media user-user network to capture the relationship among users through the social information. Then, we learn user embedding by jointly learning the heterogeneous network composed of above two networks. Finally, we train a classification (or regression) model with the obtained user embeddings as input to perform user profiling. Empirical studies demonstrate the effectiveness of the proposed approach to two cross-media user profiling tasks, i.e., cross-media gender classification and cross-media age regression. |
| Tasks | |
| Published | 2018-08-01 |
| URL | https://www.aclweb.org/anthology/C18-1119/ |
| https://www.aclweb.org/anthology/C18-1119 | |
| PWC | https://paperswithcode.com/paper/cross-media-user-profiling-with-joint-textual |
| Repo | |
| Framework | |
SLIDE - a Sentiment Lexicon of Common Idioms
| Title | SLIDE - a Sentiment Lexicon of Common Idioms |
| Authors | Charles Jochim, Francesca Bonin, Roy Bar-Haim, Noam Slonim |
| Abstract | |
| Tasks | Sentiment Analysis |
| Published | 2018-05-01 |
| URL | https://www.aclweb.org/anthology/L18-1379/ |
| https://www.aclweb.org/anthology/L18-1379 | |
| PWC | https://paperswithcode.com/paper/slide-a-sentiment-lexicon-of-common-idioms |
| Repo | |
| Framework | |
A Web-based System for Crowd-in-the-Loop Dependency Treebanking
| Title | A Web-based System for Crowd-in-the-Loop Dependency Treebanking |
| Authors | Stephen Tratz, Nhien Phan |
| Abstract | |
| Tasks | |
| Published | 2018-05-01 |
| URL | https://www.aclweb.org/anthology/L18-1346/ |
| https://www.aclweb.org/anthology/L18-1346 | |
| PWC | https://paperswithcode.com/paper/a-web-based-system-for-crowd-in-the-loop |
| Repo | |
| Framework | |
Solving Non-smooth Constrained Programs with Lower Complexity than \mathcal{O}(1/\varepsilon): A Primal-Dual Homotopy Smoothing Approach
| Title | Solving Non-smooth Constrained Programs with Lower Complexity than \mathcal{O}(1/\varepsilon): A Primal-Dual Homotopy Smoothing Approach |
| Authors | Xiaohan Wei, Hao Yu, Qing Ling, Michael Neely |
| Abstract | We propose a new primal-dual homotopy smoothing algorithm for a linearly constrained convex program, where neither the primal nor the dual function has to be smooth or strongly convex. The best known iteration complexity solving such a non-smooth problem is $\mathcal{O}(\varepsilon^{-1})$. In this paper, we show that by leveraging a local error bound condition on the dual function, the proposed algorithm can achieve a better primal convergence time of $\mathcal{O}\l(\varepsilon^{-2/(2+\beta)}\log_2(\varepsilon^{-1})\r)$, where $\beta\in(0,1]$ is a local error bound parameter. As an example application, we show that the distributed geometric median problem, which can be formulated as a constrained convex program, has its dual function non-smooth but satisfying the aforementioned local error bound condition with $\beta=1/2$, therefore enjoying a convergence time of $\mathcal{O}\l(\varepsilon^{-4/5}\log_2(\varepsilon^{-1})\r)$. This result improves upon the $\mathcal{O}(\varepsilon^{-1})$ convergence time bound achieved by existing distributed optimization algorithms. Simulation experiments also demonstrate the performance of our proposed algorithm. |
| Tasks | Distributed Optimization |
| Published | 2018-12-01 |
| URL | http://papers.nips.cc/paper/7655-solving-non-smooth-constrained-programs-with-lower-complexity-than-mathcalo1varepsilon-a-primal-dual-homotopy-smoothing-approach |
| http://papers.nips.cc/paper/7655-solving-non-smooth-constrained-programs-with-lower-complexity-than-mathcalo1varepsilon-a-primal-dual-homotopy-smoothing-approach.pdf | |
| PWC | https://paperswithcode.com/paper/solving-non-smooth-constrained-programs-with |
| Repo | |
| Framework | |
Identifying Explicit Discourse Connectives in German
| Title | Identifying Explicit Discourse Connectives in German |
| Authors | Peter Bourgonje, Manfred Stede |
| Abstract | We are working on an end-to-end Shallow Discourse Parsing system for German and in this paper focus on the first subtask: the identification of explicit connectives. Starting with the feature set from an English system and a Random Forest classifier, we evaluate our approach on a (relatively small) German annotated corpus, the Potsdam Commentary Corpus. We introduce new features and experiment with including additional training data obtained through annotation projection and achieve an f-score of 83.89. |
| Tasks | |
| Published | 2018-07-01 |
| URL | https://www.aclweb.org/anthology/W18-5037/ |
| https://www.aclweb.org/anthology/W18-5037 | |
| PWC | https://paperswithcode.com/paper/identifying-explicit-discourse-connectives-in |
| Repo | |
| Framework | |
Toward zero-shot Entity Recognition in Task-oriented Conversational Agents
| Title | Toward zero-shot Entity Recognition in Task-oriented Conversational Agents |
| Authors | Marco Guerini, Simone Magnolini, Vevake Balaraman, Bernardo Magnini |
| Abstract | We present a domain portable zero-shot learning approach for entity recognition in task-oriented conversational agents, which does not assume any annotated sentences at training time. Rather, we derive a neural model of the entity names based only on available gazetteers, and then apply the model to recognize new entities in the context of user utterances. In order to evaluate our working hypothesis we focus on nominal entities that are largely used in e-commerce to name products. Through a set of experiments in two languages (English and Italian) and three different domains (furniture, food, clothing), we show that the neural gazetteer-based approach outperforms several competitive baselines, with minimal requirements of linguistic features. |
| Tasks | Zero-Shot Learning |
| Published | 2018-07-01 |
| URL | https://www.aclweb.org/anthology/W18-5036/ |
| https://www.aclweb.org/anthology/W18-5036 | |
| PWC | https://paperswithcode.com/paper/toward-zero-shot-entity-recognition-in-task |
| Repo | |
| Framework | |
A Document Descriptor using Covariance of Word Vectors
| Title | A Document Descriptor using Covariance of Word Vectors |
| Authors | Marwan Torki |
| Abstract | In this paper, we address the problem of finding a novel document descriptor based on the covariance matrix of the word vectors of a document. Our descriptor has a fixed length, which makes it easy to use in many supervised and unsupervised applications. We tested our novel descriptor in different tasks including supervised and unsupervised settings. Our evaluation shows that our document covariance descriptor fits different tasks with competitive performance against state-of-the-art methods. |
| Tasks | |
| Published | 2018-07-01 |
| URL | https://www.aclweb.org/anthology/P18-2084/ |
| https://www.aclweb.org/anthology/P18-2084 | |
| PWC | https://paperswithcode.com/paper/a-document-descriptor-using-covariance-of |
| Repo | |
| Framework | |
Testsuite on Czech–English Grammatical Contrasts
| Title | Testsuite on Czech–English Grammatical Contrasts |
| Authors | Silvie Cinkov{'a}, Ond{\v{r}}ej Bojar |
| Abstract | We present a pilot study of machine translation of selected grammatical contrasts between Czech and English in WMT18 News Translation Task. For each phenomenon, we run a dedicated test which checks if the candidate translation expresses the phenomenon as expected or not. The proposed type of analysis is not an evaluation in the strict sense because the phenomenon can be correctly translated in various ways and we anticipate only one. What is nevertheless interesting are the differences between various MT systems and the single reference translation in their general tendency in handling the given phenomenon. |
| Tasks | Machine Translation |
| Published | 2018-10-01 |
| URL | https://www.aclweb.org/anthology/W18-6434/ |
| https://www.aclweb.org/anthology/W18-6434 | |
| PWC | https://paperswithcode.com/paper/testsuite-on-czechaenglish-grammatical |
| Repo | |
| Framework | |
A K-Competitive Autoencoder for Aggression Detection in Social Media Text
| Title | A K-Competitive Autoencoder for Aggression Detection in Social Media Text |
| Authors | Promita Maitra, Ritesh Sarkhel |
| Abstract | We present an approach to detect aggression from social media text in this work. A winner-takes-all autoencoder, called Emoti-KATE is proposed for this purpose. Using a log-normalized, weighted word-count vector at input dimensions, the autoencoder simulates a competition between neurons in the hidden layer to minimize the reconstruction loss between the input and final output layers. We have evaluated the performance of our system on the datasets provided by the organizers of TRAC workshop, 2018. Using the encoding generated by Emoti-KATE, a 3-way classification is performed for every social media text in the dataset. Each data point is classified as {}Overtly Aggressive{'}, {}Covertly Aggressive{'} or {`}Non-aggressive{'}. Results show that our (team name: PMRS) proposed method is able to achieve promising results on some of these datasets. In this paper, we have described the effects of introducing an winner-takes-all autoencoder for the task of aggression detection, reported its performance on four different datasets, analyzed some of its limitations and how to improve its performance in future works. | |
| Tasks | |
| Published | 2018-08-01 |
| URL | https://www.aclweb.org/anthology/W18-4410/ |
| https://www.aclweb.org/anthology/W18-4410 | |
| PWC | https://paperswithcode.com/paper/a-k-competitive-autoencoder-for-aggression |
| Repo | |
| Framework | |
Content Aware Source Code Change Description Generation
| Title | Content Aware Source Code Change Description Generation |
| Authors | Pablo Loyola, Edison Marrese-Taylor, Jorge Balazs, Yutaka Matsuo, Fumiko Satoh |
| Abstract | We propose to study the generation of descriptions from source code changes by integrating the messages included on code commits and the intra-code documentation inside the source in the form of docstrings. Our hypothesis is that although both types of descriptions are not directly aligned in semantic terms {—}one explaining a change and the other the actual functionality of the code being modified{—} there could be certain common ground that is useful for the generation. To this end, we propose an architecture that uses the source code-docstring relationship to guide the description generation. We discuss the results of the approach comparing against a baseline based on a sequence-to-sequence model, using standard automatic natural language generation metrics as well as with a human study, thus offering a comprehensive view of the feasibility of the approach. |
| Tasks | Machine Translation, Text Generation |
| Published | 2018-11-01 |
| URL | https://www.aclweb.org/anthology/W18-6513/ |
| https://www.aclweb.org/anthology/W18-6513 | |
| PWC | https://paperswithcode.com/paper/content-aware-source-code-change-description |
| Repo | |
| Framework | |
