About: Mnemonic link system     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : dbo:Software, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FMnemonic_link_system&invfp=IFP_OFF&sas=SAME_AS_OFF

A mnemonic link system, sometimes also known as a chain method, is a method of remembering lists that is based on creating an association between the elements of that list. For example, when memorizing the list (dog, envelope, thirteen, yarn, window), one could create a story about a "dog stuck in an envelope, mailed to an unlucky thirteen black cat playing with yarn by the window". It is argued that the story would be easier to remember than the list itself.

AttributesValues
rdf:type
rdfs:label
  • Mnemonic link system (en)
rdfs:comment
  • A mnemonic link system, sometimes also known as a chain method, is a method of remembering lists that is based on creating an association between the elements of that list. For example, when memorizing the list (dog, envelope, thirteen, yarn, window), one could create a story about a "dog stuck in an envelope, mailed to an unlucky thirteen black cat playing with yarn by the window". It is argued that the story would be easier to remember than the list itself. (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • A mnemonic link system, sometimes also known as a chain method, is a method of remembering lists that is based on creating an association between the elements of that list. For example, when memorizing the list (dog, envelope, thirteen, yarn, window), one could create a story about a "dog stuck in an envelope, mailed to an unlucky thirteen black cat playing with yarn by the window". It is argued that the story would be easier to remember than the list itself. Another method is to actually link each element of the list with a mental picture of an image that includes two elements in the list that are next to each other. This would form an open doubly linked list which could be traversed at will, backwards or forwards. For example, in the last list one could imagine their dog inside of a giant envelope, then a black cat eating an envelope. The same logic would be used with the rest of the items. The observation that absurd images are easier to remember is known as the Von Restorff effect, although the success of this effect was refuted by several studies (Hock et al. 1978; Einstein 1987), which found that the established connection between the two words is more important than the image's absurdity. In order to access a certain element of the list, one needs to recite the list step by step, much in the same vein as a linked list, in order to get the element from the system. There are three limitations to the link system. The first is that there is no numerical order imposed when memorizing, hence the practitioner cannot immediately determine the numerical position of an item; this can be solved by bundling numerical markers at set points in the chain or using the peg system instead. The second is that if any of the items is forgotten, the entire list may be in jeopardy. The third is the potential for confusing repeated segments of the list, a common problem when memorizing binary digits. This limitation can be resolved either through bundling or by using either the peg system or the method of loci. (en)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 59 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software