Differences between revisions 5 and 6
Revision 5 as of 2017-11-21 17:46:06
Size: 737
Editor: JohnCarroll
Comment:
Revision 6 as of 2017-12-18 13:09:58
Size: 737
Editor: JohnCarroll
Comment:
Deletions are marked like this. Additions are marked like this.
Line 14: Line 14:
[[http://www.computational-semantics.com/webshare/inv-3-hierarchy-lkb.png]] {{http://www.computational-semantics.com/webshare/inv-3-hierarchy-lkb.png}}

This page is a repository for documenting known issues with the LKB such that they can be investigated and corrected, should developers visit or revisit the relevant areas of the code.

  • In the following full type hierarchy:

a := *top*.
b := *top*.
d := a & b.
c := b.
e := a & c.
f := a & c.

the LKB establishes a type hierarchy with redundant edges from a - f and a - e:

http://www.computational-semantics.com/webshare/inv-3-hierarchy-lkb.png

One expects a graph with 10 edges, rather than 12, since ‘a’ already subsumes both ‘f’ and ‘e’ via ‘glbtype1’ and ‘glbtype2’. This bug is present in the Allegro CL version of the LKB, but is fixed in the fully open source version, LKB-FOS.

LkbBugs (last edited 2017-12-18 13:09:58 by JohnCarroll)

(The DELPH-IN infrastructure is hosted at the University of Oslo)