Sciweavers

38 search results - page 6 / 8
» Querying Parse Trees of Stochastic Context-Free Grammars
Sort
View
LREC
2010
203views Education» more  LREC 2010»
14 years 11 months ago
Arabic Parsing Using Grammar Transforms
We investigate Arabic Context Free Grammar parsing with dependency annotation comparing lexicalised and unlexicalised parsers. We study how morphosyntactic as well as function tag...
Lamia Tounsi, Josef van Genabith
75
Voted
TAPD
1998
81views more  TAPD 1998»
14 years 10 months ago
A Generalized CYK Algorithm for Parsing Stochastic CFG
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...
Jean-Cédric Chappelier, Martin Rajman
ICDAR
2003
IEEE
15 years 2 months ago
Parsing N-Best Lists of Handwritten Sentences
This paper investigates the application of a probabilistic parser for natural language on the list of the Nbest sentences produced by an off-line recognition system for cursive h...
Matthias Zimmermann, Jean-Cédric Chappelier...
173
Voted
IBPRIA
2011
Springer
14 years 28 days ago
Classifying Melodies Using Tree Grammars
Abstract. Similarity computation is a difficult issue in music information retrieval, because it tries to emulate the special ability that humans show for pattern recognition in ge...
José Francisco Bernabeu, Jorge Calera-Rubio...
82
Voted
CSB
2004
IEEE
208views Bioinformatics» more  CSB 2004»
15 years 1 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