Andrea Sgarro
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Andrea Sgarro has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Laura Franzoi
University of Bucharest
5 shared publications - Liviu P. Dinu
Faculty of Mathematics and Computer Science ♣ Faculty of Foreign Languages and Literatures University of Bucharest ♡ HLT Research Center
3 shared publications - Francesco Fabris
Dept. of Mathematics, Informatics, and Geosciences, University of Trieste, Trieste, Italy
2 shared publications - Luca Bortolussi
University of Trieste
2 shared publications - Alessandro Tossi
Department of Life Sciences, University of Trieste, 34127 Trieste, Italy
1 shared publication Alina Maria Ciobanu
University of Bucharest
1 shared publication
Latest Publications
- Open Access
- 22 March 2021
- Published by The Royal Society in Philosophical Transactions of the Royal Society B: Biological Sciences
- Vol. 376 (1824) , 20200197
At the boundaries of syntactic prehistory
Can language relatedness be established without cognate words? This question has remained unresolved since the nineteenth century, leaving language prehistory beyond etymologically established families largely undefined. We address this problem through a theory of universal syntactic characters. We show that not only does syntax allow for comparison across distinct traditional language families, but that the probability of deeper historical relatedness between such families can be statistically tested through a dedicated algorithm which implements the concept of ‘possible languages’ suggested by a formal syntactic theory. Controversial clusters such as e.g. Altaic and Uralo-Altaic are significantly supported by our test, while other possible macro-groupings, e.g. Indo-Uralic or Basque-(Northeast) Caucasian, prove to be indistinguishable from a randomly generated distribution of language distances. These results suggest that syntactic diversity, modelled through a generative biolinguistic framework, can be used to provide a proof of historical relationship between different families irrespectively of the presence of a common lexicon from which regular sound correspondences can be determined; therefore, we argue that syntax may expand the time limits imposed by the classical comparative method. This article is part of the theme issue ‘Reconstructing prehistoric languages’.
- 22 March 2021
- Published by The Royal Society in Philosophical Transactions of the Royal Society B: Biological Sciences
- Vol. 376 (1824) , 20200197
Open AccessAt the boundaries of syntactic prehistory
Can language relatedness be established without cognate words? This question has remained unresolved since the nineteenth century, leaving language prehistory beyond etymologically established families largely undefined. We address this problem through a theory of universal syntactic characters. We show that not only does syntax allow for comparison across distinct traditional language families, but that the probability of deeper historical relatedness between such families can be statistically tested through a dedicated algorithm which implements the concept of ‘possible languages’ suggested by a formal syntactic theory. Controversial clusters such as e.g. Altaic and Uralo-Altaic are significantly supported by our test, while other possible macro-groupings, e.g. Indo-Uralic or Basque-(Northeast) Caucasian, prove to be indistinguishable from a randomly generated distribution of language distances. These results suggest that syntactic diversity, modelled through a generative biolinguistic framework, can be used to provide a proof of historical relationship between different families irrespectively of the presence of a common lexicon from which regular sound correspondences can be determined; therefore, we argue that syntax may expand the time limits imposed by the classical comparative method. This article is part of the theme issue ‘Reconstructing prehistoric languages’.
- 5 June 2020
- Published by Springer Nature
- Vol. 1239, 17-26
Random Steinhaus Distances for Robust Syntax-Based Classification of Partially Inconsistent Linguistic Data
We use the Steinhaus transform of metric distances to deal with inconsistency in linguistic classification. We focus on data due to G. Longobardi’s school: languages are represented through yes-no strings of length 53, each string position corresponding to a syntactic feature which can be present or absent. However, due to a complex network of logical implications which constrain features, some positions might be undefined (logically inconsistent). To take into account linguistic inconsistency, the distances we use are Steinhaus metric distances generalizing the normalized Hamming distance. To validate the robustness of classifications based on Longobardi’s data we resort to randomized transforms. Experimental results are provided and commented upon.
- 5 June 2020
- Published by Springer Nature
- Vol. 1239, 17-26
Random Steinhaus Distances for Robust Syntax-Based Classification of Partially Inconsistent Linguistic Data
We use the Steinhaus transform of metric distances to deal with inconsistency in linguistic classification. We focus on data due to G. Longobardi’s school: languages are represented through yes-no strings of length 53, each string position corresponding to a syntactic feature which can be present or absent. However, due to a complex network of logical implications which constrain features, some positions might be undefined (logically inconsistent). To take into account linguistic inconsistency, the distances we use are Steinhaus metric distances generalizing the normalized Hamming distance. To validate the robustness of classifications based on Longobardi’s data we resort to randomized transforms. Experimental results are provided and commented upon.
- 10 October 2018
- Published by Springer Nature
- p. 576-590
Towards a Map of the Syntactic Similarity of Languages
- 10 October 2018
- Published by Springer Nature
- p. 576-590
Towards a Map of the Syntactic Similarity of Languages
- 18 May 2018
- Published by Springer Nature
- p. 171-182
Steinhaus Transforms of Fuzzy String Distances in Computational Linguistics
- 18 May 2018
- Published by Springer Nature
- p. 171-182
Steinhaus Transforms of Fuzzy String Distances in Computational Linguistics
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Fuzzy hamming distinguishability
Back in 1967 the Croat linguist Ž. Muljačić had used a fuzzy generalization of the Hamming distance between binary strings to classify Romance languages. In 1956 Cl. Shannon had introduced the notion of codeword distinguishability in zero-error information theory. Distance and distinguishability are subtly different notions, even if, with distances as those usually met in coding theory (ruling out zero-error information theory, which is definitely non-metric), the need for string distinguishabilities evaporates, since the distinguishability turns out to be an obvious and trivial function of the distance. Fuzzy Hamming distinguishabilities derived from Muljačić distances, instead, are quite relevant and must be considered explicitly. They are very easy to compute, however, and we show how they could be applied in coding theory to channels with erasures and blurs. Fuzzy Hamming distinguishabilities appear to be quite a promising tool to extend Muljačić approach from linguistic classification to linguistic evolution.
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Fuzzy hamming distinguishability
Back in 1967 the Croat linguist Ž. Muljačić had used a fuzzy generalization of the Hamming distance between binary strings to classify Romance languages. In 1956 Cl. Shannon had introduced the notion of codeword distinguishability in zero-error information theory. Distance and distinguishability are subtly different notions, even if, with distances as those usually met in coding theory (ruling out zero-error information theory, which is definitely non-metric), the need for string distinguishabilities evaporates, since the distinguishability turns out to be an obvious and trivial function of the distance. Fuzzy Hamming distinguishabilities derived from Muljačić distances, instead, are quite relevant and must be considered explicitly. They are very easy to compute, however, and we show how they could be applied in coding theory to channels with erasures and blurs. Fuzzy Hamming distinguishabilities appear to be quite a promising tool to extend Muljačić approach from linguistic classification to linguistic evolution.
- 11 June 2016
- Published by Springer Nature in Communications in Computer and Information Science
- p. 3-11
(Ir)relevant T-norm Joint Distributions in the Arithmetic of Fuzzy Quantities
- 11 June 2016
- Published by Springer Nature in Communications in Computer and Information Science
- p. 3-11
(Ir)relevant T-norm Joint Distributions in the Arithmetic of Fuzzy Quantities
- Open Access
- 27 January 2014
- Published by Wiley in Computational and Mathematical Methods in Medicine
- Vol. 2014, 1-9
Differentiating Small (≤1 cm) Focal Liver Lesions as Metastases or Cysts by means of Computed Tomography: A Case-Study to Illustrate a Fuzzy Logic-Based Method to Assess the Impact of Diagnostic Confidence on Radiological Diagnosis
Purpose. To quantify the impact of diagnostic confidence on radiological diagnosis with a fuzzy logic-based method.Materials and Methods. Twenty-two oncologic patients with 20 cysts and 30 metastases ≤1 cm in size found at 64-row computed tomography were included. Two readers (R1/R2) expressed diagnoses as a subjective level of confidencein malignancy within the interval [0,1] rather than on a “crisp” basis (malignant/benign); confidence in benignancy was. When cross-tabulating data according to the standard of reference,table cells resulted from the aggregation betweenand final diagnosis. We then assessed (i) readers diagnostic performance on a fuzzy and crisp basis; (ii) the “divergence”(%) as a measure of how confidence impacted on crisp diagnosis.Results. Diagnoses expressed with lower confidence increased fuzzy false positives compared to crisp ones (from 0 to 0.2 for R1; from 1 to 2.4 for R2). Crisp/fuzzy accuracy was 94.0%/93.6% (R1) and 94.0/91.6% (R2).(%) was larger in the case of the less experienced reader (R2) (up to +7.95% for specificity). According to simulations,(%) was negative/positive depending on the level of confidence in incorrect diagnoses.Conclusion.Fuzzy evaluation shows a measurable effect of uncertainty on radiological diagnoses.- 27 January 2014
- Published by Wiley in Computational and Mathematical Methods in Medicine
- Vol. 2014, 1-9
Open AccessDifferentiating Small (≤1 cm) Focal Liver Lesions as Metastases or Cysts by means of Computed Tomography: A Case-Study to Illustrate a Fuzzy Logic-Based Method to Assess the Impact of Diagnostic Confidence on Radiological Diagnosis
Purpose. To quantify the impact of diagnostic confidence on radiological diagnosis with a fuzzy logic-based method.Materials and Methods. Twenty-two oncologic patients with 20 cysts and 30 metastases ≤1 cm in size found at 64-row computed tomography were included. Two readers (R1/R2) expressed diagnoses as a subjective level of confidencein malignancy within the interval [0,1] rather than on a “crisp” basis (malignant/benign); confidence in benignancy was. When cross-tabulating data according to the standard of reference,table cells resulted from the aggregation betweenand final diagnosis. We then assessed (i) readers diagnostic performance on a fuzzy and crisp basis; (ii) the “divergence”(%) as a measure of how confidence impacted on crisp diagnosis.Results. Diagnoses expressed with lower confidence increased fuzzy false positives compared to crisp ones (from 0 to 0.2 for R1; from 1 to 2.4 for R2). Crisp/fuzzy accuracy was 94.0%/93.6% (R1) and 94.0/91.6% (R2).(%) was larger in the case of the less experienced reader (R2) (up to +7.95% for specificity). According to simulations,(%) was negative/positive depending on the level of confidence in incorrect diagnoses.Conclusion.Fuzzy evaluation shows a measurable effect of uncertainty on radiological diagnoses. - 1 January 2012
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 118 (3) , 245-252
Spearman Permutation Distances and Shannon's Distinguishability
Spearman distance is a permutation distance which might be used for codes in permutations beside Kendall distance. However, Spearman distance gives rise to a geometry of strings, which is rather unruly from the point of view of error correction and error detection. Special care has to be taken to discriminate between the two notions of codeword distance and codeword distinguishability. This stresses the importance of rejuvenating the latter notion, extending it from Shannon's zero-error information theory to the more general setting of metric string distances.
- 1 January 2012
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 118 (3) , 245-252
Spearman Permutation Distances and Shannon's Distinguishability
Spearman distance is a permutation distance which might be used for codes in permutations beside Kendall distance. However, Spearman distance gives rise to a geometry of strings, which is rather unruly from the point of view of error correction and error detection. Special care has to be taken to discriminate between the two notions of codeword distance and codeword distinguishability. This stresses the importance of rejuvenating the latter notion, extending it from Shannon's zero-error information theory to the more general setting of metric string distances.
- 1 January 2010
- Published by Springer Nature
- p. 41-48
Possibilistic Coding: Error Detection vs. Error Correction
- 1 January 2010
- Published by Springer Nature
- p. 41-48
Possibilistic Coding: Error Detection vs. Error Correction