English
Related papers

Related papers: Using Letter Positional Probabilities to Assess Wo…

200 papers

We describe an implemented system for robust domain-independent syntactic parsing of English, using a unification-based grammar of part-of-speech and punctuation labels coupled with a probabilistic LR parser. We present evaluations of the…

cmp-lg · Computer Science 2008-02-03 John Carroll , Ted Briscoe

The evaluative character of a word is called its semantic orientation. Positive semantic orientation indicates praise (e.g., "honest", "intrepid") and negative semantic orientation indicates criticism (e.g., "disturbing", "superfluous").…

Computation and Language · Computer Science 2007-05-23 Peter D. Turney , Michael L. Littman

Though English sentences are typically inflexible vis-\`a-vis word order, constituents often show far more variability in ordering. One prominent theory presents the notion that constituent ordering is directly correlated with constituent…

Computation and Language · Computer Science 2025-02-18 Ada Defne Tur , Gaurav Kamath , Siva Reddy

English speakers use probabilistic phrases such as likely to communicate information about the probability or likelihood of events. Communication is successful to the extent that the listener grasps what the speaker means to convey and, if…

Neurons and Cognition · Quantitative Biology 2023-11-28 Laurence T Maloney , Maria F Dal Martello , Vivian Fei , Valerie Ma

Lexical simplification (LS) aims to replace complex words in a given sentence with their simpler alternatives of equivalent meaning, to simplify the sentence. Recently unsupervised lexical simplification approaches only rely on the complex…

Computation and Language · Computer Science 2020-06-29 Jipeng Qiang , Yun Li , Yi Zhu , Yunhao Yuan , Xindong Wu

The tasks of lexical complexity prediction (LCP) and complex word identification (CWI) commonly presuppose that difficult to understand words are shared by the target population. Meanwhile, personalization methods have also been proposed to…

Computation and Language · Computer Science 2024-11-12 Adam Nohejl , Akio Hayakawa , Yusuke Ide , Taro Watanabe

Large language models (LLMs) are susceptible to memorizing training data, raising concerns about the potential extraction of sensitive information at generation time. Discoverable extraction is the most common method for measuring this…

Large Language Models (LLMs) have shown remarkable abilities recently, including passing advanced professional exams and demanding benchmark tests. This performance has led many to suggest that they are close to achieving humanlike or…

Computation and Language · Computer Science 2023-06-08 Nicholas Riccardi , Rutvik H. Desai

Many NLP tasks require to automatically identify the most significant words in a text. In this work, we derive word significance from models trained to solve semantic task: Natural Language Inference and Paraphrase Identification. Using an…

Computation and Language · Computer Science 2023-06-01 Dávid Javorský , Ondřej Bojar , François Yvon

We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with…

Formal Languages and Automata Theory · Computer Science 2011-07-12 Krishnendu Chatterjee , Mathieu Tracol

A growing body of recent evidence has highlighted the limitations of natural language processing (NLP) datasets and classifiers. These include the presence of annotation artifacts in datasets, classifiers relying on shallow features like a…

Computation and Language · Computer Science 2021-10-29 Debajyoti Datta , Shashwat Kumar , Laura Barnes , Tom Fletcher

Automatic scoring system is extremely complex for any language. Because natural language itself is a complex model. When we evaluate articles generated by natural language, we need to view the articles from many dimensions such as word…

Computation and Language · Computer Science 2020-08-27 Wanhong Huang

We propose a new method for evaluating the readability of simplified sentences through pair-wise ranking. The validity of the method is established through in-corpus and cross-corpus evaluation experiments. The approach correctly identifies…

Computation and Language · Computer Science 2016-03-22 Sowmya Vajjala , Detmar Meurers

Most current word prediction systems make use of n-gram language models (LM) to estimate the probability of the following word in a phrase. In the past years there have been many attempts to enrich such language models with further…

Computation and Language · Computer Science 2008-01-31 Tonio Wandmacher , Jean-Yves Antoine

Topics models, such as LDA, are widely used in Natural Language Processing. Making their output interpretable is an important area of research with applications to areas such as the enhancement of exploratory search interfaces and the…

Computation and Language · Computer Science 2019-04-01 Areej Alokaili , Nikolaos Aletras , Mark Stevenson

We describe an algorithm for automatic classification of idiomatic and literal expressions. Our starting point is that words in a given text segment, such as a paragraph, that are highranking representatives of a common topic of discussion…

Computation and Language · Computer Science 2018-02-28 Jing Peng , Anna Feldman , Ekaterina Vylomova

Based on data from a large-scale experiment with human subjects, we conclude that the logarithm of probability to guess a word in context (unpredictability) depends linearly on the word length. This result holds both for poetry and prose,…

Information Theory · Computer Science 2007-07-16 Dmitrii Manin

Literacy, or the ability to read and write, is a crucial indicator of success in life and greater society. It is estimated that 85% of people in juvenile delinquent systems cannot adequately read or write, that more than half of those with…

Other Computer Science · Computer Science 2023-11-13 Lexington Whalen , Nathan Bickel , Shash Comandur , Dalton Craven , Stanley Dubinsky , Homayoun Valafar

This paper presents a mathematical method of playing the puzzle game Wordle. In Wordle, the player has six tries to guess a secret word. After each guess the player is told how their guess compares to the secret word. With the available…

History and Overview · Mathematics 2022-04-14 Michael Bonthron

Despite recent advances in Natural Language Processing (NLP), hierarchical discourse parsing in the framework of Rhetorical Structure Theory remains challenging, and our understanding of the reasons for this are as yet limited. In this…

Computation and Language · Computer Science 2023-09-12 Yang Janet Liu , Tatsuya Aoyama , Amir Zeldes
‹ Prev 1 3 4 5 6 7 10 Next ›