Using HFST—Helsinki Finite-State Technology for Recognizing Semantic Frames

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussaKirjan luku tai artikkeliTieteellinenvertaisarvioitu

Kuvaus

To recognize semantic frames in languages with a rich morphology, we need computational morphology. In this paper, we look at one particular framework, HFST–Helsinki Finite-State Technology, and how to use it for recognizing semantic frames in context. HFST enables tokenization, morphological analysis, tagging, and frame annotation in one single framework.
Alkuperäiskielienglanti
OtsikkoSystems and Frameworks for Computational Morphology
Sivumäärä13
Kustantaja Springer International Publishing AG
Julkaisupäivä9 joulukuuta 2015
Sivut124-136
ISBN (painettu)978-3-319-23978-1
ISBN (elektroninen)978-3-319-23980-4
DOI - pysyväislinkit
TilaJulkaistu - 9 joulukuuta 2015
OKM-julkaisutyyppiA3 Kirjan tai muun kokoomateoksen osa

Julkaisusarja

NimiCommunications in Computer and Information Science
KustantajaSpringer International Publishing
Vuosikerta537
ISSN (painettu)1865-0929

Tieteenalat

  • 113 Tietojenkäsittely- ja informaatiotieteet
  • 6121 Kielitieteet

Lainaa tätä

Lindén, K., Hardwick, S., Silfverberg, M., & Axelson, E. (2015). Using HFST—Helsinki Finite-State Technology for Recognizing Semantic Frames. teoksessa Systems and Frameworks for Computational Morphology (Sivut 124-136). (Communications in Computer and Information Science; Vuosikerta 537). Springer International Publishing AG. https://doi.org/10.1007/978-3-319-23980-4_8
Lindén, Krister ; Hardwick, Sam ; Silfverberg, Miikka ; Axelson, Erik. / Using HFST—Helsinki Finite-State Technology for Recognizing Semantic Frames. Systems and Frameworks for Computational Morphology. Springer International Publishing AG, 2015. Sivut 124-136 (Communications in Computer and Information Science).
@inbook{634bbe8bb18d4089aacb696a3a3b171f,
title = "Using HFST—Helsinki Finite-State Technology for Recognizing Semantic Frames",
abstract = "To recognize semantic frames in languages with a rich morphology, we need computational morphology. In this paper, we look at one particular framework, HFST–Helsinki Finite-State Technology, and how to use it for recognizing semantic frames in context. HFST enables tokenization, morphological analysis, tagging, and frame annotation in one single framework.",
keywords = "113 Computer and information sciences, 6121 Languages",
author = "Krister Lind{\'e}n and Sam Hardwick and Miikka Silfverberg and Erik Axelson",
year = "2015",
month = "12",
day = "9",
doi = "10.1007/978-3-319-23980-4_8",
language = "English",
isbn = "978-3-319-23978-1",
series = "Communications in Computer and Information Science",
publisher = "Springer International Publishing AG",
pages = "124--136",
booktitle = "Systems and Frameworks for Computational Morphology",
address = "Switzerland",

}

Lindén, K, Hardwick, S, Silfverberg, M & Axelson, E 2015, Using HFST—Helsinki Finite-State Technology for Recognizing Semantic Frames. julkaisussa Systems and Frameworks for Computational Morphology. Communications in Computer and Information Science, Vuosikerta 537, Springer International Publishing AG, Sivut 124-136. https://doi.org/10.1007/978-3-319-23980-4_8

Using HFST—Helsinki Finite-State Technology for Recognizing Semantic Frames. / Lindén, Krister; Hardwick, Sam; Silfverberg, Miikka; Axelson, Erik.

Systems and Frameworks for Computational Morphology. Springer International Publishing AG, 2015. s. 124-136 (Communications in Computer and Information Science; Vuosikerta 537).

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussaKirjan luku tai artikkeliTieteellinenvertaisarvioitu

TY - CHAP

T1 - Using HFST—Helsinki Finite-State Technology for Recognizing Semantic Frames

AU - Lindén, Krister

AU - Hardwick, Sam

AU - Silfverberg, Miikka

AU - Axelson, Erik

PY - 2015/12/9

Y1 - 2015/12/9

N2 - To recognize semantic frames in languages with a rich morphology, we need computational morphology. In this paper, we look at one particular framework, HFST–Helsinki Finite-State Technology, and how to use it for recognizing semantic frames in context. HFST enables tokenization, morphological analysis, tagging, and frame annotation in one single framework.

AB - To recognize semantic frames in languages with a rich morphology, we need computational morphology. In this paper, we look at one particular framework, HFST–Helsinki Finite-State Technology, and how to use it for recognizing semantic frames in context. HFST enables tokenization, morphological analysis, tagging, and frame annotation in one single framework.

KW - 113 Computer and information sciences

KW - 6121 Languages

U2 - 10.1007/978-3-319-23980-4_8

DO - 10.1007/978-3-319-23980-4_8

M3 - Chapter

SN - 978-3-319-23978-1

T3 - Communications in Computer and Information Science

SP - 124

EP - 136

BT - Systems and Frameworks for Computational Morphology

PB - Springer International Publishing AG

ER -

Lindén K, Hardwick S, Silfverberg M, Axelson E. Using HFST—Helsinki Finite-State Technology for Recognizing Semantic Frames. julkaisussa Systems and Frameworks for Computational Morphology. Springer International Publishing AG. 2015. s. 124-136. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-319-23980-4_8