Computer Processing of Relations Between Geographical Proper Names by Transitive Closure on a Boolean Matrix
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.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||2000|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: + 33 44 07 81 00
Fax: + 33 1 44 07 83 01
Web page: http://cermsem.univ-paris1.fr/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:fth:pariem:2000.70. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.