Finite-state Relations Between Two Historically Closely Related Languages

Show simple item record

dc.contributor.author Koskenniemi, Kimmo
dc.contributor.editor Eyþórsson, Þórhallur
dc.contributor.editor Borin, Lars
dc.contributor.editor Haug, Dag
dc.contributor.editor Rögnvaldsson, Eirikur
dc.date.accessioned 2013-11-27T11:07:00Z
dc.date.available 2013-11-27T11:07:00Z
dc.date.issued 2013
dc.identifier.citation Koskenniemi , K 2013 , Finite-state Relations Between Two Historically Closely Related Languages . in Þ Eyþórsson , L Borin , D Haug & E Rögnvaldsson (eds) , Proceedings of the workshop on computational historical linguistics at NODALIDA 2013 . NEALT Proceedings Series , vol. 18 , Northern European Association for Language Technology , Linköping , pp. 43-53 , Workshop on Computational Historical Linguistics, NODALIDA 2013 , Oslo , Norway , 22/05/2013 . < http://www.ep.liu.se/ecp/087/ecp13087.pdf >
dc.identifier.citation conference
dc.identifier.other PURE: 30040294
dc.identifier.other PURE UUID: 7747b40c-d780-41ea-b04d-6a334a8da3ac
dc.identifier.other ORCID: /0000-0002-0061-9714/work/29573851
dc.identifier.uri http://hdl.handle.net/10138/42176
dc.description.abstract Regular correspondences between historically related languages can be modelled using finite-state transducers (FST). A new method is presented by demonstrating it with a bidirectional experiment between Finnish and Estonian. An artificial representation (resembling a proto-language) is established between two related languages. This representation, AFE (Aligned Finnish-Estonian) is based on the letter by letter alignment of the two languages and uses mechanically constructed morphophonemes which represent the corresponding characters. By describing the constraints of this AFE using two-level rules, one may construct useful mappings between the languages. In this way, the badly ambiguous FSTs from Finnish and Estonian to AFE can be composed into a practically unambiguous transducer from Finnish to Estonian. The inverse mapping from Estonian to Finnish is mildly ambiguous. Steps according to the proposed method could be repeated as such with dialectal or older written texts. Choosing a set of model words, aligning them, recording the mechanical correspondences and designing rules for the constraints could be done with a limited effort. For the purposes of indexing and searching, the mild ambiguity may be tolerable as such. The ambiguity can be further reduced by composing the resulting FST with a speller or morphological analyser of the standard language. en
dc.format.extent 11
dc.language.iso eng
dc.publisher Northern European Association for Language Technology
dc.relation.ispartof Proceedings of the workshop on computational historical linguistics at NODALIDA 2013
dc.relation.ispartofseries NEALT Proceedings Series
dc.relation.isversionof 978-91-7519-587-2
dc.rights.uri info:eu-repo/semantics/openAccess
dc.subject 6121 Languages
dc.subject finite-state transducers
dc.subject historical linguistics
dc.subject HFST
dc.subject two-level morphology
dc.subject FOMA
dc.title Finite-state Relations Between Two Historically Closely Related Languages en
dc.type Conference contribution
dc.contributor.organization Department of Modern Languages 2010-2017
dc.description.reviewstatus Peer reviewed
dc.relation.issn 1650-3686
dc.rights.accesslevel openAccess
dc.type.version publishedVersion
dc.identifier.url http://www.ep.liu.se/ecp/087/ecp13087.pdf

Files in this item

Total number of downloads: Loading...

Files Size Format View
ecp1387004.pdf 149.3Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record