Abstract
Our demo presents work from a joint project with a twofold goal: To build a parser and disambiguator for North and Lule Sámi, and to make a practical spell-checker for the same languages. The core analyser is written with the Xerox tools twolc, lexc and fst ([1]), and the disambiguator uses constraint grammar (vislcg). Cf. [2] for a presentation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Beesley, K.R., Karttunen, L.: Finite State Morphology. Studies in Computational Linguistics. CSLI Publications, Stanford (2003)
Trosterud, T.: Samisk språkteknologi. Nordisk sprogteknologi - Årbog for Nordisk Sprogteknologisk Forskningsprogram 2000-2004 3, 51–58 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gaup, B., Moshagen, S., Omma, T., Palismaa, M., Pieski, T., Trosterud, T. (2006). From Xerox to Aspell: A First Prototype of a North Sámi Speller Based on TWOL Technology. In: Yli-Jyrä, A., Karttunen, L., Karhumäki, J. (eds) Finite-State Methods and Natural Language Processing. FSMNLP 2005. Lecture Notes in Computer Science(), vol 4002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780885_37
Download citation
DOI: https://doi.org/10.1007/11780885_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35467-3
Online ISBN: 978-3-540-35469-7
eBook Packages: Computer ScienceComputer Science (R0)