HFST—Framework for Compiling and Applying Morphologies

  • Krister Lindén
  • Erik Axelson
  • Sam Hardwick
  • Tommi A. Pirinen
  • Miikka Silfverberg
Conference paper

DOI: 10.1007/978-3-642-23138-4_5

Part of the Communications in Computer and Information Science book series (CCIS, volume 100)
Cite this paper as:
Lindén K., Axelson E., Hardwick S., Pirinen T.A., Silfverberg M. (2011) HFST—Framework for Compiling and Applying Morphologies. In: Mahlow C., Piotrowski M. (eds) Systems and Frameworks for Computational Morphology. SFCM 2011. Communications in Computer and Information Science, vol 100. Springer, Berlin, Heidelberg

Abstract

HFST–Helsinki Finite-State Technology (hfst.sf.net) is a framework for compiling and applying linguistic descriptions with finite-state methods. HFST currently connects some of the most important finite-state tools for creating morphologies and spellers into one open-source platform and supports extending and improving the descriptions with weights to accommodate the modeling of statistical information. HFST offers a path from language descriptions to efficient language applications in key environments and operating systems. HFST also provides an opportunity to exchange transducers between different software providers in order to get the best out of each finite-state library.

Keywords

Finite-state libraries finite-state morphology natural language applications 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Krister Lindén
    • 1
  • Erik Axelson
    • 1
  • Sam Hardwick
    • 1
  • Tommi A. Pirinen
    • 1
  • Miikka Silfverberg
    • 1
  1. 1.Department of Modern LanguagesUniversity of HelsinkiHelsinginFinland

Personalised recommendations