EEG

English Engine for Grammar

View project on GitHub

English Engine Grammar.

The algorithms used for this system are based upon the Direct Context Grammar architecture of SWI-Prolog, which uses a modified "if-then" operator: (X-->Y) which is equivalent to a strict equality.

The principle development of this was funded by NASA, and the research was conducted at Augustana University in Sioux Falls, South Dakota. The work was presented at the annual Augustana Symposium in 2010 by Ian Malloy, and can be found on youtube.com at the link labeled "symposium" at the bottom of this page.

To test the code, the following images depict both the call structure and subsequent "up" function. For the display of algorithms, enter "L" for "list."

List of Call Structure

The call structure shows the full relationship between algorithms of interest.

Stream Input for Three Sentences.

The streaming of input returns an error after the third entry, requiring an operator at the end of the call in place of a full stop.

Produce Phrases

The final image illustrates how to produce the grammatical structures, which have an initially goodness-of-fit to English (American) of 83%.

Author

Initially developed in 2010, Ian Malloy (@FunctionAnalysis).

Symposium Presentation