The algebra of lexical semantics

Authors:
András Kornai
Affiliations:
Institite for Quantitative Social Science, Harvard University, Cambridge, MA and Hungarian Academy of Sciences, Computer and Automation Research Institute, Budapest
Venue:
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Year:
2007

Citing 6
Cited 1

Computational lexicography for natural language processing

Computational lexicography for natural language processing
Automata, Languages, and Machines

Automata, Languages, and Machines
Building Large Knowledge-Based Systems; Representation and Inference in the Cyc Project

Building Large Knowledge-Based Systems; Representation and Inference in the Cyc Project
Class-Based Construction of a Verb Lexicon

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Deep lexical semantics

CICLing'08 Proceedings of the 9th international conference on Computational linguistics and intelligent text processing
Mathematical Linguistics

Mathematical Linguistics

Eliminating ditransitives

FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar

Quantified Score

Hi-index	0.00

Visualization

Abstract

The current generative theory of the lexicon relies primarily on tools from formal language theory and mathematical logic. Here we describe how a different formal apparatus, taken from algebra and automata theory, resolves many of the known problems with the generative lexicon. We develop a finite state theory of word meaning based on machines in the sense of Eilenberg [11], a formalism capable of describing discrepancies between syntactic type (lexical category) and semantic type (number of arguments). This mechanism is compared both to the standard linguistic approaches and to the formalisms developed in AI/KR.