Taiwan

Speakers repeat constructions frequently in dialogue. Due to their peculiar information-theoretic properties, repetitions can be thought of as a strategy for cost-effective communication. In this study, we focus on the repetition of lexicalised constructions -- i.e., recurring multi-word units -- in English open-domain spoken dialogues. We hypothesise that speakers use construction repetition to mitigate information rate, leading to an overall decrease in utterance information content over the course of a dialogue. We conduct a quantitative analysis, measuring the information content of constructions and that of their containing utterances, estimating information content with an adaptive neural language model. We observe that construction usage lowers the information content of utterances. This facilitating effect (i) increases throughout dialogues, (ii) is boosted by repetition, (iii) grows as a function of repetition frequency and density, and (iv) is stronger for repetitions of referential constructions.

To view the proceedings, please [click here](https://aclanthology.org/2022.aacl-main.51/)

IJCNLP-AACL 2022

Construction Repetition Reduces Information Rate in Dialogue

information content

repetitions

constructions

surprisal

dialogue

stages 

COLING, the International Conference on Computational Linguistics, is one of the premier conferences for natural language processing and computational linguistics. Often grouped within the field of artificial intelligence, but actually pre-dating the development of artificial intelligence, advances in computational linguistics and natural language processing are now some of the major drivers behind the use of artificial intelligence for commercial and social applications – for example, on-line search, machine translation and with voice-assisted conversational devices.

First established in 1965, the biennial COLING conference is held in diverse parts of the globe and attracts participants from both top-ranked research centers and emerging countries. Today, the most important developments in our field are taking place not only in universities and academic research institutes, but also in industrial research departments and in technological startups. COLING conferences provide opportunities for all these communities to showcase their exciting developments.

COLING 2020

COLING, the International Conference on Computational Linguistics, is one of the premier conferences for natural language processing and computational linguistics. Often grouped within the field of artificial intelligence, but actually pre-dating the development of artificial intelligence, advances in computational linguistics and natural language processing are now some of the major drivers behind the use of artificial intelligence for commercial and social applications – for example, on-line search, machine translation and with voice-assisted conversational devices.

poster

The AACL, Asia-Pacific Chapter of the Association for Computational Linguistics, and the AFNLP, Asian Federation of Natural Language Processing, invite you to participate in the 1st Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics (AACL) and the 10th International Joint Conference on Natural Language Processing (IJCNLP). 
<br>
<br>

A registration is required to access this event. Access to the event site will be granted to all registered attendees on **November 16th**. If you have not already done so, please register using the link below:
<br>
<br>https://conference.iis.sinica.edu.tw/servlet/Register?ConferenceID=411

Registration Is Required

The AACL, Asia-Pacific Chapter of the Association for Computational Linguistics, and the AFNLP, Asian Federation of Natural Language Processing, invite you to participate in the 1st Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics (AACL) and the 10th International Joint Conference on Natural Language Processing (IJCNLP). 

Recent language generative models are mostly trained on large-scale datasets, while in some real scenarios, the training datasets are often expensive to obtain and would be small-scale. In this paper we investigate the challenging task of less-data constrained generation, especially when the generated news headlines are short yet expected by readers to keep readable and informative simultaneously. We highlight the key information modeling task and propose a novel duality fine-tuning method by formally defining the probabilistic duality constraints between key information prediction and headline generation tasks. The proposed method can capture more information from limited data, build connections between separate tasks, and is suitable for less-data constrained generation tasks. Furthermore, the method can leverage various pre-trained generative regimes, e.g., autoregressive and encoder-decoder models. We conduct extensive experiments to demonstrate that our method is effective and efficient to achieve improved performance in terms of language modeling metric and informativeness correctness metric on two public datasets.

To view the proceedings, please [click here](https://aclanthology.org/2022.aacl-main.5/)

Leveraging Key Information Modeling to Improve Less-Data Constrained News Headline Generation via Duality Fine-Tuning

This paper focuses on the generation of natural language questions based on SPARQL queries, with an emphasis on conversational use cases (follow-up question-answering). It studies what can be achieved so far based on current deep learning models (namely pretrained T5 and BART models). To do so, 4 knowledge-based QA corpora have been homogenized for the task and a new challenge set is introduced. A first series of experiments analyzes the impact of different training setups, while a second series seeks to understand what is still difficult for these models. The results from automatic metrics and human evaluation show that simple questions and frequent templates of SPARQL queries are usually well processed whereas complex questions and conversational dimensions (coreferences and ellipses) are still difficult to handle. The experimental material is publicly available on https://github.com/Orange-OpenSource/sparql-to-text .

To view the proceedings, please [click here](https://aclanthology.org/2022.aacl-main.11/)

SPARQL-to-Text Question Generation for Knowledge-Based Conversational Applications

Knowledge graph embedding (KGE) has been well-studied in general domains, but has not been examined for food computing. To fill this gap, we perform knowledge representation learning over a food knowledge graph (KG). We employ a pre-trained language model to encode entities and relations, thus emphasizing- ing contextual information in food KGs. The model is trained on two tasks – predicting a masked entity from a given triple from the KG and predicting the plausibility of a triple. Analysis of food substitutions helps in dietary choices for enabling healthier eating behaviors. Previous work in food substitutions mainly focuses on semantic similarity while ignoring the context. It is also hard to evaluate the substitutions due to the lack of an adequate validation set, and further, the evaluation is sub- jective based on perceived purpose. To tackle this problem, we propose a collection of adversarial sample generation strategies for different food substitutions over our learnt KGE. We pro- pose multiple strategies to generate high-quality context-aware recipe and ingredient substitutions and also provide generalized ingredient substitutions to meet different user needs. The effectiveness and efficiency of the proposed knowledge graph learning method and the following attack strategies are verified by extensive evaluations on a large-scale food KG.

To view the proceedings, please [click here](https://aclanthology.org/2022.aacl-main.50/)

Food Knowledge Representation Learning with Adversarial Substitution

In recent years, knowledge graphs (KGs) have attracted a surge of interest from both academia and industry. As a representation of semantic relations between entities, KGs have proven to be particularly relevant for natural language processing (NLP). Despite the increasing amount of research work in this area, a comprehensive study that categorizes established topics and reviews emerging research streams remains absent to this day. To provide an overview of the research landscape of KGs in NLP, we analyzed 507 papers in a multifaceted survey of tasks, research types, and contributions.

To view the proceedings, please [click here](https://aclanthology.org/2022.aacl-main.46/)

A Decade of Knowledge Graphs in Natural Language Processing: A Survey

Keywords or keyphrases are often used to highlight a document's domains or main topics. Unsupervised keyphrase extraction (UKE) has always been highly anticipated because no labeled data is needed to train a model. This paper proposes an augmented graph-based unsupervised model to identify keyphrases from a document by integrating graph and deep learning methods. The proposed model utilizes mutual attention extracted from the pre-trained BERT model to build the candidate graph and augments the graph with global and local context nodes to improve the performance. The proposed model is evaluated on four publicly available datasets against thirteen UKE baselines. The results show that the proposed model is an effective and robust UKE model for long and short documents. Our source code is available on GitHub.

To view the proceedings, please [click here](https://aclanthology.org/2022.aacl-main.19/)

AGRank: Augmented Graph-based Unsupervised Keyphrase Extraction

Reasoning with preconditions such as “glass can be used for drinking water unless the glass is shattered” remains an open problem for language models. The main challenge lies in the scarcity of preconditions data and the model’s lack of support for such reasoning. We present PInKS, Preconditioned Commonsense Inference with WeaK Supervision, an improved model for reasoning with preconditions through minimum supervision. We show, both empirically and theoretically, that PInKS improves the results on benchmarks focused on reasoning with the preconditions of commonsense knowledge (up to 40% Macro-F1 scores). We further investigate PInKS through PAC-Bayesian informativeness analysis, precision measures, and ablation study.

To view the proceedings, please [click here](https://aclanthology.org/2022.aacl-main.26/)

PInKS: Preconditioned Commonsense Inference with Minimal Supervision

In this research, we propose CNN based CoCNN+ model can beat transformer models in Bengali and Hindi language modeling - two of the most popular languages in the world. These languages have high inflection, flexible word order, and a lot of compound characters making them morphologically rich. Base CoCNN model has two components – 1D CNN based vocabulary learner works at word level, while terminal coordinator works at document level. We analyze CNN, LSTM and Transformer based models for Bengali language modeling using perplexity score. CNNs do a better job than LSTMs because of the flexible word order in Bengali. CoCNN has on par performance with pretrained BERT. We extend the base CoCNN to CoCNN+ by incorporating residual connection in the shallow layers of vocabulary learner and by introducing parallel branches of different convolution widths in the terminal coordinator. These modifications help CoCNN beat pretrained BERT for Bengali and Hindi next word prediction, text classification and sentiment analysis tasks.

To view the proceedings, please [click here](https://aclanthology.org/2022.aacl-main.4/)

CNN for Modeling Sanskrit Originated Bengali and Hindi Language

Word embeddings and pre-trained language models have become essential technical elements in natural language processing. While the general practice is to use or fine-tune publicly available models, there are significant advantages in creating or pre-training unique models that match the domain. The performance of the models degrades as language changes or evolves continuously (semantic shift), but the high cost of model building inhibits regular re-training, especially for the language models. This study designs a methodology for observing time-series performance degradation of word embeddings and pre-trained language models using semantic shift in a corpus. We define an efficiently computable metric named Semantic Shift Stability based on the degree of semantic shift. In the experiments, we create models that vary by time series and reveal the performance degradation in two datasets, Japanese and English. Several case studies demonstrate that Semantic Shift Stability supports decision-making as to whether a model should be re-trained. The source code is available at https://github.com/Nikkei/semantic-shift-stability.

To view the proceedings, please [click here](https://aclanthology.org/2022.aacl-main.17/)

Semantic Shift Stability: Efficient Way to Detect Performance Degradation of Word Embeddings and Pre-trained Language Models

As we begin to see low-powered computing paradigms (Neuromorphic Computing, Spiking Neural Networks, etc.) becoming more popular, learning binary word embeddings has become increasingly important for supporting NLP applications at the edge. Existing binary word embeddings are mostly derived from pretrained real-valued embeddings through different simple transformations, which often break the semantic consistency and the so-called "arithmetic'' properties learned by the original, real-valued embeddings. This paper aims to address this limitation by introducing a new approach to learn binary embeddings from scratch, preserving the semantic relationships between words as well as the arithmetic properties of the embeddings themselves. To achieve this, we propose a novel genetic algorithm to learn the relationships between words from existing word analogy data-sets, carefully making sure that the arithmetic properties of the relationships are preserved. Evaluating our generated 16, 32, and 64-bit binary word embeddings on Mikolov's word analogy task shows that more than 95% of the time, the best fit for the analogy is ranked in the top 5 most similar words in terms of cosine similarity.

To view the proceedings, please [click here](https://aclanthology.org/2022.aacl-main.52/)

Analogy-Guided Evolutionary Pretraining of Binary Word Embeddings

In this work, we introduced a novel inference problem that calls for research towards unifying the Representations of Knowledge Graphs and Expert Rules for Machine Learning and Reasoning. Our work is motivated by the following overarching question: With a knowledge graph and a set of if-then rules, can we reason about the conclusions given a set of observations w/ or w/o any labeled data? Based on our work, the short answer to this question is, yes, we can. And we show that the proposed framework has great potential in performing complex inference tasks through empirical study.

Note that our work should be viewed as a proof of concept of the general idea. Please check out the paper for more details. Thank you!

To view the proceedings, please [click here](https://aclanthology.org/2022.aacl-main.20/)

Downloads

Next from IJCNLP-AACL 2022

Leveraging Key Information Modeling to Improve Less-Data Constrained News Headline Generation via Duality Fine-Tuning

Similar lecture

Translation vs. Dialogue: A Comparative Analysis of Sequence-to-Sequence Modeling

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES