10,263 research outputs found
Constraint Logic Programming for Natural Language Processing
This paper proposes an evaluation of the adequacy of the constraint logic
programming paradigm for natural language processing. Theoretical aspects of
this question have been discussed in several works. We adopt here a pragmatic
point of view and our argumentation relies on concrete solutions. Using actual
contraints (in the CLP sense) is neither easy nor direct. However, CLP can
improve parsing techniques in several aspects such as concision, control,
efficiency or direct representation of linguistic formalism. This discussion is
illustrated by several examples and the presentation of an HPSG parser.Comment: 15 pages, uuencoded and compressed postscript to appear in
Proceedings of the 5th Int. Workshop on Natural Language Understanding and
Logic Programming. Lisbon, Portugal. 199
"Not not bad" is not "bad": A distributional account of negation
With the increasing empirical success of distributional models of
compositional semantics, it is timely to consider the types of textual logic
that such models are capable of capturing. In this paper, we address
shortcomings in the ability of current models to capture logical operations
such as negation. As a solution we propose a tripartite formulation for a
continuous vector space representation of semantics and subsequently use this
representation to develop a formal compositional notion of negation within such
models.Comment: 9 pages, to appear in Proceedings of the 2013 Workshop on Continuous
Vector Space Models and their Compositionalit
An alternative Gospel of structure: order, composition, processes
We survey some basic mathematical structures, which arguably are more
primitive than the structures taught at school. These structures are orders,
with or without composition, and (symmetric) monoidal categories. We list
several `real life' incarnations of each of these. This paper also serves as an
introduction to these structures and their current and potentially future uses
in linguistics, physics and knowledge representation.Comment: Introductory chapter to C. Heunen, M. Sadrzadeh, and E. Grefenstette.
Quantum Physics and Linguistics: A Compositional, Diagrammatic Discourse.
Oxford University Press, 201
TDL--- A Type Description Language for Constraint-Based Grammars
This paper presents \tdl, a typed feature-based representation language and
inference system. Type definitions in \tdl\ consist of type and feature
constraints over the boolean connectives. \tdl\ supports open- and closed-world
reasoning over types and allows for partitions and incompatible types. Working
with partially as well as with fully expanded types is possible. Efficient
reasoning in \tdl\ is accomplished through specialized modules.Comment: Will Appear in Proc. COLING-9
Stone-type representations and dualities for varieties of bisemilattices
In this article we will focus our attention on the variety of distributive
bisemilattices and some linguistic expansions thereof: bounded, De Morgan, and
involutive bisemilattices. After extending Balbes' representation theorem to
bounded, De Morgan, and involutive bisemilattices, we make use of Hartonas-Dunn
duality and introduce the categories of 2spaces and 2spaces. The
categories of 2spaces and 2spaces will play with respect to the
categories of distributive bisemilattices and De Morgan bisemilattices,
respectively, a role analogous to the category of Stone spaces with respect to
the category of Boolean algebras. Actually, the aim of this work is to show
that these categories are, in fact, dually equivalent
Nominal juxtaposition in Australian languages: An LFG analysis
It is well known that Australian languages make heavy use of nominal juxtaposition in a wide variety of functions, but there is little discussion in the theoretical literature of how such juxtapositions should be analysed. We discuss a range of data from Australian languages illustrating how multiple nominals share a single grammatical function within the clause. We argue that such constructions should be treated syntactically as set-valued grammatical functions in Lexical-Functional Grammar (LFG). Sets as values for functions are well-established in LFG and are used in the representation of adjuncts, and also in the representation of coordination. In many Australian languages, coordination is expressed asyndetically, that is, by nominal juxtaposition with no overt coordinator at all. We argue that the syntactic similarity of all juxtaposed constructions (ranging from coordination through a number of more appositional relations) motivates an analysis in which they are treated similarly in the syntax, but suitably distinguished in the semantics. We show how this can be achieved within LFG, providing a unified treatment of the syntax of juxtaposition in Australian languages and showing how the interface to the semantics can be quite straightforwardly defined in the modular LFG approach. Copyright © Cambridge University Press 2009
- …