Sciweavers

163 search results - page 2 / 33
» Improving the Context-sensitive Dependency Graph
Sort
View
CC
2006
Springer
122views System Software» more  CC 2006»
13 years 11 months ago
Context-Sensitive Points-to Analysis: Is It Worth It?
We present the results of an empirical study evaluating the precision of subset-based points-to analysis with several variations of context sensitivity on Java benchmarks of signif...
Ondrej Lhoták, Laurie J. Hendren
ACL
1996
13 years 8 months ago
Combining Trigram-based and Feature-based Methods for Context-Sensitive Spelling Correction
This paper addresses the problem of correcting spelling errors that result in valid, though unintended words (such as peace and piece, or quiet and quite) and also the problem of ...
Andrew R. Golding, Yves Schabes
ENTCS
2007
109views more  ENTCS 2007»
13 years 7 months ago
Improving the Context-sensitive Dependency Graph
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
Beatriz Alarcón, Raúl Gutiérr...
EACL
2009
ACL Anthology
13 years 5 months ago
Improving Grammaticality in Statistical Sentence Generation: Introducing a Dependency Spanning Tree Algorithm with an Argument S
like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level...
Stephen Wan, Mark Dras, Robert Dale, Cécile...
KR
2004
Springer
14 years 24 days ago
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Jean-François Baget