Sciweavers

54 search results - page 11 / 11
» Efficient Context-Free Grammar Constraints
Sort
View
COGSCI
2010
111views more  COGSCI 2010»
13 years 5 months ago
Mechanisms of Cognitive Development: Domain-General Learning or Domain-Specific Constraints?
many abstract categories (e.g., ``equivalence'') is innate. Although Plato argued with his contemporaries who advocated the empirical basis of knowledge, it was the Briti...
Vladimir Sloutsky
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 5 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
CICLING
2010
Springer
13 years 8 months ago
Systematic Processing of Long Sentences in Rule Based Portuguese-Chinese Machine Translation
The translation quality and parsing efficiency are often disappointed when Rule based Machine Translation systems deal with long sentences. Due to the complicated syntactic structu...
Francisco Oliveira, Fai Wong, Iok-Sai Hong
BMCBI
2005
162views more  BMCBI 2005»
13 years 5 months ago
Accelerated probabilistic inference of RNA structure evolution
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
Ian Holmes