Sciweavers

113 search results - page 16 / 23
» Deriving tolerant grammars from a base-line grammar
Sort
View
ACL
2011
14 years 3 months ago
Adjoining Tree-to-String Translation
We introduce synchronous tree adjoining grammars (TAG) into tree-to-string translation, which converts a source tree to a target string. Without reconstructing TAG derivations exp...
Yang Liu, Qun Liu, Yajuan Lü
ACL
2006
15 years 1 months ago
Acceptability Prediction by Means of Grammaticality Quantification
We propose in this paper a method for quantifying sentence grammaticality. The approach based on Property Grammars, a constraint-based syntactic formalism, makes it possible to ev...
Philippe Blache, Barbara Hemforth, Stéphane...
ACL
2006
15 years 1 months ago
An Improved Redundancy Elimination Algorithm for Underspecified Representations
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mut...
Alexander Koller, Stefan Thater
SCESM
2006
ACM
257views Algorithms» more  SCESM 2006»
15 years 5 months ago
Test ready UML statechart models
The dynamic behavior of systems is best described by Finite-state machines. Generation of executable tests from behavioral models such as UML Statecharts offers benefits such as s...
P. V. R. Murthy, P. C. Anitha, M. Mahesh, Rajesh S...
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 5 months ago
Learned mutation strategies in genetic programming for evolution and adaptation of simulated snakebot
In this work we propose an approach of incorporating learned mutation strategies (LMS) in genetic programming (GP) employed for evolution and adaptation of locomotion gaits of sim...
Ivan Tanev