English
Related papers

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

200 papers

In this paper we compare two competing approaches to part-of-speech tagging, statistical and constraint-based disambiguation, using French as our test language. We imposed a time limit on our experiment: the amount of time spent on the…

cmp-lg · Computer Science 2016-08-31 Jean-Pierre Chanod , Pasi Tapanainen

The described tagger is based on a hidden Markov model and uses tags composed of features such as part-of-speech, gender, etc. The contextual probability of a tag (state transition probability) is deduced from the contextual probabilities…

cmp-lg · Computer Science 2008-02-03 Andre Kempe

One of the problems in part-of-speech tagging of real-word texts is that of unknown to the lexicon words. In Mikheev (ACL-96 cmp-lg/9604022), a technique for fully unsupervised statistical acquisition of rules which guess possible…

cmp-lg · Computer Science 2008-02-03 Andrei Mikheev

We consider the problem of disambiguating the lemma and part of speech of ambiguous words in morphologically rich languages. We propose a method for disambiguating ambiguous words in context, using a large un-annotated corpus of text, and a…

Computation and Language · Computer Science 2020-07-14 José María Hoya Quecedo , Maximilian W. Koppatz , Giacomo Furlan , Roman Yangarber

We earlier described two taggers for French, a statistical one and a constraint-based one. The two taggers have the same tokeniser and morphological analyser. In this paper, we describe aspects of this work concerned with the definition of…

cmp-lg · Computer Science 2008-02-03 Jean-Pierre Chanod , Pasi Tapanainen

Social media features substantial stylistic variation, raising new challenges for syntactic analysis of online writing. However, this variation is often aligned with author attributes such as age, gender, and geography, as well as more…

Computation and Language · Computer Science 2018-04-23 Murali Raghu Babu Balusu , Taha Merghani , Jacob Eisenstein

There are two main methodologies for constructing the knowledge base of a natural language analyser: the linguistic and the data-driven. Recent state-of-the-art part-of-speech taggers are based on the data-driven approach. Because of the…

cmp-lg · Computer Science 2016-08-31 Atro Voutilainen

Diversity is an important property of datasets and sampling data for diversity is useful in dataset creation. Finding the optimally diverse sample is expensive, we therefore present a heuristic significantly increasing diversity relative to…

Computation and Language · Computer Science 2025-01-15 Louis Estève , Manon Scholivet , Agata Savary

Most recent research in trainable part of speech taggers has explored stochastic tagging. While these taggers obtain high accuracy, linguistic information is captured indirectly, typically in tens of thousands of lexical and contextual…

cmp-lg · Computer Science 2008-02-03 Eric Brill

The dissertation addresses the design of parsing grammars for automatic surface-syntactic analysis of unconstrained English text. It consists of a summary and three articles. {\it Morphological disambiguation} documents a grammar for…

cmp-lg · Computer Science 2008-02-03 Atro Voutilainen

Discourse connectives (e.g. however, because) are terms that can explicitly convey a discourse relation within a text. While discourse connectives have been shown to be an effective clue to automatically identify discourse relations, they…

Computation and Language · Computer Science 2017-04-19 Majid Laali , Leila Kosseim

Critical to natural language generation is the production of correctly inflected text. In this paper, we isolate the task of predicting a fully inflected sentence from its partially lemmatized version. Unlike traditional morphological…

Computation and Language · Computer Science 2019-05-07 Ekaterina Vylomova , Ryan Cotterell , Timothy Baldwin , Trevor Cohn , Jason Eisner

We describe an approach to robust domain-independent syntactic parsing of unrestricted naturally-occurring (English) input. The technique involves parsing sequences of part-of-speech and punctuation labels using a unification-based grammar…

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

We demonstrate the effectiveness of multilingual learning for unsupervised part-of-speech tagging. The central assumption of our work is that by combining cues from multiple languages, the structure of each becomes more apparent. We…

Computation and Language · Computer Science 2014-01-23 Tahira Naseem , Benjamin Snyder , Jacob Eisenstein , Regina Barzilay

We propose a theoretical framework within which information on the vocabulary of a given corpus can be inferred on the basis of statistical information gathered on that corpus. Inferences can be made on the categories of the words in the…

Computation and Language · Computer Science 2008-10-08 Pascal Vaillant , Richard Nock , Claudia Henry

We discuss combining knowledge-based (or rule-based) and statistical part-of-speech taggers. We use two mature taggers, ENGCG and Xerox Tagger, to independently tag the same text and combine the results to produce a fully disambiguated…

cmp-lg · Computer Science 2008-02-03 Pasi Tapanainen , Atro Voutilainen

This thesis investigates how the sub-structure of words can be accounted for in probabilistic models of language. Such models play an important role in natural language processing tasks such as translation or speech recognition, but often…

Computation and Language · Computer Science 2015-08-19 Jan A. Botha

Lexical ambiguity makes it difficult to compute various useful statistics of a corpus. A given word form might represent any of several morphological feature bundles. One can, however, use unsupervised learning (as in EM) to fit a model…

Computation and Language · Computer Science 2020-02-26 Ryan Cotterell , Christo Kirov , Sabrina J. Mielke , Jason Eisner

Probabilistic approaches to part-of-speech tagging rely primarily on whole-word statistics about word/tag combinations as well as contextual information. But experience shows about 4 per cent of tokens encountered in test sets are unknown…

Computation and Language · Computer Science 2013-02-28 Greg Adams , Beth Millar , Eric Neufeld , Tim Philip

We leverage generative large language models for language learning applications, focusing on estimating the difficulty of foreign language texts and simplifying them to lower difficulty levels. We frame both tasks as prediction problems and…

Computation and Language · Computer Science 2024-07-26 Henri Jamet , Yash Raj Shrestha , Michalis Vlachos
‹ Prev 1 2 3 10 Next ›