Skip to content

stackmystack/SBVR-Parsing-Engine

 
 

Repository files navigation

SBVR SE Parsing Engine

This is a fork of APE (ACE Parsing Engine) made to parse SBVR Structured English sentences, especially rules. The goal is to support Deontic and Alethic statements.

In particular, the following kinds of sentences are supported:

  1. Regulative statements:
    1. It is obligatory that
    2. It is prohibited that
    3. It is permitted that
  2. Constitutive statements:
    1. It is necessary that
    2. It is possible that
    3. It is impossible that

What is different from Attempto?

Beware that the semantics of sentences produced by this parser differ from the original one, in particular:

  1. DRS for regulative statements (i.e. having deontic modalities) are introduced, namely obl and per
  2. DRS for constitutive statements (i.e. having alethic modalities) are changed from must to nec and from can to poss.
  3. A prohibition statement produces an obligation DRS that embeds a negation (according to SBVR 1.3)
  4. An impossibility statements produces a necessity DRS that embeds a negation (according to SBVR 1.3); Attempto produces a \neg can DRS.
  5. The following statements are not supported anymore:
    1. It is not possible
    2. It is not necessary
    3. It is recommended
    4. It is not recommended
    5. It is admissible
    6. It is not admissible
  6. May and should are both not supported anymore with their respective DRSs.

About

Parser for SBVR SE based on Attempto Parsing Engine (APE)

Topics

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages

  • Prolog 93.5%
  • Java 3.6%
  • XSLT 2.2%
  • Perl 0.3%
  • Shell 0.3%
  • Makefile 0.1%