Sciweavers

1064 search results - page 45 / 213
» Single Tree Grammars
Sort
View
EMNLP
2009
13 years 6 months ago
Self-Training PCFG Grammars with Latent Annotations Across Languages
We investigate the effectiveness of selftraining PCFG grammars with latent annotations (PCFG-LA) for parsing languages with different amounts of labeled training data. Compared to...
Zhongqiang Huang, Mary P. Harper
EACL
2003
ACL Anthology
13 years 10 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
QUESTA
2008
96views more  QUESTA 2008»
13 years 8 months ago
Reduction of a polling network to a single node
We consider a discrete-time tree network of polling servers where all packets are routed to the same node (called node 0), from which they leave the network. All packets have unit...
Paul Beekhuizen, Dee Denteneer, Jacques Resing
DATE
2009
IEEE
209views Hardware» more  DATE 2009»
14 years 3 months ago
A graph grammar based approach to automated multi-objective analog circuit design
— This paper introduces a graph grammar based approach to automated topology synthesis of analog circuits. A grammar is developed to generate circuits through production rules, t...
Angan Das, Ranga Vemuri
ACL
2008
13 years 10 months ago
Applying a Grammar-Based Language Model to a Simplified Broadcast-News Transcription Task
We propose a language model based on a precise, linguistically motivated grammar (a hand-crafted Head-driven Phrase Structure Grammar) and a statistical model estimating the proba...
Tobias Kaufmann, Beat Pfister