Sciweavers

667 search results - page 20 / 134
» Total parser combinators
Sort
View
EMNLP
2010
13 years 6 months ago
Utilizing Extra-Sentential Context for Parsing
Syntactic consistency is the preference to reuse a syntactic construction shortly after its appearance in a discourse. We present an analysis of the WSJ portion of the Penn Treeba...
Jackie Chi Kit Cheung, Gerald Penn
CPP
2011
107views more  CPP 2011»
12 years 8 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
JPDC
2010
65views more  JPDC 2010»
13 years 7 months ago
Combining shared-coin algorithms
This paper shows that shared coin algorithms can be combined to optimize several complexity measures, even in the presence of a strong adversary. By combining shared coins of Brac...
James Aspnes, Hagit Attiya, Keren Censor
SIGSOFT
2005
ACM
14 years 9 months ago
Combining self-reported and automatic data to improve programming effort measurement
Measuring effort accurately and consistently across subjects in a programming experiment can be a surprisingly difficult task. In particular, measures based on self-reported data ...
Lorin Hochstein, Victor R. Basili, Marvin V. Zelko...
ICCD
2007
IEEE
157views Hardware» more  ICCD 2007»
14 years 5 months ago
Combining cluster sampling with single pass methods for efficient sampling regimen design
Microarchitectural simulation is orders of magnitude slower than native execution. As more elements are accurately modeled, problems associated with slow simulation are further ex...
Paul D. Bryan, Thomas M. Conte