Department of Modern Languages 2014 Weighted Finite-State Methods for Spell-Checking and Correction Tommi A Pirinen Academic dissertation to be publicly discussed, by due permission of the Fac- ulty of Arts at the University of Helsinki in auditorium XII (in lecture room PIII), on the 28th of February at 12 o’clock. University of Helsinki Finland Supervisor Krister Lindén, Helsingin yliopisto, Finland Pre-examiners Prof. Mikel L. Forcada, Universitat d’Alacant, Spain Prof. Lars Borin, Göteborgs universitet, Sweden Opponent Prof. Lars Borin, Göteborgs universitet, Sweden Custos Prof. Lauri Carlson, Helsingin yliopisto, Finland Contact information Department of Modern Languages P.O. Box 24 (Unioninkatu 40) FI-00014 University of Helsinki Finland Email address:
[email protected] URL: http://www.helsinki.fi/ Telephone: +358 9 1911, telefax: +358 9 191 51120 Copyright © 2014 Tommi A Pirinen http://creativecommons.org/licenses/by-nc-nd/3.0/deed ISBN 978-952-10-9694-5 (printed) ISBN 978-952-10-9695-2 (PDF) Computing Reviews (1998) Classification: F.1.1, I.2.7, I.7.1 Helsinki 2014 Picaset Oy Weighted Finite-State Methods for Spell-Checking and Correction Tommi A Pirinen Department of Modern Languages P.O. Box 24, FI-00014 University of Helsinki, Finland
[email protected] http://www.helsinki.fi/%7etapirine PhD Thesis, Series of Publications, 2014 Helsinki, January 2014, 94 pages ISBN 978-952-10-9694-5 (printed) ISBN 978-952-10-9695-2 (PDF) Abstract This dissertation is a large-scale study of spell-checking and correction using finite-state technology. Finite-state spell-checking is a key method for handling morphologically complex languages in a computationally efficient manner.