This paper1 presents a rapid and robust parsing system currently used to learn from large bodies of unedited text. The system contains a multivalued part-of-speech disambiguator a...
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
Though most translation systems have some mechanism for translating certain types of divergent predicate-argument structures, they do not provide a genera] procedure that takes ad...
We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This stra...
In the right situation, a speaker can use an unqualified indefinite description without being misunderstood. This use of language, normal slate implicature, is a kind of conversat...