212 search results - page 8 / 43 » Second-Order Simple Grammars |
DCC
2007
IEEE
15 years 9 months ago
2007
IEEE
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
ACL
1998
14 years 11 months ago
1998
Treebanks, such as the Penn Treebank (PTB), offer a simple approach to obtaining a broad coverage grammar: one can simply read the grammar off the parse trees in the treebank. Whi...
ICGI
1998
Springer
15 years 2 months ago
1998
Springer
In this paper, we propose a new framework for the computational learning of formal grammars with positive data. In this model, both syntactic and semantic information are taken int...
LPAR
2010
Springer
14 years 7 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...