Surface Structure, Intonation, and \u3cem\u3eFocus\u3c/em\u3e

The paper briefly reviews a theory of intonational prosody and its relation syntax, and to certain oppositions of discourse meaning that have variously been called topic and comment , theme and rheme , given and new , or presupposition and focus. The theory, which is based on Combinatory Categorial Grammar, is presented in full elsewhere. The present paper examines its implications for the semantics of focus

\u3ci\u3eCorrect Reasoning: Essays on Logic-Based AI in Honour of Vladimir Lifschitz\u3c/i\u3e

Co-edited by Yuliya Lierler, UNO faculty member. Essay, Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming, co-authored by Yuliya Lierler, UNO faculty member. This Festschrift published in honor of Vladimir Lifschitz on the occasion of his 65th birthday presents 39 articles by colleagues from all over the world with whom Vladimir Lifschitz had cooperation in various respects. The 39 contributions reflect the breadth and the depth of the work of Vladimir Lifschitz in logic programming, circumscription, default logic, action theory, causal reasoning and answer set programming.https://digitalcommons.unomaha.edu/facultybooks/1231/thumbnail.jp

Surface Structure, Intonation, and Meaning in Spoken Language

The paper briefly reviews a theory of intonational prosody and its relation syntax, and to certain oppositions of discourse meaning that have variously been called topic and comment , theme and rheme , given and new , or presupposition and focus . The theory, which is based on Combinatory Categorial Grammar, is presented in full elsewhere. the present paper examines its consequences for the automatic synthesis and analysis of speech

Grammars and Processors

The paper discusses the role of grammars in sentence processing, and explores some consequences of the Strong Competence Hypothesis of Bresnan and Kaplan for combinatory theories of grammar

POLYNOMIAL TIME PARSING OF COMBINATORY CATEGORIAL GRAMMARS

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 a representation of the parse trees has two phases. Initially, a shared for- est is build that encodes the set of all derivation trees for the input string. This shared forest is then pruned to remove all spurious ambiguity