Rank Distance with Applications in Similarity of Natural Languages

Authors:
Liviu P. Dinu
Affiliations:
Bucharest University, Faculty of Mathematics, Academiei 14, RO-70109, Bucharest, Romania. ldinu@funinf.cs.unibuc.ro
Venue:
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Year:
2004

Citing 5
Cited 1

A Metric Between Unrooted and Unordered Trees and its Bottom-Up Computing Method

IEEE Transactions on Pattern Analysis and Machine Intelligence
Alignment of trees: an alternative to tree edit

Theoretical Computer Science
Foundations of statistical natural language processing

Foundations of statistical natural language processing
Comparing and aggregating rankings with ties

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing with Words in Information/Intelligent Systems 2: Applications

Computing with Words in Information/Intelligent Systems 2: Applications

A Generalization of the Assignment Problem, and its Application to the Rank Aggregation Problem

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a metric for measuring the similarity between two classifications which differ by their constitutive elements. Our measure is inspired from natural language and genomics where the most important information is carried by the first part of the unit. We extend the measure to words and to rooted (un)labelled general trees. We use this metric to analyze the syllabic similarity of Romance languages.