HFST - Framework for Compiling and Applying Morphologies

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.

[1]  Borivoj Melichar,et al.  Finding Common Motifs with Gaps Using Finite Automata , 2006, CIAA.

[2]  Tommi A. Pirinen,et al.  Finite-State Spell-Checking with Weighted Language and Error Models : Building and Evaluating Spell-Checkers with Wikipedia as Corpus , 2010 .

[3]  Krister Lindén,et al.  HFST runtime format: A compacted transducer format allowing for fast lookup , 2009 .

[4]  Kemal Oflazer,et al.  Error-tolerant Finite-state Recognition with Applications to Morphological Analysis and Spelling Correction , 1995, CL.

[5]  Tommi A. Pirinen.  Modularisation of Finnish Finite-State Language Description - Towards Wide Collaboration in Open Source Development of a Morphological Analyser , 2011, NODALIDA.

[6]  Helmut Schmid,et al.  A Programming Language for Finite State Transducers , 2005, FSMNLP.

[7]  Christian Simon,et al.  Morphisto - An Open Source Morphological Analyzer for German , 2009, FSMNLP.

[8]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, & Tools with Gradiance , 2007 .

[9]  Lauri Karttunen.  Constructing Lexical Transducers , 1994, COLING.

[10]  Mans Hulden,et al.  Fast approximate string matching with finite automata , 2009 .

[11]  Rafael C. Carrasco,et al.  Incremental construction and maintenance of morphological analysers based on augmented letter transducers , 2002, TMI.

[12]  Kenneth R. Beesley.  Constraining Separated Morphotactic Dependencies in Finite-State Grammars , 1998 .

[13]  Janusz A. Brzozowski,et al.  Derivatives of Regular Expressions , 1964, JACM.

[14]  Krister Lindén,et al.  Combining Statistical Models for POS Tagging using Finite-State Calculus , 2011, NODALIDA.

[15]  Tommi A. Pirinen,et al.  Building and using existing hunspell dictionaries and TEX hyphenators as finite-state automata , 2010, Proceedings of the International Multiconference on Computer Science and Information Technology.

[16]  Johan Schalkwyk,et al.  OpenFst: A General and Efficient Weighted Finite-State Transducer Library , 2007, CIAA.

[17]  Krister Lindén,et al.  Conflict Resolution Using Weighted Rules in HFST-TWOLC , 2009, NODALIDA.

[18]  Mans Hulden.  Rápida búsqueda aproximada con autómatas de estado finito , 2009, Proces. del Leng. Natural.

[19]  Krister Lindén,et al.  Part-of-Speech Tagging Using Parallel Weighted Finite-State Transducers , 2010, IceTAL.

[20]  Lauri Karttunen,et al.  Finite State Morphology , 2003, CSLI Studies in Computational Linguistics.

[21]  Tommi A. Pirinen,et al.  HFST Tools for Morphology - An Efficient Open-Source Package for Construction of Morphological Analyzers , 2009, SFCM.

[22]  Christian Simon,et al.  Morphisto: Service-Oriented Open Source Morphology for German , 2009, SFCM.

[23]  Agata Savary.  Typographical Nearest-Neighbor Search in a Finite-State Lexicon and Its Application to Spelling Correction , 2001, CIAA.

[24]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

[25]  Michael Piotrowski,et al.  State of the Art in Computational Morphology - Workshop on Systems and Frameworks for Computational Morphology, SFCM 2009, Zurich, Switzerland, September 4, 2009. Proceedings , 2009, SFCM.