Sciweavers

1269 search results - page 15 / 254
» Learning Correction Grammars
Sort
View
CIARP
2009
Springer
14 years 2 months ago
Learning Relational Grammars from Sequences of Actions
Many tasks can be described by sequences of actions that normally exhibit some form of structure and that can be represented by a grammar. This paper introduces FOSeq, an algorithm...
Blanca Vargas-Govea, Eduardo F. Morales
MLMTA
2007
13 years 8 months ago
GenInc: An Incremental Context-Free Grammar Learning Algorithm for Domain-Specific Language Development
- While grammar inference (or grammar induction) has found extensive application in the areas of robotics, computational biology, speech and pattern recognition, its application to...
Faizan Javed, Marjan Mernik, Barrett R. Bryant, Al...
AAAI
2007
13 years 9 months ago
A Robot That Uses Existing Vocabulary to Infer Non-Visual Word Meanings from Observation
The authors present TWIG, a visually grounded wordlearning system that uses its existing knowledge of vocabulary, grammar, and action schemas to help it learn the meanings of new ...
Kevin Gold, Brian Scassellati
ACL
2001
13 years 8 months ago
Extending Lambek Grammars: a Logical Account of Minimalist Grammars
We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. Our logical definition leads to a neat relation...
Alain Lecomte, Christian Retoré
CPP
2011
107views more  CPP 2011»
12 years 7 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge