Filters








2,972 Hits in 8.9 sec

Fast Learning from Strings of 2-Letter Rigid Grammars [chapter]

Yoav Seginer
2002 Lecture Notes in Computer Science  
In the search for classes which can be learned efficiently from strings, we study the class of 2-letter rigid grammars, which is the class of classical categorial grammars with an alphabet of two letters  ...  The (non-trivial) structure of this class of grammars is studied and it is shown that grammars in this class can be learned very efficiently.  ...  Learning 2-Letter Rigid Grammars Since the languages of loopless grammars consist of only one string, they are not interesting in terms of learnability.  ... 
doi:10.1007/3-540-45790-9_17 fatcat:sl4xqlen3vbtvcelpeqsuhfpem

Some Classes of Regular Languages Identifiable in the Limit from Positive Data [chapter]

François Denis, Aurélien Lemay, Alain Terlutte
2002 Lecture Notes in Computer Science  
k-testable Tree Languages and Applications p. 199 Fast Learning from Strings of 2-Letter Rigid Grammars p. 213 Learning Locally Testable Even Linear Languages from Positive Data p. 225 Inferring  ...  Used with permission. p. 28 Beyond EDSM p. 37 Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard p. 49 Some Classes of Regular Languages Identifiable in the Limit  ... 
doi:10.1007/3-540-45790-9_6 fatcat:nmlknwqoyfbybhb6rpomqrn7qy

Learning Lambek Grammars from Proof Frames [chapter]

Roberto Bonato, Christian Retoré
2014 Lecture Notes in Computer Science  
These grammars were shown to be unlearnable from strings by Foret and Le Nir.  ...  After a short reminder on grammatical inferenceà la Gold, we provide an algorithm that learns Lambek grammars with product from proof frames and we prove its convergence.  ...  Ideally, one would like to learn directly from strings, but in the case of Lambek grammars it has been shown to be impossible in [16] .  ... 
doi:10.1007/978-3-642-54789-8_7 fatcat:nooacismt5euhb2skhgtjxzmqm

Learning Lambek grammars from proof frames [article]

Roberto Bonato, Christian Retoré
2013 arXiv   pre-print
These grammars were shown to be unlearnable from strings by Foret and Le Nir.  ...  After a short reminder on grammatical inference à la Gold, we provide an algorithm that learns Lambek grammars with product from proof frames and we prove its convergence.  ...  Ideally, one would like to learn directly from strings, but in the case of Lambek grammars it has been shown to be impossible in [16] .  ... 
arXiv:1310.0576v1 fatcat:swun4qxqlndc5f5kfo7he2qvde

Learning Recursive Automata from Positive Examples

Isabelle Tellier
2006 Revue d'intelligence artificielle : Revue des Sciences et Technologies de l'Information  
Finally, new learnable subclasses of categorial grammars are defined, for which learning from strings is nearly not more expensive than from structures. RÉSUMÉ.  ...  In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial grammars.  ...  According to Property 6, such a string is obtained by following a path starting from the state x 3 /x 2 and reaching the final state F . The letter b labels such a direct path.  ... 
doi:10.3166/ria.20.775-804 fatcat:s4kxnkdtefb7daokgwnihiaq5i

Page 1140 of Linguistics and Language Behavior Abstracts: LLBA Vol. 27, Issue 3 [page]

1993 Linguistics and Language Behavior Abstracts: LLBA  
Smith’s data from an experiment where Ss were to detect wheth- er or not a displayed word contained a particular target letter (““Contex- tual Facilitation in a Letter Search Task Depends on How the Prime  ...  cognitive acts, more may be learned about the nature & potential of human memory in gener- al, & descriptions of experts’ memorizing procedures may help those without exceptional memories to learn to  ... 

Rapid development of spoken language understanding grammars

Ye-Yi Wang, Alex Acero
2006 Speech Communication  
We focus on the underlying technology of SGStudio, including knowledge assisted example-based grammar learning, grammar controls and configurable grammar structures.  ...  While the focus of SGStudio is to increase productivity, experimental results show that it also improves the quality of the grammars being developed.  ...  AN-7 is the grammar for the alphanumeric string of length 7. ANC/LPN is generated from the ANC grammar control in Table 4 . SSN task.  ... 
doi:10.1016/j.specom.2005.07.001 fatcat:2j2q3ownivdk5ipuoorucvmrcy

Implicit assumptions about implicit learning

Keith J. Holyoak, Merideth Gattis
1994 Behavioral and Brain Sciences  
We examine the evidence for implicit learning derived from subliminal learning, conditioning, artificial grammar learning, instrumental learning, and reaction times in sequence learning.  ...  The assumption that learning in some of these tasks (e.g., artificial grammar learning) is predominantly based on rule abstraction is questionable.  ...  ACKNOWLEDGMENTS The first author was supported by the UK Medical Research Council, and by a SERC/NATO fellowship held at the Department of Cognitive Science, University of California, San Diego.  ... 
doi:10.1017/s0140525x00035159 fatcat:fqtxatogcnbdndgdn7vujkausq

Spreadsheet Structure Discovery with Logic Programming

Jocelyn Paine
2008 arXiv   pre-print
We are implementing structure discovery tools in the logic-programming language Prolog for our spreadsheet analysis program Model Master, by writing grammars for spreadsheet structures.  ...  Our term "structure discovery" denotes the recovery of structure, such as the grouping of cells, that was intended by a spreadsheet's author but is not explicit in the spreadsheet.  ...  So we have symbols (the letters) that stand for themselves, but also symbols that stand for sets of strings.  ... 
arXiv:0802.3940v1 fatcat:afio6gurffd4jb2jibtqkzpkka

The language faculty that wasn't: a usage-based account of natural language recursion

Morten H. Christiansen, Nick Chater
2015 Frontiers in Psychology  
Evidence from genetics, comparative work on non-human primates, and cognitive neuroscience suggests that humans have evolved complex sequence learning skills, which were subsequently pressed into service  ...  We then focus on recursion as a detailed case study, arguing that our ability to process recursive structure does not rely on recursion as a property of the grammar, but instead emerges gradually by piggybacking  ...  The recalled 15 strings were then recoded in terms of their specific letters to avoid trivial biases such as the location of letters on the computer keyboard and the presence of potential acronyms (e.g  ... 
doi:10.3389/fpsyg.2015.01182 pmid:26379567 pmcid:PMC4550780 fatcat:eckublosh5eaxayc4jec67wdeu

Toward a computational framework for cognitive biology: Unifying approaches from cognitive neuroscience and comparative cognition

W. Tecumseh Fitch
2014 Physics of Life Reviews  
Starting at the neuronal level, I first discuss the contemporary realization that single neurons are powerful tree-shaped computers, which implies a reorientation of computational models of learning and  ...  Toward a computational framework for cognitive biology: Unifying approaches from cognitive neuroscience and comparative cognition. Phys Life Rev (2014), http://dx.  ...  Acknowledgements I acknowledge the financial support of ERC Advanced Grant SOMACCA, and thank Daniel Bowling and an anonymous reviewer for detailed comments on an earlier version of the manuscript.  ... 
doi:10.1016/j.plrev.2014.04.005 pmid:24969660 fatcat:5q72wz4vizathb4mi45zslkinu

Biological Metaphors In Designing Modular Artificial Neural Networks [chapter]

Egbert J. W. Boers, Herman Kuiper, Bart L. M. Happel, Ida G. Sprinkhuizen-Kuyper
1993 ICANN '93  
of the method, as well as a number of suggestions on how to continue from here. vi Contents Preface iii Abstract v  ...  The research comprised four parts: first, extensive reading was done to get familiar with the areas of neural networks, genetic algorithms and formal grammars.  ...  The results from [KITA90] do indicate his method works and that the method has less scaling problems than can be expected with so-called blueprint methods.  ... 
doi:10.1007/978-1-4471-2063-6_219 fatcat:hwr5mgg6x5edxpaktfocup5hlq

Learning Efficient Disambiguation [article]

Khalil Sima'an
1999 arXiv   pre-print
Novelties of these learning algorithms are 1) they limit the hypotheses-space to include only "safe" models, 2) are expressed as constrained optimization formulae that minimize the entropy of the training  ...  tree-bank given the specialized grammar, under the constraint that the size of the specialized model does not exceed a predefined maximum, and 3) they enable integrating the specialized model with the  ...  Greek letters such as α, β, γ, δ denote strings of symbols that can be either terminals or non-terminals (i.e. from V + ).  ... 
arXiv:cs/9906006v2 fatcat:of6kbtp255clbbboy4m73ite6q

A Stochastic Grammar of Images

Song-Chun Zhu, David Mumford
2006 Foundations and Trends in Computer Graphics and Vision  
The grammar should achieve the following four objectives and thus serves as a unified framework of representation, learning, and recognition for a large number of object categories.  ...  This model is learned from a relatively small training set per category and then sampled to synthesize a large number of configurations to cover novel object instances in the test set.  ...  string with n ≥ 1 symbols from V .  ... 
doi:10.1561/0600000018 fatcat:4gicslrfufabratzlxeiz275nm

Ignorance Was Bliss: Lynne Truss, You Opened Our Eyes ... And May Have Ruined Our Lives

Jan Miller, Bryce Cameron, Andrea Gottschalk, Brandy Stone, Melanie Yard
2005 Language Arts Journal of Michigan  
The context of the message must be recognized and factored into the reading of the message, itself. Despite the militant, overzealous, and rigid overtones emanating from each page, Ms.  ...  She takes pity on Truss who, as a child, corrected the grammar of her pen pal's letters.  ... 
doi:10.9707/2168-149x.1209 fatcat:onijnudnenha5nm4w7dofozu4a
« Previous Showing results 1 — 15 out of 2,972 results