May I Check Again? — A simple but efficient way to generate and use contextual dictionaries for Named Entity Recognition. Application to French Legal Texts.

Simple item page
dc.contributor.authorBarriere, Valentin
dc.contributor.authorFouret, Amaury
dc.contributor.editorHartmann, Mareike
dc.contributor.editorPlank, Barbara
dc.date.accessioned2023-09-22T13:35:42Z
dc.date.available2023-09-22T13:35:42Z
dc.date.issued2019
dc.identifier.issnISSN 1736-6305 (Online)
dc.identifier.urihttps://hdl.handle.net/10062/93018
dc.language.isoeng
dc.publisherTurku, Finland, Linköping University Electronic Press, pp. 327--332
dc.relation.ispartofProceedings of the 22nd Nordic Conference on Computational Linguistics
dc.rightsopenAccessen
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleMay I Check Again? — A simple but efficient way to generate and use contextual dictionaries for Named Entity Recognition. Application to French Legal Texts.en
dc.typeArticleen

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
W19_6136.pdf
Size:
149.91 KB
Format:
Adobe Portable Document Format
Download

Collections

Proceedings of the 22nd Nordic Conference on Computational Linguistics