Sciweavers

31 search results - page 5 / 7
» A Grammar Checking System for Punjabi
Sort
View
COLING
1990
13 years 8 months ago
Efficient Disjunctive Unification for Bottom-Up Parsing
This paper describes two novel techniques which, when applied together, in practice significantly reduce the time required for unifying disjunctive feature structures. The first i...
David M. Carter
KBSE
2000
IEEE
13 years 11 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
POPL
1997
ACM
13 years 11 months ago
Shape Types
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
Pascal Fradet, Daniel Le Métayer
ENTCS
2006
103views more  ENTCS 2006»
13 years 7 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
ACL
2000
13 years 8 months ago
PENS: A Machine-aided English Writing System for Chinese Users
Writing English is a big barrier for most Chinese users. To build a computer-aided system that helps Chinese users not only on spelling checking and grammar checking but also on w...
Ting Liu, Ming Zhou, Jianfeng Gao, Endong Xun, Cha...