Sciweavers

1242 search results - page 154 / 249
» The Theory of Grammar Constraints
Sort
View
108
Voted
ANLP
1992
68views more  ANLP 1992»
15 years 1 months ago
Evaluating Parsing Strategies Using Standardized Parse Files
The availability of large files of manuallyreviewed parse trees from the University of Pennsylvania "tree bank", along with a program for comparing system-generated pars...
Ralph Grishman, Catherine Macleod, John Sterling
ETS
2000
IEEE
156views Hardware» more  ETS 2000»
15 years 17 days ago
Parallel On-Line and In-Class Sections of "Writing for the Professions": A Practical Experiment
This paper describes experiences with on-line and in-class sections of a writing-intensive course, including a collaborative library literacy unit. It reports on a mid-semester so...
Victoria Hay, Dennis Isbell
CORR
2000
Springer
116views Education» more  CORR 2000»
15 years 18 days ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
JSC
2010
103views more  JSC 2010»
14 years 11 months ago
Anti-patterns for rule-based languages
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally ...
Horatiu Cirstea, Claude Kirchner, Radu Kopetz, Pie...
98
Voted
ISSTA
2009
ACM
15 years 7 months ago
Loop-extended symbolic execution on binary programs
Mixed concrete and symbolic execution is an important technique for finding and understanding software bugs, including securityrelevant ones. However, existing symbolic execution...
Prateek Saxena, Pongsin Poosankam, Stephen McCaman...