Using default logic for lexical knowledge

Author(s):  
Anthony Hunter
1990 ◽  
Vol 55 (4) ◽  
pp. 665-678 ◽  
Author(s):  
Beth A. Mineo ◽  
Howard Goldstein

This study examined the effectiveness of matrix-training procedures in teaching action + object utterances in both the receptive and expressive language modalities. The subjects were 4 developmentally delayed preschool boys who failed to produce spontaneous, functional two-word utterances. A multiple baseline design across responses with a multiple probe technique was employed. Subjects were taught 4–6 of 48 receptive and 48 expressive responses. Acquisition of a word combination rule was facilitated by the use of familiar lexical items, whereas subsequent acquisition of new lexical knowledge was enhanced by couching training in a previously trained word combination pattern. Although receptive knowledge was not sufficient for the demonstration of corresponding expressive performance for most of the children, only minimal expressive training was required to achieve this objective. For most matrix items, subjects responded receptively before they did so expressively. For 2 subjects, when complete receptive recombinative generalization had not been achieved, expressive training facilitated receptive responding. The results of this study elucidate benefits to training one linguistic aspect (lexical item, word combination pattern) at a time to maximize generalization in developmentally delayed preschoolers.


1992 ◽  
Vol 17 (1-2) ◽  
pp. 99-116
Author(s):  
V. Wiktor Marek ◽  
Miroslaw Truszczynski

Investigations of default logic have been so far mostly concerned with the notion of an extension of a default theory. It turns out, however, that default logic is much richer. Namely, there are other natural classes of objects that might be associated with default reasoning. We study two such classes of objects with emphasis on their relations with modal nonmonotonic formalisms. First, we introduce the concept of a weak extension and study its properties. It has long been suspected that there are close connections between default and autoepistemic logics. The notion of weak extension allows us to precisely describe the relationship between these two formalisms. In particular, we show that default logic with weak extensions is essentially equivalent to autoepistemic logic, that is, nonmonotonic logic KD45. In the paper we also study the notion of a set of formulas closed under a default theory. These objects are shown to correspond to stable theories and to modal logic S5. In particular, we show that skeptical reasoning with sets closed under default theories is closely related with provability in S5. As an application of our results we determine the complexity of reasoning with weak extensions and sets closed under default theories.


1993 ◽  
Vol 18 (2-4) ◽  
pp. 129-149
Author(s):  
Serge Garlatti

Representation systems based on inheritance networks are founded on the hierarchical structure of knowledge. Such representation is composed of a set of objects and a set of is-a links between nodes. Objects are generally defined by means of a set of properties. An inheritance mechanism enables us to share properties across the hierarchy, called an inheritance graph. It is often difficult, even impossible to define classes by means of a set of necessary and sufficient conditions. For this reason, exceptions must be allowed and they induce nonmonotonic reasoning. Many researchers have used default logic to give them formal semantics and to define sound inferences. In this paper, we propose a survey of the different models of nonmonotonic inheritance systems by means of default logic. A comparison between default theories and inheritance mechanisms is made. In conclusion, the ability of default logic to take some inheritance mechanisms into account is discussed.


2021 ◽  
pp. 174702182199892
Author(s):  
Chiara Valeria Marinelli ◽  
Marika Iaia ◽  
Cristina Burani ◽  
Paola Angelelli

The study examines statistical learning in the spelling of Italian children with dyslexia and typically developing readers by studying their sensitivity to probabilistic cues in phoneme-grapheme mappings. In the first experiment children spelled to dictation regular words and words with unpredictable spelling that contained either a high- or a low-frequency (i.e., typical or atypical) sound-spelling mappings. Children with dyslexia were found to rely on probabilistic cues in writing stimuli with unpredictable spelling to a greater extent than typically developing children. The difficulties of children with dyslexia on words with unpredictable spelling were limited to those containing atypical mappings. In the second experiment children spelled new stimuli, that is, pseudowords, containing phonological segments with unpredictable mappings. The interaction between lexical knowledge and reliance on probabilistic cues was examined through a lexical priming paradigm in which pseudowords were primed by words containing related typical or atypical sound-to-spelling mappings. In spelling pseudowords, children with dyslexia showed sensitivity to probabilistic cues in the phoneme-to-grapheme mapping but lexical priming effects were also found, although to a smaller extent than in typically developing readers. The results suggest that children with dyslexia have a limited orthographic lexicon but are able to extract regularities from the orthographic system and rely on probabilistic cues in spelling words and pseudowords.


2014 ◽  
Author(s):  
Debora Farias Frota ◽  
Ana Teresa Martins ◽  
Joao Alcantara ◽  
Luis Henrique Bustamante
Keyword(s):  

2006 ◽  
Vol 36 (6) ◽  
pp. 795-805 ◽  
Author(s):  
Michael R. Perkins ◽  
Sushie Dobbinson ◽  
Jill Boucher ◽  
Simone Bol ◽  
Paul Bloom
Keyword(s):  

2013 ◽  
Vol 39 (1) ◽  
pp. 57-85 ◽  
Author(s):  
Alexander Fraser ◽  
Helmut Schmid ◽  
Richárd Farkas ◽  
Renjing Wang ◽  
Hinrich Schütze

We study constituent parsing of German, a morphologically rich and less-configurational language. We use a probabilistic context-free grammar treebank grammar that has been adapted to the morphologically rich properties of German by markovization and special features added to its productions. We evaluate the impact of adding lexical knowledge. Then we examine both monolingual and bilingual approaches to parse reranking. Our reranking parser is the new state of the art in constituency parsing of the TIGER Treebank. We perform an analysis, concluding with lessons learned, which apply to parsing other morphologically rich and less-configurational languages.


Sign in / Sign up

Export Citation Format

Share Document