English
Related papers

Related papers: Tagging French Without Lexical Probabilities -- Co…

200 papers

Despite the frequent challenges posed by ambiguity when representing meaning via natural language, it is often ignored or deliberately removed in tasks mapping language to formally-designed representations, which generally assume a…

Computation and Language · Computer Science 2024-01-23 Elias Stengel-Eskin , Kyle Rawlins , Benjamin Van Durme

Statistical models of word-sense disambiguation are often based on a small number of contextual features or on a model that is assumed to characterize the interactions among a set of features. Model selection is presented as an alternative…

cmp-lg · Computer Science 2008-02-03 Ted Pedersen , Rebecca Bruce , Janyce Wiebe

We address the issue of how to associate frequency information with lexicalized grammar formalisms, using Lexicalized Tree Adjoining Grammar as a representative framework. We consider systematically a number of alternative probabilistic…

cmp-lg · Computer Science 2008-02-03 John Carroll , David Weir

Many fundamental problems in natural language processing rely on determining what entities appear in a given text. Commonly referenced as entity linking, this step is a fundamental component of many NLP tasks such as text understanding,…

Computation and Language · Computer Science 2016-02-01 Octavian-Eugen Ganea , Marina Ganea , Aurelien Lucchi , Carsten Eickhoff , Thomas Hofmann

The conventional natural language processing approaches are not accustomed to the social media text due to colloquial discourse and non-homogeneous characteristics. Significantly, the language identification in a multilingual document is…

Computation and Language · Computer Science 2021-06-30 M Zeeshan Ansari , Tanvir Ahmad , M M Sufyan Beg , Asma Ikram

We describe a generative probabilistic model of natural language, which we call HBG, that takes advantage of detailed linguistic information to resolve ambiguity. HBG incorporates lexical, syntactic, semantic, and structural information…

cmp-lg · Computer Science 2008-02-03 Ezra Black , Fred Jelinek , John Lafferty , David M. Magerman , Robert Mercer , Salim Roukos

We present a technique which complements Hidden Markov Models by incorporating some lexicalized states representing syntactically uncommon words. Our approach examines the distribution of transitions, selects the uncommon words, and makes…

Computation and Language · Computer Science 2007-05-23 Jin-Dong Kim , Sang-Zoo Lee , Hae-Chang Rim

Gender stereotypes are manifest in most of the world's languages and are consequently propagated or amplified by NLP systems. Although research has focused on mitigating gender stereotypes in English, the approaches that are commonly…

Computation and Language · Computer Science 2020-05-28 Ran Zmigrod , Sabrina J. Mielke , Hanna Wallach , Ryan Cotterell

The task of Semantic Parsing can be approximated as a transformation of an utterance into a logical form graph where edges represent semantic roles and nodes represent word senses. The resulting representation should be capture the meaning…

Computation and Language · Computer Science 2020-07-07 Ritwik Bose , Siddharth Vashishtha , James Allen

Morphologically rich languages often lack the annotated linguistic resources required to develop accurate natural language processing tools. We propose models suitable for training morphological taggers with rich tagsets for low-resource…

Computation and Language · Computer Science 2016-06-15 Jan Buys , Jan A. Botha

Lexical ambiguity presents a profound and enduring challenge to the language sciences. Researchers for decades have grappled with the problem of how language users learn, represent and process words with more than one meaning. Our work…

Computation and Language · Computer Science 2023-04-27 Benedetta Cevoli , Chris Watkins , Yang Gao , Kathleen Rastle

This squib claims that Large-scale Automatic Sense Tagging of text (LAST) can be done at a high-level of accuracy and with far less complexity and computational effort than has been believed until now. Moreover, it can be done for all open…

cmp-lg · Computer Science 2008-02-03 Yorick Wilks , Mark Stevenson

It is unclear whether, how and where large pre-trained language models capture subtle linguistic traits like ambiguity, grammaticality and sentence complexity. We present results of automatic classification of these traits and compare their…

Computation and Language · Computer Science 2022-10-18 Sunit Bhattacharya , Vilém Zouhar , Ondřej Bojar

Old French is a typical example of an under-resourced historic languages, that furtherly displays animportant amount of linguistic variation. In this paper, we present the current results of a long going project (2015-...) and describe how…

Computation and Language · Computer Science 2021-09-24 Jean-Baptiste Camps , Thibault Clérice , Frédéric Duval , Lucence Ing , Naomi Kanaoka , Ariane Pinche

This thesis presents a broad-coverage probabilistic top-down parser, and its application to the problem of language modeling for speech recognition. The parser builds fully connected derivations incrementally, in a single pass from…

Computation and Language · Computer Science 2007-05-23 Brian Roark

This paper studies the limits of language models' statistical learning in the context of Zipf's law. First, we demonstrate that Zipf-law token distribution emerges irrespective of the chosen tokenization. Second, we show that Zipf…

Computation and Language · Computer Science 2022-11-22 Elizaveta Zhemchuzhina , Nikolai Filippov , Ivan P. Yamshchikov

In many applications of natural language processing (NLP) it is necessary to determine the likelihood of a given word combination. For example, a speech recognizer may need to determine which of the two word combinations ``eat a peach'' and…

Computation and Language · Computer Science 2007-05-23 Ido Dagan , Lillian Lee , Fernando C. N. Pereira

The article describes a model of automatic analysis of puns, where a word is intentionally used in two meanings at the same time (the target word). We employ Roget's Thesaurus to discover two groups of words which, in a pun, form around two…

Computation and Language · Computer Science 2017-07-19 Elena Mikhalkova , Yuri Karyakin

Translating wordplay across languages presents unique challenges that have long confounded both professional human translators and machine translation systems. This research proposes a novel approach for translating puns from English to…

Computation and Language · Computer Science 2025-07-10 Russell Taylor , Benjamin Herbert , Michael Sana

When generating natural language from neural probabilistic models, high probability does not always coincide with high quality: It has often been observed that mode-seeking decoding methods, i.e., those that produce high-probability text…

Computation and Language · Computer Science 2022-04-01 Clara Meister , Gian Wiher , Tiago Pimentel , Ryan Cotterell