1064 search results - page 34 / 213 » Single Tree Grammars |
CEC
2005
IEEE
14 years 2 months ago
2005
IEEE
The most controversial part of genetic programming is its highly disruptive and potentially innovative subtree crossover operator. The clearest problem with the crossover operator...
LACL
2005
Springer
14 years 1 months ago
2005
Springer
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
ICRA
2007
IEEE
14 years 2 months ago
2007
IEEE
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...
ACL
1993
13 years 9 months ago
1993
We describe a generative probabilistic model of natural language, which we call HBG, that takes advantage of detailed linguistic information to resolve ambiguity. HBG incorporates...
ECOOP
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents an object-oriented technique for rewriting abstract syntax trees in order to simplify compilation. The technique, Rewritable Reference Attributed Grammars (ReRA...