Sciweavers

238 search results - page 1 / 48
» Object grammars and random generation
Sort
View
DMTCS
1998
104views Mathematics» more  DMTCS 1998»
13 years 7 months ago
Object grammars and random generation
I. Dutour, Jean-Marc Fedou
CEC
2009
IEEE
14 years 3 days ago
Grammatical Evolution of L-systems
— L-systems are parallel generative grammars that can model branching structures. Taking a graphical object and attempting to derive an L-system describing it is a hard problem. ...
Darren Beaumont, Susan Stepney
ACL
1994
13 years 8 months ago
Optimizing the Computational Lexicalization of Large Grammars
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
Christian Jacquemin
IWPT
2001
13 years 8 months ago
Automatic Grammar Partitioning for Syntactic Parsing
Natural language processing technologies offer ease-of-use of computers for average users, and easeof-access to on-line information. Natural language, however, is complex, and the...
Po-Chui Luk, Fuliang Weng, Helen Meng
TCS
2010
13 years 5 months ago
Maximum likelihood analysis of algorithms and data structures
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
Ulrich Laube, Markus E. Nebel