Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

117

Voted

TBILLC
2005
Springer

98views Natural Language Processing» more TBILLC 2005»

Natural Logic for Natural Language

15 years 10 months ago

Natural Logic for Natural Language

Download homepages.cwi.nl

We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the deﬁnition of monotonicity preserving and monotonicity reversing functions in terms of ≤. Next, we present a new algorithm for polarity marking, and implement this for a particular fragment of syntax. Finally, we list the reseach agenda that these deﬁnitions and this algorithm suggest. The implementations use Haskell [8], and are given in ‘literate programming’ style [9].

Jan van Eijck

Real-time Traffic

Logical Consequence Relation | Monotonicity Reversing Functions | Partial Order | TBILLC 2005 |

claim paper

Related Content

» An interval logic for natural language semantics

» A Natural Logic inference system using the Lambek calculus

» A Compositional Natural Semantics and Hoare Logic for LowLevel Languages

» Satisfaction and Friendliness Relations within Classical Logic ProofTheoretic Approach

» A Controlled Natural Language Layer for the Semantic Web

» Programming in Logic with Constraints for Natural Language Processing

» LogicBased Rhetorical Structuring for Natural Language Generation in HumanComputer Dialogu...

» Dimensions of Difficulty in Translating Natural Language into FirstOrder Logic

» Controlled Natural Language Can Replace FirstOrder Logic

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	TBILLC
Authors	Jan van Eijck

Comments (0)