Skip navigation
Skip navigation

Levenshtein distances fail to identify language relationships accurately

Greenhill, Simon


The Levenshtein distance is a simple distance metric derived from the number of edit operations needed to transform one string into another. This metric has received recent attention as a means of automatically classifying languages into genealogical subgroups. In this article I test the performance of the Levenshtein distance for classifying languages by subsampling three language subsets from a large database of Austronesian languages. Comparing the classification proposed by the Levenshtein...[Show more]

CollectionsANU Research Publications
Date published: 2011
Type: Journal article
Source: Computational Linguistics
Access Rights: Open Access


File Description SizeFormat Image
01_Greenhill_Levenshtein_distances_fail_to_2011.pdf131.38 kBAdobe PDF

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator