Skip to content
Go to file

Latest commit


Git stats


Failed to load latest commit information.
Latest commit message
Commit time


Wordnet-prolog includes new versions of the WNprolog databases, compiled by Eric Kafe (, and bundled with a copy of the original WNprolog-3.0 documentation (c) 2012 Princeton University.


WNprolog-3.1 is a Prolog version of WordNet 3.1. The Prolog databases were generated from the original WordNet 3.1 databases (c) 2011 Princeton University,

Some missing links were added, in order to enforce full symmetry of the symmetric relations. Also, this version avoids duplicates, and contains only unique clauses:

  • 7988
  • 1278
  • 9559
  • 221
  • 74781
  • 408
  • 21684
  • 117791
  • 89172
  • 8589
  • 12288
  • 9111
  • 797
  • 8074
  • 73
  • 4054
  • 21434
  • 207272
  • 207272
  • 1054
  • 1744
  • total: 804644

Other Prolog versions of WordNet

The wordnet-prolog repository also includes alternative branches with Prolog versions of WordNet 3.0 and English WordNet 2020.

Utilities: is a SWI-prolog program testing for some potential issues in WordNet:

  • check_keys: ambiguous sense keys, pointing to more than one synset
  • symcheck: missing symmetry in the symmetric relations
  • antisymcheck: direct loops in the antisymmetric relations
  • hypself: self-hyponymous word forms
  • check_duplicates: find duplicate clauses

The accompanying file is a SWI-prolog program implementing some common WordNet use cases, and a few formal checks, like symmetry and transitive loop detection.

For convenient inter-operation with other projects, the program converts the Prolog databases to comma-separated CSV files, which can be easily imported into most database systems.

Type "make valid" or "make query" to run the SWI-prolog programs, or "make csv" to generate CSV databases.

News (2020):

CSV versions of the WordNet databases (output by are now available through the wncsv project at:


Prolog versions of the WordNet databases




No packages published
You can’t perform that action at this time.