Natural Language Generation and Fuzzy Sets : An Exploratory Study on Geographical Referring Expression Generation

This work was supported by the Spanish Ministry for Economy and Competitiveness (grant TIN2014-56633-C3-1-R) and by the European Regional Development Fund (ERDF/FEDER) and the Galician Ministry of Education (grants GRC2014/030 and CN2012/151). Alejandro Ramos-Soto is supported by the Spanish Ministry for Economy and Competitiveness (FPI Fellowship Program) under grant BES-2012-051878.Postprin

The interpretation of universally quantified DPs and singular definites in adverbially quantified sentences

This paper deals with the conditions under which singular definites, on the one hand, and universally quantified DPs, on the other hand, receive interpretations according to which the sets denoted by the NP-complements of the respective determiner vary with the situations quantified over by a Q-adverb. I show that in both cases such interpretations depend on the availability of situation predicates that are compatible with the presuppositions associated with the respective determiner, as co-variation in both cases comes about via the binding of a covert situation variable that is contained within the NP-complement of the respective determiner. Secondly, I offer an account for the observation that the availability of a co-varying interpretation is more constrained in the case of universally quantified DPs than in the case of singular definites, as far as word order is concerned. This is shown to follow from the fact that co-varying definites in contrast to universally quantified DPs are inherently focus-marked

Outage Probability of Wireless Ad Hoc Networks with Cooperative Relaying

In this paper, we analyze the performance of cooperative transmissions in wireless ad hoc networks with random node locations. According to a contention probability for message transmission, each source node can either transmits its own message signal or acts as a potential relay for others. Hence, each destination node can potentially receive two copies of the message signal, one from the direct link and the other from the relay link. Taking the random node locations and interference into account, we derive closed-form expressions for the outage probability with different combining schemes at the destination nodes. In particular, the outage performance of optimal combining, maximum ratio combining, and selection combining strategies are studied and quantified.Comment: 7 pages; IEEE Globecom 201

Survey of the State of the Art in Natural Language Generation: Core tasks, applications and evaluation

This paper surveys the current state of the art in Natural Language Generation (NLG), defined as the task of generating text or speech from non-linguistic input. A survey of NLG is timely in view of the changes that the field has undergone over the past decade or so, especially in relation to new (usually data-driven) methods, as well as new applications of NLG technology. This survey therefore aims to (a) give an up-to-date synthesis of research on the core tasks in NLG and the architectures adopted in which such tasks are organised; (b) highlight a number of relatively recent research topics that have arisen partly as a result of growing synergies between NLG and other areas of artificial intelligence; (c) draw attention to the challenges in NLG evaluation, relating them to similar challenges faced in other areas of Natural Language Processing, with an emphasis on different evaluation methods and the relationships between them.Comment: Published in Journal of AI Research (JAIR), volume 61, pp 75-170. 118 pages, 8 figures, 1 tabl

Collaborating on Referring Expressions

This paper presents a computational model of how conversational participants collaborate in order to make a referring action successful. The model is based on the view of language as goal-directed behavior. We propose that the content of a referring expression can be accounted for by the planning paradigm. Not only does this approach allow the processes of building referring expressions and identifying their referents to be captured by plan construction and plan inference, it also allows us to account for how participants clarify a referring expression by using meta-actions that reason about and manipulate the plan derivation that corresponds to the referring expression. To account for how clarification goals arise and how inferred clarification plans affect the agent, we propose that the agents are in a certain state of mind, and that this state includes an intention to achieve the goal of referring and a plan that the agents are currently considering. It is this mental state that sanctions the adoption of goals and the acceptance of inferred plans, and so acts as a link between understanding and generation.Comment: 32 pages, 2 figures, to appear in Computation Linguistics 21-

Natural Language and its Ontology

This paper gives a characterization of the ontology implicit in natural language and the entities it involves, situates natural language ontology within metaphysics, and responds to Chomskys' dismissal of externalist semantics

A Decision Procedure for Herbrand Formulas without Skolemization

This paper describes a decision procedure for disjunctions of conjunctions of anti-prenex normal forms of pure first-order logic (FOLDNFs) that do not contain V within the scope of quantifiers. The disjuncts of these FOLDNFs are equivalent to prenex normal forms whose quantifier-free parts are conjunctions of atomic and negated atomic formulae (= Herbrand formulae). In contrast to the usual algorithms for Herbrand formulae, neither skolemization nor unification algorithms with function symbols are applied. Instead, a procedure is described that rests on nothing but equivalence transformations within pure first-order logic (FOL). This procedure involves the application of a calculus for negative normal forms (the NNF-calculus) with A -||- A & A (= &I) as the sole rule that increases the complexity of given FOLDNFs. The described algorithm illustrates how, in the case of Herbrand formulae, decision problems can be solved through a systematic search for proofs that reduce the number of applications of the rule &I to a minimum in the NNF-calculus. In the case of Herbrand formulae, it is even possible to entirely abstain from applying &I. Finally, it is shown how the described procedure can be used within an optimized general search for proofs of contradiction and what kind of questions arise for a &I-minimal proof strategy in the case of a general search for proofs of contradiction