Sciweavers

9 search results - page 2 / 2
» Extending Bidirectional Chart Parsing with a Stochastic Mode...
Sort
View
ACL
2008
13 years 7 months ago
Efficient, Feature-based, Conditional Random Field Parsing
Discriminative feature-based methods are widely used in natural language processing, but sentence parsing is still dominated by generative methods. While prior feature-based dynam...
Jenny Rose Finkel, Alex Kleeman, Christopher D. Ma...
COLING
1996
13 years 7 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
CSB
2004
IEEE
208views Bioinformatics» more  CSB 2004»
13 years 9 months ago
Pair Stochastic Tree Adjoining Grammars for Aligning and Predicting Pseudoknot RNA Structures
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
Hiroshi Matsui, Kengo Sato, Yasubumi Sakakibara
INTERSPEECH
2010
13 years 17 days ago
Memory-based active learning for French broadcast news
Stochastic dependency parsers can achieve very good results when they are trained on large corpora that have been manually annotated. Active learning is a procedure that aims at r...
Frédéric Tantini, Christophe Cerisar...