In the past, NLP has always been based on the explicit or implicit use of linguistic knowledge. In classical computer linguistic applications explicit rule based approaches prevai...
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...
Aoife Cahill, Michael Burke, Ruth O'Donovan, Josef...
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
—This is a paper about a new resource, namely an English paraphrase dictionary extracted from the FrameNet lexicon and its example data base. I. THE LEXPAR PARAPHRASE DICTIONARY ...