Results 21 to 30 of about 445,078 (279)
Probabilistic retrieval with a visual grammar [PDF]
We describe a system for content-based retrieval and classification of multispectral images. Our system models images on pixel, region and scene levels. To reduce the gap between low-level features and highlevel user semantics, and to support complex query scenarios that consist of many regions with different feature characteristics, we propose a ...
Selim Aksoy +3 more
openaire +2 more sources
Parsing of partially bracketed structures for parse selection [PDF]
We consider the problem of parsing a sentence that is partially annotated with information about where phrases start and end. The application domain is interactive parse selection with probabilistic grammars.
S´anchez-S´aez, Ricardo +1 more
core +2 more sources
The Credit Problem in parametric stress: A probabilistic approach
In this paper, we introduce a novel domain-general, statistical learning model for P&P grammars: the Expectation Driven Parameter Learner (EDPL). We show that the EDPL provides a mathematically principled solution to the Credit Problem (Dresher 1999). We
Aleksei Ioulevitch Nazarov, Gaja Jarosz
doaj +2 more sources
Tree parsing with synchronous tree-adjoining grammars [PDF]
Restricting the input or the output of a grammar-induced translation to a given set of trees plays an important role in statistical machine translation. The problem for practical systems is to find a compact (and in particular, finite) representation of ...
Vogler, Heiko +3 more
core +2 more sources
Lexicalization of probabilistic grammars [PDF]
Two general methods for the lexicalization of probabilistic grammars are presented which are modular, powerful and require only a small number of parameters. The first method multiplies the unlexicalized parse tree probability with the exponential of the mutual information terms of all word-governor pairs in the parse.
openaire +2 more sources
Ray Solomonoff, Founding Father of Algorithmic Information Theory
Ray J. Solomonoff died on December 7, 2009, in Cambridge, Massachusetts, of complications of a stroke caused by an aneurism in his head. Ray was the first inventor of Algorithmic Information Theory which deals with the shortest effective description ...
Paul M.B. Vitanyi
doaj +1 more source
Compound Probabilistic Context-Free Grammars for Grammar Induction [PDF]
We study a formalization of the grammar induction problem that models sentences as being generated by a compound probabilistic context-free grammar. In contrast to traditional formulations which learn a single stochastic grammar, our grammar's rule probabilities are modulated by a per-sentence continuous latent variable, which induces marginal ...
Yoon Kim, Chris Dyer, Alexander M. Rush
openaire +3 more sources
Proponents of a Universal Grammar argue that humans are born with a dedicated language system that shapes and restricts the number of grammars found in human languages (Chomsky, 2005). It is essentially innate and has a genetic manifestation.
Christian Kliesch
doaj +1 more source
Weighted parsing of trees [PDF]
We show how parsing of trees can be formalized in terms of the intersection of two tree languages. The focus is on weighted regular tree grammars and weighted tree adjoining grammars.
Nederhof, Mark Jan
core +3 more sources
Probabilistic Grammar: The view from Cognitive Sociolinguistics
In this paper, I propose that Probabilistic Grammar may benefit from incorporating theoretical insights from Cognitive (Socio)Linguistics. I begin by introducing Cognitive Linguistics.
Jeroen Claes
doaj +2 more sources

