Sciweavers

1242 search results - page 48 / 249
» The Theory of Grammar Constraints
Sort
View
DLT
2006
15 years 3 months ago
Noncanonical LALR(1) Parsing
This paper addresses the longstanding problem of the recognition limitations of classical LALR(1) parser generators by proposing the usage of noncanonical parsers. To this end, we...
Sylvain Schmitz
IJCAI
2001
15 years 3 months ago
Narrative Prose Generation
Story generation is experiencing a revival, despite disappointing preliminary results from the preceding three decades. One of the principle reasons for previous inadequacies was ...
Charles B. Callaway, James C. Lester
ACL
1994
15 years 3 months ago
A Psycholinguistically Motivated Parser for CCG
Considering the speed in which humans resolve syntactic ambiguity, and the overwhelming evidence that syntactic ambiguity is resolved through selection of the analysis whose inter...
Michael Niv
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 2 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
VLSID
1994
IEEE
124views VLSI» more  VLSID 1994»
15 years 6 months ago
ILP-Based Scheduling with Time and Resource Constraints in High Level Synthesis
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
Samit Chaudhuri, Robert A. Walker