Eliminating ditransitives

Authors:
András Kornai
Affiliations:
Institute for Quantitative Social Science, Harvard University, USA,Computer and Automation Research Institute, Hungarian Academy of Sciences, Hungary
Venue:
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Year:
2010

Citing 11
Cited 0

Computational lexicography for natural language processing

Computational lexicography for natural language processing
Knowledge representation: logical, philosophical and computational foundations

Knowledge representation: logical, philosophical and computational foundations
The syntactic process

The syntactic process
The teachable language comprehender: a simulation program and theory of language

Communications of the ACM
Automata, Languages, and Machines

Automata, Languages, and Machines
Readings in Knowledge Representation

Readings in Knowledge Representation
Associative Networks: The Representation and Use of Knowledge by Computers

Associative Networks: The Representation and Use of Knowledge by Computers
The fourteen primitive actions and their inferences.

The fourteen primitive actions and their inferences.
Hyperintensions

Journal of Logic and Computation
The algebra of lexical semantics

MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Mathematical Linguistics

Mathematical Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss how higher arity verbs such as give or promise can be treated in an algebraic framework that admits only unary and binary relations and does not rely on event variables.