English
Related papers

Related papers: Encoding Frequency Information in Lexicalized Gram…

200 papers

In this paper we present a fully lexicalized grammar formalism as a particularly attractive framework for the specification of natural language grammars. We discuss in detail Feature-based, Lexicalized Tree Adjoining Grammars (FB-LTAGs), a…

cmp-lg · Computer Science 2008-02-03 B. Srinivas , Dania Egedi , Christy Doran , Tilman Becker

We here explore a ``fully'' lexicalized Tree-Adjoining Grammar for discourse that takes the basic elements of a (monologic) discourse to be not simply clauses, but larger structures that are anchored on variously realized discourse cues.…

cmp-lg · Computer Science 2007-05-23 Bonnie Lynn Webber , Aravind K. Joshi

This paper is an attempt to bring together two approaches to language analysis. The possible use of probabilistic information in principle-based grammars and parsers is considered, including discussion on some theoretical and computational…

cmp-lg · Computer Science 2008-02-03 Andrew Fordham , Matthew Crocker

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

Written language is a complex communication signal capable of conveying information encoded in the form of ordered sequences of words. Beyond the local order ruled by grammar, semantic and thematic structures affect long-range patterns in…

Physics and Society · Physics 2010-05-17 Marcelo A. Montemurro , Damian Zanette

Shifting to a lexicalized grammar reduces the number of parsing errors and improves application results. However, such an operation affects a syntactic parser in all its aspects. One of our research objectives is to design a realistic model…

Computation and Language · Computer Science 2007-11-22 Eric Laporte , Sébastien Paumier

We introduce a novel way to incorporate prior information into (semi-) supervised non-negative matrix factorization, which we call differentiable dictionary search. It enables general, highly flexible and principled modelling of mixtures…

Audio and Speech Processing · Electrical Eng. & Systems 2022-11-29 Lukáš Samuel Marták , Rainer Kelz , Gerhard Widmer

In this article we propose a novel method to estimate the frequency distribution of linguistic variables while controlling for statistical non-independence due to shared ancestry. Unlike previous approaches, our technique uses all available…

Populations and Evolution · Quantitative Biology 2021-03-22 Gerhard Jäger , Johannes Wahle

Nous pr\'esentons dans cette contribution une approche \`a la fois symbolique et probabiliste permettant d'extraire l'information sur la segmentation du signal de parole \`a partir d'information prosodique. Nous utilisons pour ce faire des…

Machine Learning · Computer Science 2008-12-18 Irina Nesterenko , Stéphane Rauzy

Lexical semantics theories differ in advocating that the meaning of words is represented as an inference graph, a feature mapping or a vector space, thus raising the question: is it the case that one of these approaches is superior to the…

Computation and Language · Computer Science 2020-11-17 António Branco , João Rodrigues , Małgorzata Salawa , Ruben Branco , Chakaveh Saedi

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

The combination of argumentation and probability paves the way to new accounts of qualitative and quantitative uncertainty, thereby offering new theoretical and applicative opportunities. Due to a variety of interests, probabilistic…

Artificial Intelligence · Computer Science 2018-03-12 Regis Riveret , Pietro Baroni , Yang Gao , Guido Governatori , Antonino Rotolo , Giovanni Sartor

After presenting a novel O(n^3) parsing algorithm for dependency grammar, we develop three contrasting ways to stochasticize it. We propose (a) a lexical affinity model where words struggle to modify each other, (b) a sense tagging model…

cmp-lg · Computer Science 2008-02-06 Jason Eisner

The Chapter starts with introductory information about quantitative linguistics notions, like rank--frequency dependence, Zipf's law, frequency spectra, etc. Similarities in distributions of words in texts with level occupation in quantum…

Data Analysis, Statistics and Probability · Physics 2024-01-04 Andrij Rovenchak

We present an empirical study of the applicability of Probabilistic Lexicalized Tree Insertion Grammars (PLTIG), a lexicalized counterpart to Probabilistic Context-Free Grammars (PCFG), to problems in stochastic natural-language processing.…

cmp-lg · Computer Science 2007-05-23 Rebecca Hwa

Automated decision making is often complicated by the complexity of the knowledge involved. Much of this complexity arises from the context sensitive variations of the underlying phenomena. We propose a framework for representing…

Artificial Intelligence · Computer Science 2013-03-25 Tze-Yun Leong

Research into the automatic acquisition of lexical information from corpora is starting to produce large-scale computational lexicons containing data on the relative frequencies of subcategorisation alternatives for individual verbal…

cmp-lg · Computer Science 2007-05-23 John Carroll , Guido Minnen , Ted Briscoe

We present a new framework for compositional distributional semantics in which the distributional contexts of lexemes are expressed in terms of anchored packed dependency trees. We show that these structures have the potential to capture…

Computation and Language · Computer Science 2016-08-26 David Weir , Julie Weeds , Jeremy Reffin , Thomas Kober

The paper presents a language model that develops syntactic structure and uses it to extract meaningful information from the word history, thus enabling the use of long distance dependencies. The model assigns probability to every joint…

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

In the article the fact is verified that the list of words selected by formal statistical methods (frequency and functional genre unrestrictedness) is not a conglomerate of non-related words. It creates a system of interrelated items and it…

Computation and Language · Computer Science 2010-06-01 Solomiya Buk
‹ Prev 1 2 3 10 Next ›