101
click to vote
ETAI
2000
15 years 14 days ago
2000
Stochastic logic programs combine ideas from probabilistic grammars with the expressive power of definite clause logic; as such they can be considered as an extension of probabili...
105
Voted
COGSCI
2004
15 years 15 days ago
2004
Four different kinds of grammars that can define crossing dependencies in human language are compared here: (i) context sensitive rewrite grammars with rules that depend on contex...
LRE
2007
15 years 15 days ago
2007
In this paper, we report on the role of the Urdu grammar in the Parallel Grammar (ParGram) project (Butt et al., 1999; Butt et al., 2002). The Urdu grammar was able to take advanta...
112
Voted
CI
2005
15 years 16 days ago
2005
TRACT SPECIFICATIONS FEI XIA AND MARTHA PALMER Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104 K. VIJAY-SHANKER Department of Com...
88
Voted
IPL
2007
15 years 16 days ago
2007
We discuss a bottom-up parsing technique based on delayed reductions, and investigate its capabilities and limitations. Some non-LR(k) grammars, for any k, are handled determinist...
100
click to vote
IDA
2007
Springer
15 years 18 days ago
2007
Springer
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
103
click to vote
LOGCOM
2008
15 years 18 days ago
2008
This paper defines the grammar class of sequentially indexed grammars (SIGs) that results of a change in the index stack handling mechanism of indexed grammars [Aho68, Aho69]. SIG...
JALC
2006
15 years 18 days ago
2006
-- Let {a1, a2, . . . , an} be an alphabet of n symbols and let Cn be the language of circular shifts of the word a1a2
92
Voted
IPL
2008
15 years 19 days ago
2008
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
ACTA
2007
15 years 23 days ago
2007
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...