English
Related papers

Related papers: Determining Determiner Sequencing: A Syntactic Ana…

200 papers

This document describes a sizable grammar of English written in the TAG formalism and implemented for use with the XTAG system. This report and the grammar described herein supersedes the TAG grammar described in an earlier 1995 XTAG…

Computation and Language · Computer Science 2012-08-27 XTAG Research Group

This paper evaluates global-scale dialect identification for 14 national varieties of English as a means for studying syntactic variation. The paper makes three main contributions: (i) introducing data-driven language mapping as a method…

Computation and Language · Computer Science 2019-04-12 Jonathan Dunn

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

This paper presents the XTAG system, a grammar development tool based on the Tree Adjoining Grammar (TAG) formalism that includes a wide-coverage syntactic grammar for English. The various components of the system are discussed and…

cmp-lg · Computer Science 2008-02-03 Christy Doran , Dania Egedi , Beth Ann Hockey , B. Srinivas , Martin Zaidel

XTAG is an ongoing project to develop a wide-coverage grammar for English, based on the Feature-based Lexicalized Tree Adjoining Grammar (FB-LTAG) formalism. The XTAG system integrates a morphological analyzer, an N-best part-of-speech…

cmp-lg · Computer Science 2008-02-03 Christy Doran , Dania Egedi , Beth Ann Hockey , B. Srinivas

In a lexicalized grammar formalism such as Lexicalized Tree-Adjoining Grammar (LTAG), each lexical item is associated with at least one elementary structure (supertag) that localizes syntactic and semantic dependencies. Thus a parser for a…

cmp-lg · Computer Science 2008-02-03 Aravind K. Joshi , B. Srinivas

Lexical selection in Machine Translation consists of several related components. Two that have received a lot of attention are lexical mapping from an underlying concept or lexical item, and choosing the correct subcategorization frame…

cmp-lg · Computer Science 2008-02-03 Dania Egedi , Martha Palmer

Existing syntactic grammars of natural languages, even with a far from complete coverage, are complex objects. Assessments of the quality of parts of such grammars are useful for the validation of their construction. We evaluated the…

Computation and Language · Computer Science 2007-11-22 Eric Laporte

We introduce a family of multitask variational methods for semi-supervised sequence labeling. Our model family consists of a latent-variable generative model and a discriminative labeler. The generative models use latent variables to define…

Computation and Language · Computer Science 2019-06-25 Mingda Chen , Qingming Tang , Karen Livescu , Kevin Gimpel

Using feature-based Tree Adjoining Grammar (TAG), this paper presents linguistically motivated analyses of constructions claimed to require multi-component adjunction. These feature-based TAG analyses permit parsing of these constructions…

cmp-lg · Computer Science 2008-02-03 B. A. Hockey , B. Srinivas

Syntactic parsing is essential in natural-language processing, with constituent structure being one widely used description of syntax. Traditional views of constituency demand that constituents consist of adjacent words, but this poses…

Computation and Language · Computer Science 2024-10-14 Lukas Mielczarek

We propose a cognitively and linguistically motivated set of sorts for lexical semantics in a compositional setting: the classifiers in languages that do have such pronouns. These sorts are needed to include lexical considerations in a…

Computation and Language · Computer Science 2013-12-12 Bruno Mery , Christian Retoré

While language is a complex adaptive system, most work on syntactic variation observes a few individual constructions in isolation from the rest of the grammar. This means that the grammar, a network which connects thousands of structures…

Computation and Language · Computer Science 2023-09-22 Jonathan Dunn

Sentence encoders map sentences to real valued vectors for use in downstream applications. To peek into these representations - e.g., to increase interpretability of their results - probing tasks have been designed which query them for…

Computation and Language · Computer Science 2020-10-29 Steffen Eger , Johannes Daxenberger , Iryna Gurevych

Identifying linguistic differences between dialects of a language often requires expert knowledge and meticulous human analysis. This is largely due to the complexity and nuance involved in studying various dialects. We present a novel…

Computation and Language · Computer Science 2024-03-26 Roy Xie , Orevaoghene Ahia , Yulia Tsvetkov , Antonios Anastasopoulos

The semantics of determiner phrases, be they definite de- scriptions, indefinite descriptions or quantified noun phrases, is often as- sumed to be a fully solved question: common nouns are properties, and determiners are generalised…

Computation and Language · Computer Science 2016-03-02 Christian Retoré

This paper analyses the degree to which dialect classifiers based on syntactic representations remain stable over space and time. While previous work has shown that the combination of grammar induction and geospatial text classification…

Computation and Language · Computer Science 2022-09-13 Jonathan Dunn , Sidney Wong

Extended regular expressions with counting and interleaving are widely used in practice. However the related theoretical studies for this kind of expressions currently cannot meet the need of practical work. This paper develops syntax…

Computation and Language · Computer Science 2023-02-03 Xiaoying Mou , Haiming Chen

This paper presents a syntactic lexicon for English that was originally derived from the Oxford Advanced Learner's Dictionary and the Oxford Dictionary of Current Idiomatic English, and then modified and augmented by hand. There are more…

cmp-lg · Computer Science 2008-02-03 Dania Egedi , Patrick Martin

A dichotomy result of Sevenster (2014) completely classified the quantifier prefixes of regular Independence-Friendly (IF) logic according to the patterns of quantifier dependence they contain. On one hand, prefixes that contain "Henkin" or…

Logic · Mathematics 2019-10-01 Fausto Barbero
‹ Prev 1 2 3 10 Next ›