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

Show full item record



Permalink

http://hdl.handle.net/10138/159398

Citation

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

Title: Using HFST—Helsinki Finite-State Technology for Recognizing Semantic Frames
Author: Lindén, Krister; Hardwick, Sam; Silfverberg, Miikka; Axelson, Erik
Contributor organization: Department of Modern Languages 2010-2017
Language Technology
Publisher: Springer International Publishing AG
Date: 2015-12-09
Language: eng
Number of pages: 13
Belongs to series: Systems and Frameworks for Computational Morphology
Belongs to series: Communications in Computer and Information Science
ISBN: 978-3-319-23978-1
978-3-319-23980-4
ISSN: 1865-0929
DOI: https://doi.org/10.1007/978-3-319-23980-4_8
URI: http://hdl.handle.net/10138/159398
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.
Subject: 113 Computer and information sciences
6121 Languages
Peer reviewed: Yes
Rights: cc_by
Usage restriction: openAccess
Self-archived version: acceptedVersion


Files in this item

Total number of downloads: Loading...

Files Size Format View
HFST2015.pdf 184.4Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record