Sciweavers

4743 search results - page 17 / 949
» The PlusCal Algorithm Language
Sort
View
DLT
2009
13 years 7 months ago
Strongly Regular Grammars and Regular Approximation of Context-Free Languages
Abstract. We consider algorithms for approximating context
Ömer Egecioglu
IFIP
1994
Springer
14 years 1 months ago
Factorizing Languages
We consider three notions of factorization arising in different frameworks: factorizing languages, factorization of the natural numbers, factorizing codes. A language X A is call...
Marcella Anselmo, Antonio Restivo
IJCAI
2003
13 years 11 months ago
A Revised Algorithm for Latent Semantic Analysis
The intelligent tutoring system AutoTutor uses latent semantic analysis to evaluate student answers to the tutor's questions. By comparing a student's answer to a set of...
Xiangen Hu, Zhiqiang Cai, Max M. Louwerse, Andrew ...
COLING
2002
13 years 9 months ago
A Chart-Parsing Algorithm for Efficient Semantic Analysis
In some contexts, well-formed natural language cannot be expected as input to information or communication systems. In these contexts, the use of grammar-independent input (sequen...
Pascal Vaillant
ENTCS
2007
104views more  ENTCS 2007»
13 years 9 months ago
Algorithmic Debugging of Java Programs
In this paper we propose applying the ideas of declarative debugging to the object-oriented language Java as an alternative to traditional trace debuggers used in imperative langu...
Rafael Caballero, Christian Hermanns, Herbert Kuch...