Computer Processing of Relations Between Geographical Proper Names by Transitive Closure on a Boolean Matrix

O. Piton and D. Maurel

Papiers d'Economie Mathématique et Applications from Université Panthéon-Sorbonne (Paris 1)

Abstract: We present results of the project Prolex. The aim of the project is the automated analysis of proper names, especially a description of relations between different proper names in a French text. The effect of this work is to tag the text. The system currently works with geographical proper names (place names, derived adjectives and names of inhabitants) in French. It consists of a database containing specific types of proper names and relations between the different names. Using these names and relations, the program can group the proper names appearing in a text that may belong together (such as Beijing-Chinese-Pekinese-China ; American-United States-Wahington). This is done by constructing an association matrix between them and by computing the transitive closure of this Boolean matrix. The method is explained with an example.

Keywords: DATABASE; COMPUTERS; GEOGRAPHY (search for similar items in EconPapers)
JEL-codes: C81 C88 (search for similar items in EconPapers)
Pages: 11 pages
Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:fth:pariem:2000.70

Access Statistics for this paper

More papers in Papiers d'Economie Mathématique et Applications from Université Panthéon-Sorbonne (Paris 1) France; Universite de Paris I - Pantheon- Sorbonne, 12 Place de Pantheon-75005 Paris, France. Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel ().