Using HFST—helsinki finite-state technology for recognizing semantic frames

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

You may have access to this PDF.

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.

Cite

CITATION STYLE

APA

Lindén1erik, K., Hardwick, S., Silfverberg, M., & Axelson, E. (2015). Using HFST—helsinki finite-state technology for recognizing semantic frames. In Communications in Computer and Information Science (Vol. 537, pp. 124–136). Springer Verlag. https://doi.org/10.1007/978-3-319-23980-4_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free