English
Related papers

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

200 papers

The probabilistic graphs framework models the uncertainty inherent in real-world domains by means of probabilistic edges whose value quantifies the likelihood of the edge existence or the strength of the link it represents. The goal of this…

Artificial Intelligence · Computer Science 2012-05-25 Claudio Taranto , Nicola Di Mauro , Floriana Esposito

Word segmentation and part-of-speech tagging are two critical preliminary steps for downstream tasks in Vietnamese natural language processing. In reality, people tend to consider also the phrase boundary when performing word segmentation…

Computation and Language · Computer Science 2021-06-17 Duc-Vu Nguyen , Kiet Van Nguyen , Ngan Luu-Thuy Nguyen

This paper (cmp-lg/yymmnnn) has been accepted for publication in the student session of EACL-95. It outlines ongoing work using statistical and unsupervised neural network methods for clustering words in untagged corpora. Such approaches…

cmp-lg · Computer Science 2008-02-03 Christopher C. Huckle

We apply decision tree induction to the problem of discourse clue word sense disambiguation with a genetic algorithm. The automatic partitioning of the training set which is intrinsic to decision tree induction gives rise to linguistically…

cmp-lg · Computer Science 2008-02-03 Eric V. Siegel , Kathleen R. McKeown

A word having multiple senses in a text introduces the lexical semantic task to find out which particular sense is appropriate for the given context. One such task is Word sense disambiguation which refers to the identification of the most…

Computation and Language · Computer Science 2019-01-24 Mohd Zeeshan Ansari , Lubna Khan

Natural language processing (NLP) applied to information retrieval (IR) and filtering problems may assign part-of-speech tags to terms and, more generally, modify queries and documents. Analytic models can predict the performance of a text…

cmp-lg · Computer Science 2008-02-03 Robert M. Losee

Traditional Linear Genetic Programming (LGP) algorithms are based only on the selection mechanism to guide the search. Genetic operators combine or mutate random portions of the individuals, without knowing if the result will lead to a…

Neural and Evolutionary Computing · Computer Science 2017-04-05 Léo Françoso Dal Piccol Sotto , Vinícius Veloso de Melo

In this paper, we describe an approach to sentence categorization which has the originality to be based on natural properties of languages with no training set dependency. The implementation is fast, small, robust and textual errors…

cmp-lg · Computer Science 2016-08-31 Emmanuel Giguet

Morphosyntactic lexicons and word vector representations have both proven useful for improving the accuracy of statistical part-of-speech taggers. Here we compare the performances of four systems on datasets covering 16 languages, two of…

Computation and Language · Computer Science 2016-08-10 Benoît Sagot

We present LemmaTag, a featureless neural network architecture that jointly generates part-of-speech tags and lemmas for sentences by using bidirectional RNNs with character-level and word-level embeddings. We demonstrate that both tasks…

Computation and Language · Computer Science 2018-08-28 Daniel Kondratyuk , Tomáš Gavenčiak , Milan Straka , Jan Hajič

Traditional natural language parsers are based on rewrite rule systems developed in an arduous, time-consuming manner by grammarians. A majority of the grammarian's efforts are devoted to the disambiguation process, first hypothesizing…

cmp-lg · Computer Science 2016-08-31 David M. Magerman

Although pretrained language models (PLMs) can be prompted to perform a wide range of language tasks, it remains an open question how much this ability comes from generalizable linguistic understanding versus surface-level lexical patterns.…

Computation and Language · Computer Science 2023-05-23 Terra Blevins , Hila Gonen , Luke Zettlemoyer

Automatically inducing the syntactic part-of-speech categories for words in text is a fundamental task in Computational Linguistics. While the performance of unsupervised tagging models has been slowly improving, current state-of-the-art…

Computation and Language · Computer Science 2014-02-27 Greg Dubbin , Phil Blunsom

We consider the problem of fully unsupervised learning of grammatical (part-of-speech) categories from unlabeled text. The standard maximum-likelihood hidden Markov model for this task performs poorly, because of its weak inductive bias and…

Computation and Language · Computer Science 2014-01-24 João V. Graça , Kuzman Ganchev , Luisa Coheur , Fernando Pereira , Ben Taskar

In textual knowledge management, statistical methods prevail. Nonetheless, some difficulties cannot be overcome by these methodologies. I propose a symbolic approach using a complete textual analysis to identify which analysis level can…

Computation and Language · Computer Science 2008-05-31 Bernard Jacquemin

Language models (LMs) estimate a probability distribution over strings in a natural language; these distributions are crucial for computing perplexity and surprisal in linguistics research. While we are usually concerned with measuring…

Computation and Language · Computer Science 2024-10-15 Tiago Pimentel , Clara Meister

We describe a stochastic approach to partial parsing, i.e., the recognition of syntactic structures of limited depth. The technique utilises Markov Models, but goes beyond usual bracketing approaches, since it is capable of recognising not…

cmp-lg · Computer Science 2007-05-23 Wojciech Skut , Thorsten Brants

Invitation to the statistical study of language: The topic of this presentation is the interdisciplinary nexus between linguistics and statistics. It targets linguists, for whom it may have a theoretical interest, or professionals that work…

Applications · Statistics 2018-04-23 Rogelio Nazar

Lexical ambiguity, a challenging phenomenon in all natural languages, is particularly prevalent for languages with diacritics that tend to be omitted in writing, such as Arabic. Omitting diacritics leads to an increase in the number of…

Computation and Language · Computer Science 2019-12-11 Sawsan Alqahtani , Hanan Aldarmaki , Mona Diab

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ć
‹ Prev 1 4 5 6 7 8 10 Next ›