English
Related papers

Related papers: On the relation between size-based termination and…

200 papers

Finding concepts in large clinical ontologies can be challenging when queries use different vocabularies. A search algorithm that overcomes this problem is useful in applications such as concept normalisation and ontology matching, where…

Computation and Language · Computer Science 2022-01-04 Duy-Hoa Ngo , Madonna Kemp , Donna Truran , Bevan Koopman , Alejandro Metke-Jimenez

We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent…

Logic in Computer Science · Computer Science 2014-01-08 Alejandro Díaz-Caro , Giulio Manzonetto , Michele Pagani

Labeling of sentence boundaries is a necessary prerequisite for many natural language processing tasks, including part-of-speech tagging and sentence alignment. End-of-sentence punctuation marks are ambiguous; to disambiguate them most…

cmp-lg · Computer Science 2008-02-03 David D. Palmer , Marti A. Hearst

BERT is inefficient for sentence-pair tasks such as clustering or semantic search as it needs to evaluate combinatorially many sentence pairs which is very time-consuming. Sentence BERT (SBERT) attempted to solve this challenge by learning…

Computation and Language · Computer Science 2021-02-08 Yan Zhang , Ruidan He , Zuozhu Liu , Kwan Hui Lim , Lidong Bing

Slot filling and intent detection are two fundamental tasks in the field of natural language understanding. Due to the strong correlation between these two tasks, previous studies make efforts on modeling them with multi-task learning or…

Computation and Language · Computer Science 2022-09-12 Baohang Zhou , Ying Zhang , Xuhui Sui , Kehui Song , Xiaojie Yuan

For multi-turn dialogue rewriting, the capacity of effectively modeling the linguistic knowledge in dialog context and getting rid of the noises is essential to improve its performance. Existing attentive models attend to all words without…

Computation and Language · Computer Science 2020-10-06 Kun Xu , Haochen Tan , Linfeng Song , Han Wu , Haisong Zhang , Linqi Song , Dong Yu

Semantic Parsing aims to capture the meaning of a sentence and convert it into a logical, structured form. Previous studies show that semantic parsing enhances the performance of smaller models (e.g., BERT) on downstream tasks. However, it…

Computation and Language · Computer Science 2025-05-28 Kaikai An , Shuzheng Si , Helan Hu , Haozhe Zhao , Yuchi Wang , Qingyan Guo , Baobao Chang

Multi-relational semantic similarity datasets define the semantic relations between two short texts in multiple ways, e.g., similarity, relatedness, and so on. Yet, all the systems to date designed to capture such relations target one…

Computation and Language · Computer Science 2020-09-17 Li Zhang , Steven R. Wilson , Rada Mihalcea

Recent advances in methods focused on the grounding problem have resulted in techniques that can be used to construct a symbolic language associated with a specific domain. Inspired by how humans communicate complex ideas through language,…

Artificial Intelligence · Computer Science 2020-08-06 Alberto Santamaria-Pang , James Kubricht , Aritra Chowdhury , Chitresh Bhushan , Peter Tu

Concurrent systems are notoriously difficult to analyze, and technological advances such as weak memory architectures greatly compound this problem. This has renewed interest in partial order semantics as a theoretical foundation for formal…

Logic in Computer Science · Computer Science 2015-04-02 Alex Horn , Daniel Kroening

Exploiting rich linguistic information in raw text is crucial for expressive text-to-speech (TTS). As large scale pre-trained text representation develops, bidirectional encoder representations from Transformers (BERT) has been proven to…

Computation and Language · Computer Science 2022-11-14 Yixuan Zhou , Changhe Song , Jingbei Li , Zhiyong Wu , Yanyao Bian , Dan Su , Helen Meng

This paper presents the results of a study on the semantic constraints imposed on lexical choice by certain contextual indicators. We show how such indicators are computed and how correlations between them and the choice of a noun phrase…

cmp-lg · Computer Science 2007-05-23 Dragomir R. Radev

There are two kinds of approaches for termination analysis of logic programs: "transformational" and "direct" ones. Direct approaches prove termination directly on the basis of the logic program. Transformational approaches transform a…

Logic in Computer Science · Computer Science 2008-09-01 P. Schneider-Kamp , J. Giesl , A. Serebrenik , R. Thiemann

We extend the higher-order termination method of dynamic dependency pairs to Algebraic Functional Systems (AFSs). In this setting, simply typed lambda-terms with algebraic reduction and separate {\beta}-steps are considered. For left-linear…

Logic in Computer Science · Computer Science 2015-07-01 Cynthia Kop , Femke van Raamsdonk

This work investigates spoken language understanding (SLU) systems in the scenario when the semantic information is extracted directly from the speech signal by means of a single end-to-end neural network model. Two SLU tasks are…

Computation and Language · Computer Science 2019-10-29 Natalia Tomashenko , Antoine Caubriere , Yannick Esteve , Antoine Laurent , Emmanuel Morin

We reduce the task of (span-based) PropBank-style semantic role labeling (SRL) to syntactic dependency parsing. Our approach is motivated by our empirical analysis that shows three common syntactic patterns account for over 98% of the SRL…

Computation and Language · Computer Science 2020-10-22 Tianze Shi , Igor Malioutov , Ozan İrsoy

The latest developments in neural semantic role labeling (SRL) have shown great performance improvements with both the dependency and span formalisms/styles. Although the two styles share many similarities in linguistic meaning and…

Computation and Language · Computer Science 2021-02-11 Zuchao Li , Hai Zhao , Junru Zhou , Kevin Parnow , Shexia He

Sign language translation (SLT) is typically trained with text in a single spoken language, which limits scalability and cross-language generalization. Earlier approaches have replaced gloss supervision with text-based sentence embeddings,…

Computation and Language · Computer Science 2025-10-23 Yasser Hamidullah , Shakib Yazdani , Cennet Oguz , Josef van Genabith , Cristina España-Bonet

In recent years, Large Language Models (LLMs) have shown remarkable performance in generating human-like text, proving to be a valuable asset across various applications. However, adapting these models to incorporate new, out-of-domain…

On the one hand, checking specific termination proofs by hand, say using a particular collection of matrix interpretations, can be an arduous and error-prone task. On the other hand, automation of such checks would save time and help to…

Logic in Computer Science · Computer Science 2018-06-14 Jonas Schöpf , Christian Sternagel