Sciweavers

1269 search results - page 40 / 254
» Learning Correction Grammars
Sort
View
99
Voted
ACL
1998
15 years 2 months ago
Conditions on Consistency of Probabilistic Tree Adjoining Grammars
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
Anoop Sarkar
138
Voted
AIIA
1995
Springer
15 years 4 months ago
Learning Programs in Different Paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
Man Leung Wong, Kwong-Sak Leung
127
Voted
AAAI
2011
14 years 21 days ago
Using Semantic Cues to Learn Syntax
We present a method for dependency grammar induction that utilizes sparse annotations of semantic relations. This induction set-up is attractive because such annotations provide u...
Tahira Naseem, Regina Barzilay
INFSOF
2008
118views more  INFSOF 2008»
15 years 20 days ago
MARS: A metamodel recovery system using grammar inference
Domain-specific modeling (DSM) assists subject matter experts in describing the essential characteristics of a problem in their domain. Various software artifacts can be generated...
Faizan Javed, Marjan Mernik, Jeff Gray, Barrett R....
ICCS
2001
Springer
15 years 5 months ago
Learning to Generate CGs from Domain Specific Sentences
Automatically generating Conceptual Graphs (CGs) [1] from natural language sentences is a difficult task in using CG as a semantic (knowledge) representation language for natural l...
Lei Zhang, Yong Yu