``Beijing Frowns and Washington Pays Close Attention'' Computer Processing of Relations between Geographical Proper Names in Foreign Affairs

Authors:
Odile Piton;Denis Maurel
Affiliations:
-;-
Venue:
NLDB '00 Proceedings of the 5th International Conference on Applications of Natural Language to Information Systems-Revised Papers
Year:
2000

Citing 5
Cited 2

Internal and external evidence in the identification and semantic categorization of proper names

Corpus processing for lexical acquisition
Identifying unknown proper names in newswire text

Corpus processing for lexical acquisition
Categorizing and standardizing proper nouns for efficient information retrieval

Corpus processing for lexical acquisition
Finite-State Language Processing

Finite-State Language Processing
The typology of unknown words: an experimental study of two corpora

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1

E-connecting Balkan languages

MRTECEEL '09 Proceedings of the Workshop on Multilingual Resources, Technologies and Evaluation for Central and Eastern European Languages
Towards an XML representation of proper names and their relationships

NLDB'05 Proceedings of the 10th international conference on Natural Language Processing and Information Systems

Quantified Score

Hi-index	0.00

Visualization

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 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-Washington). 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.