Posts Tagged ‘PLN’
PLN forward chainer
Posted by: jaredwigmore on: 2010-02-20
I (Jared Wigmore aka JaredW) have recently implemented a general forward chainer for PLN. (See Forward and Backward chaining on Wikipedia). Joel had previously implemented a prototype forward chainer, but it only supported deduction. PLN has a wide variety of inference rules. They each require different sorts of input atoms, and so a forward (or [...]
Visualizing PLN inference
Posted by: ferrouswheel on: 2009-06-02
Recently Jared Wigmore, a student of Waikato University, New Zealand, created a tool for visualizing PLN as part of a visualisation project.
In my opinion, the BIT visualiser shows great promise as a tool for understanding the complexities of BIT expansion. In particular, the cross joins between sub-trees make it much clearer how sharing of sub-trees [...]
Fun with first-order inference
Posted by: bgoertzel on: 2008-10-22
- In: Development
- 1 Comment
Joel Pitt has done some experiments testing first-order PLN inference in OpenCog, on some very simple data.
These experiments don’t use the indefinite probability formulas but rather the good old fashioned SimpleTruthValue PLN formulas.
What they involve is using PLN to extrapolate indirect word associations, from direct words associations mined from text (by some statistical text mining [...]
- jasonforceau: Hi, i am looking for tools for syntactic analysis for the system of my Final Year Project and found your post so interesting. But I don't know Link-Gr
- linasv: These graphs were discussed on the corpora mailing list in March 2009. See http://mailman.uib.no/public/corpora/2009-March/008193.html and followups i
- linasv: Martin Reynaert wrote to say: ''From what I have learned from the work of mainly Ramon Ferrer i Cancho ( http://www.lsi.upc.edu/~rferrericancho/p
OpenCog on del.icio.us
- An error has occurred; the feed is probably down. Try again later.
