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

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

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.
Original languageEnglish
Title of host publicationSystems and Frameworks for Computational Morphology
Number of pages13
PublisherSpringer International Publishing AG
Publication date9 Dec 2015
Pages124-136
ISBN (Print)978-3-319-23978-1
ISBN (Electronic)978-3-319-23980-4
DOIs
Publication statusPublished - 9 Dec 2015
MoE publication typeA3 Book chapter

Publication series

NameCommunications in Computer and Information Science
PublisherSpringer International Publishing
Volume537
ISSN (Print)1865-0929

Fields of Science

  • 113 Computer and information sciences
  • 6121 Languages

Cite this

Lindén, K., Hardwick, S., Silfverberg, M., & Axelson, E. (2015). Using HFST—Helsinki Finite-State Technology for Recognizing Semantic Frames. In Systems and Frameworks for Computational Morphology (pp. 124-136). (Communications in Computer and Information Science; Vol. 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. pp. 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. in Systems and Frameworks for Computational Morphology. Communications in Computer and Information Science, vol. 537, Springer International Publishing AG, pp. 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. p. 124-136 (Communications in Computer and Information Science; Vol. 537).

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

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. In Systems and Frameworks for Computational Morphology. Springer International Publishing AG. 2015. p. 124-136. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-319-23980-4_8