English
Related papers

Related papers: Tagging French -- comparing a statistical and a co…

200 papers

While the use of cluster features became ubiquitous in core NLP tasks, most cluster features in NLP are based on distributional similarity. We propose a new type of clustering criteria, specific to the task of part-of-speech tagging.…

Computation and Language · Computer Science 2012-05-22 Yoav Goldberg

We present a method of constructing and using a cascade consisting of a left- and a right-sequential finite-state transducer (FST), T1 and T2, for part-of-speech (POS) disambiguation. Compared to an HMM, this FST cascade has the advantage…

Computation and Language · Computer Science 2007-05-23 Andre Kempe

In this paper we analyze features to classify human- and AI-generated text for English, French, German and Spanish and compare them across languages. We investigate two scenarios: (1) The detection of text generated by AI from scratch, and…

Computation and Language · Computer Science 2024-01-31 Kristina Schaaff , Tim Schlippe , Lorenz Mindner

The paper describes a parser of sequences of (English) part-of-speech labels which utilises a probabilistic grammar trained using the inside-outside algorithm. The initial (meta)grammar is defined by a linguist and further rules compatible…

cmp-lg · Computer Science 2008-02-03 Briscoe , Ted , Waegner , Nick

In this paper, we present a data set and methods to compare speech processing models and human behaviour on a phone discrimination task. We provide Perceptimatic, an open data set which consists of French and English speech stimuli, as well…

Computation and Language · Computer Science 2020-10-14 Juliette Millet , Ewan Dunbar

Recent approaches have explored language-guided classifiers capable of classifying examples from novel tasks when provided with task-specific natural language explanations, instructions or prompts (Sanh et al., 2022; R. Menon et al., 2022).…

Computation and Language · Computer Science 2023-11-14 Kangda Wei , Sayan Ghosh , Rakesh R. Menon , Shashank Srivastava

In this paper we present a new method to learn a model robust to typos for a Named Entity Recognition task. Our improvement over existing methods helps the model to take into account the context of the sentence inside a court decision in…

Computation and Language · Computer Science 2019-09-10 Valentin Barriere , Amaury Fouret

Large language models have shown unprecedented abilities in generating linguistically coherent and syntactically correct natural language output. However, they often return incorrect and inconsistent answers to input questions. Due to the…

Databases · Computer Science 2023-12-27 Jasmin Mousavi , Arash Termehchy

When tasked with supporting multiple languages for a given problem, two approaches have arisen: training a model for each language with the annotation budget divided equally among them, and training on a high-resource language followed by…

Computation and Language · Computer Science 2022-04-05 Joel Ruben Antony Moniz , Barun Patra , Matthew R. Gormley

Probabilistic programming languages rely fundamentally on some notion of sampling, and this is doubly true for probabilistic programming languages which perform Bayesian inference using Monte Carlo techniques. Verifying samplers - proving…

Programming Languages · Computer Science 2023-04-27 Fredrik Dahlqvist , Alexandra Silva , William Smith

Rhetoric, both spoken and written, involves not only content but also style. One common stylistic tool is $\textit{parallelism}$: the juxtaposition of phrases which have the same sequence of linguistic ($\textit{e.g.}$, phonological,…

Computation and Language · Computer Science 2023-12-04 Stephen Bothwell , Justin DeBenedetto , Theresa Crnkovich , Hildegund Müller , David Chiang

We investigate the efficiency of two very different spoken term detection approaches for transcription when the available data is insufficient to train a robust ASR system. This work is grounded in very low-resource language documentation…

Computation and Language · Computer Science 2021-06-14 Éric Le Ferrand , Steven Bird , Laurent Besacier

We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock.…

Programming Languages · Computer Science 2015-10-07 Stefano Bistarelli , Maurizio Gabbrielli , Maria Chiara Meo , Francesco Santini

Language segmentation consists in finding the boundaries where one language ends and another language begins in a text written in more than one language. This is important for all natural language processing tasks. The problem can be solved…

Computation and Language · Computer Science 2015-10-07 David Alfter

We investigate in this paper how distributions of occupations with respect to gender is reflected in pre-trained language models. Such distributions are not always aligned to normative ideals, nor do they necessarily reflect a descriptive…

Computation and Language · Computer Science 2023-04-13 Samia Touileb , Lilja Øvrelid , Erik Velldal

Both statistical and rule-based approaches to part-of-speech (POS) disambiguation have their own advantages and limitations. Especially for Korean, the narrow windows provided by hidden markov model (HMM) cannot cover the necessary lexical…

cmp-lg · Computer Science 2008-02-03 Geunbae Lee , Jong-Hyeok Lee , Sanghyun Shin

One of the biggest challenges of end-to-end language generation from meaning representations in dialogue systems is making the outputs more natural and varied. Here we take a large corpus of 50K crowd-sourced utterances in the restaurant…

Computation and Language · Computer Science 2018-09-17 Juraj Juraska , Marilyn Walker

We introduce a novel dependency parser, the hexatagger, that constructs dependency trees by tagging the words in a sentence with elements from a finite set of possible tags. In contrast to many approaches to dependency parsing, our approach…

Computation and Language · Computer Science 2023-08-01 Afra Amini , Tianyu Liu , Ryan Cotterell

In a lexicalized grammar formalism such as Lexicalized Tree-Adjoining Grammar (LTAG), each lexical item is associated with at least one elementary structure (supertag) that localizes syntactic and semantic dependencies. Thus a parser for a…

cmp-lg · Computer Science 2008-02-03 Aravind K. Joshi , B. Srinivas

A new method based on the rejection sampling for finding statistical tests is proposed. This method is conceptually intuitive, easy to implement, and applicable for arbitrary dimension. To illustrate its potential applicability, three…

Methodology · Statistics 2026-03-11 Markku Kuismin
‹ Prev 1 4 5 6 7 8 10 Next ›