Modelling distances between genetically related languages using an extended weighted Levenshtein distance
- Authors: Paluncic, F. , Ferreira, Hendrik C. , Swart, Theo G. , Clarke, W. A.
- Date: 2009
- Subjects: Levenshtein distance , Insertion/deletion
- Language: English
- Type: Abstract
- Identifier: http://hdl.handle.net/10210/21309 , uj:16139 , ISSN: 1607-3614 , DOI: 10.2989/SALALS.2009.27.4.2.1022 , Citation: Paluncic, F. et al. 2009. Modelling distances between genetically related languages using an extended weighted Levenshtein distance. Southern African Linguistics and Applied Language Studies Journal, 27(4):381-389. DOI: 10.2989/SALALS.2009.27.4.2.1022.
- Description: Abstract: This article proposes the use of an extended weighted Levenshtein distance to model the time depth between parent and direct descendant languages and also the dialectal separation between sibling languages. The parent language is usually a proto-language, a hypothetical reconstructed language, whose precise date is usually conjectural. Phonology is used as an indicator of language difference, which is modelled by means of an extended weighted Levenshtein distance. This idea is applied specifically to the Iranian language family.
- Full Text:
A note on non-binary multiple insertion/deletion correcting codes
- Authors: Paluncic, Filip , Swart, Theo G. , Weber, Jos H. , Ferreira, Hendrik C. , Clarke, Willem A.
- Date: 2011
- Subjects: Insertion/deletion , Correcting codes
- Language: English
- Type: Conference proceedings
- Identifier: http://hdl.handle.net/10210/20202 , uj:16077 , ISBN: 978-1-4577-0437-6 , Citation: Paluncic, F. et al. 2011. A note on non-binary multiple insertion/deletion correcting codes. Proceedings of the IEEE Information Theory Workshop, 16-20 October, 2011, Paraty, Brazil.
- Description: Abstract: We propose the construction of a non-binary multiple insertion/deletion correcting code based on a binary multiple insertion/deletion correcting code. In essence, it is a generalisation of Tenengol’ts’ non-binary single insertion/deletion correcting code. We evaluate the cardinality of the proposed construction based on the asymptotic upper bound on the cardinality of a maximal binary multiple insertion/deletion correcting code derived by Levenshtein.
- Full Text: