Options
Hamming-like Distances for Ill-defined Strings in Linguistic Classification
Bortolussi, Luca
Sgarro, Andrea
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.
Series
Rendiconti dell’Istituto di Matematica dell’Università di Trieste. An International Journal of Mathematics
39 (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.
Languages
en
File(s)