Sciweavers

103 search results - page 18 / 21
» Prototype-Driven Grammar Induction
Sort
View
CJ
2008
97views more  CJ 2008»
14 years 11 months ago
Three Kinds of Probabilistic Induction: Universal Distributions and Convergence Theorems
We will describe three kinds of probabilistic induction problems, and give general solutions for each , with associated convergence theorems that show they tend to give good proba...
Ray J. Solomonoff
GG
2010
Springer
15 years 22 days ago
On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
Paolo Baldan, Alessandro Bruni, Andrea Corradini, ...
DL
2000
Springer
164views Digital Library» more  DL 2000»
15 years 4 months ago
Scalable browsing for large collections: a case study
Phrase browsing techniques use phrases extracted automatically from a large information collection as a basis for browsing and accessing it. This paper describes a case study that...
Gordon W. Paynter, Ian H. Witten, Sally Jo Cunning...
ACL
2010
14 years 9 months ago
Profiting from Mark-Up: Hyper-Text Annotations for Guided Parsing
We show how web mark-up can be used to improve unsupervised dependency parsing. Starting from raw bracketings of four common HTML tags (anchors, bold, italics and underlines), we ...
Valentin I. Spitkovsky, Daniel Jurafsky, Hiyan Als...
JMLR
2010
134views more  JMLR 2010»
14 years 6 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...