Sciweavers

50 search results - page 10 / 10
» Learning Semantic Grammars with Constructive Inductive Logic...
Sort
View
LACL
2001
Springer
13 years 10 months ago
Structural Equations in Language Learning
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...
Michael Moortgat
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 5 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
CSL
2007
Springer
13 years 11 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin
ILP
1999
Springer
13 years 9 months ago
Approximate ILP Rules by Backpropagation Neural Network: A Result on Thai Character Recognition
This paper presents an application of Inductive Logic Programming (ILP) and Backpropagation Neural Network (BNN) to the problem of Thai character recognition. In such a learning pr...
Boonserm Kijsirikul, Sukree Sinthupinyo
ACL
1996
13 years 6 months ago
Chart Generation
Charts constitute a natural uniform architecture for parsing and generation provided string position is replaced by a notion more appropriate to logical forms and that measures ar...
Martin Kay