Building and Using Existing Hunspell Dictionaries and TEX Hyphenators as Finite-State Automata

Tommi Pirinen; Krister Linden

Building and Using Existing Hunspell Dictionaries and TEX Hyphenators as Finite-State Automata

Institutionen för moderna språk 2010-2017

Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review

Sammanfattning

There are numerous formats for writing spellcheckers for open-source systems and there are many descriptions for languages written in these formats. Similarly, for word hyphenation by computer there are TEX rules for many languages. In this paper we demonstrate a method for converting these spell-checking lexicons and hyphenation rule sets into finite-state automata, and present a new finite-state based system for writer’s tools used in current open-source software such as Firefox, OpenOffice.org and enchant via the spell-checking library voikko.

Originalspråk	engelska
Titel på gästpublikation	Proceedings of International Multiconference on Computer Science and Information Technology : Computational Linguistics—Applications (CLA'10 )
Redaktörer	Maria Ganzha, Marcin Paprzycki
Antal sidor	8
Volym	5
Utgivningsort	Wisla, Poland
Utgivningsdatum	okt 2010
Sidor	477–484
ISBN (elektroniskt)	978-83-60810-27-9
Status	Publicerad - okt 2010
MoE-publikationstyp	A4 Artikel i en konferenspublikation
Evenemang	International Multiconference on Computer Science and Information Technology - Wisła, Polen Varaktighet: 18 okt 2010 → 20 okt 2010 Konferensnummer: 5

Publikationsserier

Namn	Proceedings of the International Multiconference on Computer Science and Information Technology
Förlag	Polskie Towarzystwo Informatyczne Oddział Górnoslaski
ISSN (elektroniskt)	1896-7094

Vetenskapsgrenar

113 Data- och informationsvetenskap
612 Språk och litteratur

Åtkomst av dokument

Pirinen cla 2010Inskickat manuskript, 206 KB

1 Aktiv

HFST - Helsinki Finite-State Technology
Linden, K., Koskenniemi, K., Yli-Jyrä, A., Hulden, M., Silfverberg, M., Pirinen, T., Axelson, E., Hardwick, S., Niemi, J. & Hurskainen, A.
01/01/2005 → …
Projekt: Forskningsprojekt

Citera det här

Pirinen, T., & Linden, K. (2010). Building and Using Existing Hunspell Dictionaries and TEX Hyphenators as Finite-State Automata. I M. Ganzha, & M. Paprzycki (Red.), Proceedings of International Multiconference on Computer Science and Information Technology: Computational Linguistics—Applications (CLA'10 ) (Vol. 5, s. 477–484). (Proceedings of the International Multiconference on Computer Science and Information Technology)..

Pirinen, Tommi ; Linden, Krister. / Building and Using Existing Hunspell Dictionaries and TEX Hyphenators as Finite-State Automata. Proceedings of International Multiconference on Computer Science and Information Technology: Computational Linguistics—Applications (CLA'10 ). redaktör / Maria Ganzha ; Marcin Paprzycki. Vol. 5 Wisla, Poland, 2010. s. 477–484 (Proceedings of the International Multiconference on Computer Science and Information Technology).

@inproceedings{3844868d0aa24989a6b3f0f97c31150a,

title = "Building and Using Existing Hunspell Dictionaries and TEX Hyphenators as Finite-State Automata",

abstract = "There are numerous formats for writing spellcheckers for open-source systems and there are many descriptions for languages written in these formats. Similarly, for word hyphenation by computer there are TEX rules for many languages. In this paper we demonstrate a method for converting these spell-checking lexicons and hyphenation rule sets into finite-state automata, and present a new finite-state based system for writer{\textquoteright}s tools used in current open-source software such as Firefox, OpenOffice.org and enchant via the spell-checking library voikko.",

keywords = "113 Computer and information sciences, 612 Languages and Literature",

author = "Tommi Pirinen and Krister Linden",

note = " Volume: 5 Proceeding volume: 5; International Multiconference on Computer Science and Information Technology ; Conference date: 18-10-2010 Through 20-10-2010",

year = "2010",

month = oct,

language = "English",

volume = "5",

series = "Proceedings of the International Multiconference on Computer Science and Information Technology",

publisher = "Polskie Towarzystwo Informatyczne Oddzia{\l} G{\'o}rnoslaski",

pages = "477–484",

editor = "Maria Ganzha and Marcin Paprzycki",

booktitle = "Proceedings of International Multiconference on Computer Science and Information Technology",

}

Pirinen, T & Linden, K 2010, Building and Using Existing Hunspell Dictionaries and TEX Hyphenators as Finite-State Automata. i M Ganzha & M Paprzycki (red), Proceedings of International Multiconference on Computer Science and Information Technology: Computational Linguistics—Applications (CLA'10 ). vol. 5, Proceedings of the International Multiconference on Computer Science and Information Technology, Wisla, Poland, s. 477–484, International Multiconference on Computer Science and Information Technology, Wisła, Polen, 18/10/2010.

Building and Using Existing Hunspell Dictionaries and TEX Hyphenators as Finite-State Automata. / Pirinen, Tommi; Linden, Krister.

Proceedings of International Multiconference on Computer Science and Information Technology: Computational Linguistics—Applications (CLA'10 ). red. / Maria Ganzha; Marcin Paprzycki. Vol. 5 Wisla, Poland, 2010. s. 477–484 (Proceedings of the International Multiconference on Computer Science and Information Technology).

Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review

TY - GEN

T1 - Building and Using Existing Hunspell Dictionaries and TEX Hyphenators as Finite-State Automata

AU - Pirinen, Tommi

AU - Linden, Krister

N1 - Conference code: 5

PY - 2010/10

Y1 - 2010/10

N2 - There are numerous formats for writing spellcheckers for open-source systems and there are many descriptions for languages written in these formats. Similarly, for word hyphenation by computer there are TEX rules for many languages. In this paper we demonstrate a method for converting these spell-checking lexicons and hyphenation rule sets into finite-state automata, and present a new finite-state based system for writer’s tools used in current open-source software such as Firefox, OpenOffice.org and enchant via the spell-checking library voikko.

AB - There are numerous formats for writing spellcheckers for open-source systems and there are many descriptions for languages written in these formats. Similarly, for word hyphenation by computer there are TEX rules for many languages. In this paper we demonstrate a method for converting these spell-checking lexicons and hyphenation rule sets into finite-state automata, and present a new finite-state based system for writer’s tools used in current open-source software such as Firefox, OpenOffice.org and enchant via the spell-checking library voikko.

KW - 113 Computer and information sciences

KW - 612 Languages and Literature

M3 - Conference contribution

VL - 5

T3 - Proceedings of the International Multiconference on Computer Science and Information Technology

SP - 477

EP - 484

BT - Proceedings of International Multiconference on Computer Science and Information Technology

A2 - Ganzha, Maria

A2 - Paprzycki, Marcin

CY - Wisla, Poland

T2 - International Multiconference on Computer Science and Information Technology

Y2 - 18 October 2010 through 20 October 2010

ER -

Pirinen T, Linden K. Building and Using Existing Hunspell Dictionaries and TEX Hyphenators as Finite-State Automata. I Ganzha M, Paprzycki M, redaktörer, Proceedings of International Multiconference on Computer Science and Information Technology: Computational Linguistics—Applications (CLA'10 ). Vol. 5. Wisla, Poland. 2010. s. 477–484. (Proceedings of the International Multiconference on Computer Science and Information Technology).

Building and Using Existing Hunspell Dictionaries and TEX Hyphenators as Finite-State Automata

Sammanfattning

Publikationsserier

Vetenskapsgrenar

Åtkomst av dokument

HFST - Helsinki Finite-State Technology

Citera det här