Sciweavers

482 search results - page 49 / 97
» Structural Equations in Language Learning
Sort
View
ENTCS
2008
105views more  ENTCS 2008»
13 years 7 months ago
Declaring Numbers
Most implementations of functional and functional logic languages treat numbers and the basic numeric operations as external entities. The main reason for this is efficiency. Howe...
Bernd Braßel, Sebastian Fischer, Frank Huch
TAL
2004
Springer
14 years 1 months ago
Automatic Acquisition of Transfer Rules from Translation Examples
In our research, we have developed a transfer-based machine translation architecture for the translation from Japanese into German. One main feature of the system is the fully auto...
Werner Winiwarter
CIDM
2007
IEEE
13 years 11 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
CADE
2008
Springer
14 years 8 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
FLOPS
2006
Springer
13 years 11 months ago
Convergence in Language Design: A Case of Lightning Striking Four Times in the Same Place
What will a definitive programming language look like? By definitive language I mean a programming language that gives good soat its level of abstraction, allowing computer science...
Peter Van Roy