Advanced

The integral dictionary: A lexical network based on componential semantics

Dutoit, D; Nugues, Pierre LU and de Torcy, P (2003) ICCSA 2003 In Lecture Notes in Computer Science (Computational Science and Its Applications – ICCSA 2003, Proceedings, Part I) 2667. p.368-377
Abstract
The Integral Dictionary is a comprehensive lexical network for French, English, German, Italian, and Spanish. It is based on componential semantics and lexical functions. The network structure superimposes two graphs. A first graph consists of a hierarchy of concepts divided into classes and themes where the words form the terminal nodes of the graph. A second graph links the words together using lexical functions derived from the Meaning-Text theory. We first introduce the lexical network whose database for French words is. comparable in its size to that of WordNet. We then describe two semantic distances to evaluate the proximity of two. words in the graph and to find their distinctive semantic components. Finally, we give examples of... (More)
The Integral Dictionary is a comprehensive lexical network for French, English, German, Italian, and Spanish. It is based on componential semantics and lexical functions. The network structure superimposes two graphs. A first graph consists of a hierarchy of concepts divided into classes and themes where the words form the terminal nodes of the graph. A second graph links the words together using lexical functions derived from the Meaning-Text theory. We first introduce the lexical network whose database for French words is. comparable in its size to that of WordNet. We then describe two semantic distances to evaluate the proximity of two. words in the graph and to find their distinctive semantic components. Finally, we give examples of applications we developed with it: the search of a word from a definition and the extraction of the semantic features of a text. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
Lecture Notes in Computer Science (Computational Science and Its Applications – ICCSA 2003, Proceedings, Part I)
volume
2667
pages
368 - 377
publisher
Springer
conference name
ICCSA 2003
external identifiers
  • wos:000184326400040
  • scopus:35248881037
ISSN
1611-3349
0302-9743
ISBN
978-3-540-40155-1
DOI
10.1007/3-540-44839-X_40
language
English
LU publication?
yes
id
19e97fe7-744f-4d88-b640-f54b4429ac59 (old id 305733)
date added to LUP
2007-08-29 13:12:18
date last changed
2018-05-29 11:41:42
@inproceedings{19e97fe7-744f-4d88-b640-f54b4429ac59,
  abstract     = {The Integral Dictionary is a comprehensive lexical network for French, English, German, Italian, and Spanish. It is based on componential semantics and lexical functions. The network structure superimposes two graphs. A first graph consists of a hierarchy of concepts divided into classes and themes where the words form the terminal nodes of the graph. A second graph links the words together using lexical functions derived from the Meaning-Text theory. We first introduce the lexical network whose database for French words is. comparable in its size to that of WordNet. We then describe two semantic distances to evaluate the proximity of two. words in the graph and to find their distinctive semantic components. Finally, we give examples of applications we developed with it: the search of a word from a definition and the extraction of the semantic features of a text.},
  author       = {Dutoit, D and Nugues, Pierre and de Torcy, P},
  booktitle    = {Lecture Notes in Computer Science (Computational Science and Its Applications – ICCSA 2003, Proceedings, Part I)},
  isbn         = {978-3-540-40155-1},
  issn         = {1611-3349},
  language     = {eng},
  pages        = {368--377},
  publisher    = {Springer},
  title        = {The integral dictionary: A lexical network based on componential semantics},
  url          = {http://dx.doi.org/10.1007/3-540-44839-X_40},
  volume       = {2667},
  year         = {2003},
}