333 search results - page 63 / 67 » Grammar Programming in TXL |
114
click to vote
LACL
2001
Springer
15 years 6 months ago
2001
Springer
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...
136
click to vote
LPAR
2001
Springer
15 years 6 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
122
click to vote
ACL
2006
15 years 3 months ago
2006
The LOGON MT demonstrator assembles independently valuable general-purpose NLP components into a machine translation pipeline that capitalizes on output quality. The demonstrator ...
116
click to vote
ANLP
1992
15 years 3 months ago
1992
The availability of large files of manuallyreviewed parse trees from the University of Pennsylvania "tree bank", along with a program for comparing system-generated pars...
145
Voted
ASC
2010
15 years 1 months ago
2010
Grammatical evolution (GE) is a form of grammar-based genetic programming. A particular feature of GE is that it adopts a distinction between the genotype and phenotype similar to...