English
Related papers

Related papers: Three Generative, Lexicalised Models for Statistic…

200 papers

Lexicalized parsing models are based on the assumptions that (i) constituents are organized around a lexical head (ii) bilexical statistics are crucial to solve ambiguities. In this paper, we introduce an unlexicalized transition-based…

Computation and Language · Computer Science 2019-02-26 Maximin Coavoux , Benoît Crabbé , Shay B. Cohen

Existing probabilistic scanners and parsers impose hard constraints on the way lexical and syntactic ambiguities can be resolved. Furthermore, traditional grammar-based parsing tools are limited in the mechanisms they allow for taking…

Computation and Language · Computer Science 2012-05-16 Luis Quesada , Fernando Berzal , Francisco J. Cortijo

We propose a system for parsing and translating natural language that learns from examples and uses some background knowledge. As our parsing model we choose a deterministic shift-reduce type parser that integrates part-of-speech tagging…

cmp-lg · Computer Science 2008-02-03 Ulf Hermjakob

Spoken communication occurs in a "noisy channel" characterized by high levels of environmental noise, variability within and between speakers, and lexical and syntactic ambiguity. Given these properties of the received linguistic input,…

Computation and Language · Computer Science 2021-01-26 Stephan C. Meylan , Sathvik Nair , Thomas L. Griffiths

In foundational works of generative phonology it is claimed that subjects can reliably discriminate between possible but non-occurring words and words that could not be English. In this paper we examine the use of a probabilistic…

cmp-lg · Computer Science 2008-02-03 John Coleman , Janet Pierrehumbert

Probabilistic context-free grammars have a long-term record of use as generative models in machine learning and symbolic regression. When used for symbolic regression, they generate algebraic expressions. We define the latter as equivalence…

Formal Languages and Automata Theory · Computer Science 2022-12-05 Urh Primožič , Ljupčo Todorovski , Matej Petković

The paper describes a parser for Categorial Grammar which provides fully word by word incremental interpretation. The parser does not require fragments of sentences to form constituents, and thereby avoids problems of spurious ambiguity.…

cmp-lg · Computer Science 2016-08-31 David Milward

This study presents a new approach to metaphorical paraphrase generation by masking literal tokens of literal sentences and unmasking them with metaphorical language models. Unlike similar studies, the proposed algorithm does not only focus…

Computation and Language · Computer Science 2022-10-14 Giorgio Ottolina , John Pavlopoulos

We present a novel semi-supervised approach for sequence transduction and apply it to semantic parsing. The unsupervised component is based on a generative model in which latent sentences generate the unpaired logical forms. We apply this…

Computation and Language · Computer Science 2016-09-30 Tomáš Kočiský , Gábor Melis , Edward Grefenstette , Chris Dyer , Wang Ling , Phil Blunsom , Karl Moritz Hermann

A new language model for speech recognition is presented. The model develops hidden hierarchical syntactic-like structure incrementally and uses it to extract meaningful information from the word history, thus complementing the locality of…

Computation and Language · Computer Science 2007-05-23 Ciprian Chelba , Frederick Jelinek

Semantic word embeddings represent the meaning of a word via a vector, and are created by diverse methods. Many use nonlinear operations on co-occurrence statistics, and have hand-tuned hyperparameters and reweighting methods. This paper…

Machine Learning · Computer Science 2019-06-21 Sanjeev Arora , Yuanzhi Li , Yingyu Liang , Tengyu Ma , Andrej Risteski

Probabilistic word embeddings have shown effectiveness in capturing notions of generality and entailment, but there is very little work on doing the analogous type of investigation for sentences. In this paper we define probabilistic models…

Computation and Language · Computer Science 2020-05-19 Mingda Chen , Kevin Gimpel

Unsupervised dependency parsing aims to learn a dependency parser from unannotated sentences. Existing work focuses on either learning generative models using the expectation-maximization algorithm and its variants, or learning…

Computation and Language · Computer Science 2017-09-26 Yong Jiang , Wenjuan Han , Kewei Tu

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

It is now well established that sparse signal models are well suited to restoration tasks and can effectively be learned from audio, image, and video data. Recent research has been aimed at learning discriminative sparse models instead of…

Computer Vision and Pattern Recognition · Computer Science 2009-09-29 Julien Mairal , Francis Bach , Jean Ponce , Guillermo Sapiro , Andrew Zisserman

In this paper, we propose a globally normalized model for context-free grammar (CFG)-based semantic parsing. Instead of predicting a probability, our model predicts a real-valued score at each step and does not suffer from the label bias…

Computation and Language · Computer Science 2021-06-08 Chenyang Huang , Wei Yang , Yanshuai Cao , Osmar Zaïane , Lili Mou

This paper presents the first unsupervised approach to lexical semantic change that makes use of contextualised word representations. We propose a novel method that exploits the BERT neural language model to obtain representations of word…

Computation and Language · Computer Science 2020-10-21 Mario Giulianelli , Marco Del Tredici , Raquel Fernández

We present a statistical parsing framework for sentence-level sentiment classification in this article. Unlike previous works that employ syntactic parsing results for sentiment analysis, we develop a statistical parser to directly analyze…

Computation and Language · Computer Science 2015-03-06 Li Dong , Furu Wei , Shujie Liu , Ming Zhou , Ke Xu

We propose a novel approach to conformal prediction for generative language models (LMs). Standard conformal prediction produces prediction sets -- in place of single predictions -- that have rigorous, statistical performance guarantees. LM…

Computation and Language · Computer Science 2024-06-04 Victor Quach , Adam Fisch , Tal Schuster , Adam Yala , Jae Ho Sohn , Tommi S. Jaakkola , Regina Barzilay

We propose a topic modeling approach to the prediction of preferences in pairwise comparisons. We develop a new generative model for pairwise comparisons that accounts for multiple shared latent rankings that are prevalent in a population…

Machine Learning · Computer Science 2015-01-27 Weicong Ding , Prakash Ishwar , Venkatesh Saligrama