Please use this identifier to cite or link to this item:
http://hdl.handle.net/10077/4105
Title: | Hamming-like Distances for Ill-defined Strings in Linguistic Classification | Authors: | Bortolussi, Luca Sgarro, Andrea |
Keywords: | String Distances; Hamming Distance; Fuzzy Distances; Computational Linguistics; Linguistic Classification; Incomplete Knowledge | Issue Date: | 2007 | Publisher: | EUT Edizioni Università di Trieste | Source: | Luca Bortolussi, Andrea Sgarro, "Hamming-like Distances for Ill-defined Strings in Linguistic Classification”, in: Rendiconti dell’Istituto di Matematica dell’Università di Trieste. An International Journal of Mathematics, 39 (2007), pp. 105-118. | Series/Report no.: | Rendiconti dell’Istituto di Matematica dell’Università di Trieste. An International Journal of Mathematics 39 (2007) |
Abstract: | Ill-defined strings often occur in soft sciences, e.g. in linguistics or in biology. In this paper we consider \ell-length strings which have in each position one of the three symbols 0 or false, 1 or true, \flat or irrelevant. We tackle some generalisations of the usual Hamming distance between binary crisp strings which were recently used in computational linguistics. We comment on their metric properties, since these should guide the selection of the clustering algorithm to be used for language classification. The concluding section is devoted to future work, and the string approach, as currently pursued, is compared to alternative approaches. |
Type: | Article | URI: | http://hdl.handle.net/10077/4105 | ISSN: | 0049-4704 |
Appears in Collections: | Rendiconti dell'Istituto di Matematica dell'Università di Trieste: an International Journal of Mathematics vol.39 (2007) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
BortolussiSgarroRendMat39.pdf | 136.66 kB | Adobe PDF | ![]() View/Open |
CORE Recommender
Page view(s) 20
1,024
checked on Jun 28, 2022
Download(s) 50
547
checked on Jun 28, 2022
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.