Sciweavers

113 search results - page 21 / 23
» Deriving tolerant grammars from a base-line grammar
Sort
View
AAAI
1997
13 years 7 months ago
Effective Bayesian Inference for Stochastic Programs
In this paper, we propose a stochastic version of a general purpose functional programming language as a method of modeling stochastic processes. The language contains random choi...
Daphne Koller, David A. McAllester, Avi Pfeffer
GG
2008
Springer
13 years 6 months ago
Pattern-Based Model-to-Model Transformation
We present a new, high-level approach for the specification of model-to-model transformations based on declarative patterns. These are (atomic or composite) constraints on triple ...
Juan de Lara, Esther Guerra
CEC
2010
IEEE
13 years 6 months ago
Implementing an intuitive mutation operator for interactive evolutionary 3D design
Abstract— Locality - how well neighbouring genotypes correspond to neighbouring phenotypes - has been described as a key element in Evolutionary Computation. Grammatical Evolutio...
Jonathan Byrne, James McDermott, Edgar Galvá...
COLING
1992
13 years 7 months ago
A Freely Available Wide Coverage Morphological Analyzer for English
This paper presents a morphological lexicon for English that handle more than 317000 inflected forms derived from over 90000 stems. The lexicon is available in two formats. The fi...
Daniel Karp, Yves Schabes, Martin Zaidel, Dania Eg...
SIGLEX
1991
13 years 9 months ago
Logical Structures in the Lexicon
The lexical entry for a word must contain all the information needed to construct a semantic representation for sentences that contain the word. Because of that requirement, the f...
John F. Sowa