Zobrazeno 1 - 10
of 79
pro vyhledávání: '"Mark-Jan Nederhof"'
Autor:
Mark-Jan Nederhof
Publikováno v:
Computational Linguistics, Vol 31, Iss 2 (2021)
Externí odkaz:
https://doaj.org/article/c686ef0ecf2948f481e87df4dc88fee9
Autor:
Mark-Jan Nederhof
Publikováno v:
Computational Linguistics, Vol 29, Iss 1 (2021)
Externí odkaz:
https://doaj.org/article/14d5811ac50e4818a43c98108275b22d
Autor:
Mark-Jan Nederhof
Publikováno v:
Computational Linguistics, Vol 26, Iss 1 (2021)
Externí odkaz:
https://doaj.org/article/8abc2261888d49bba10c736375448c0b
Autor:
Mark-Jan Nederhof, Giorgio Satta
Publikováno v:
Computational Linguistics, Vol 37, Iss 4 (2021)
Externí odkaz:
https://doaj.org/article/d12743fcf015416f8c10da6b70462425
Autor:
Mark-Jan Nederhof, Fahrurrozi Rahman
Publikováno v:
Journal of Language Modelling, Vol 5, Iss 1 (2017)
This article offers a formalization of how signs form words in Ancient Egyptian writing, for either hieroglyphic or hieratic texts. The formalization is in terms of a sequence of sign functions, which concurrently produce a sequence of signs and a se
Externí odkaz:
https://doaj.org/article/db7451f5c099427eadef82fdaa80809d
Publikováno v:
Computational Linguistics, Vol 43, Iss 3 (2017)
We explore the concept of hybrid grammars, which formalize and generalize a range of existing frameworks for dealing with discontinuous syntactic structures. Covered are both discontinuous phrase structures and non-projective dependency structures. T
Externí odkaz:
https://doaj.org/article/8d5944a522f642e490e0b6ebfa0b6541
Autor:
Mark-Jan Nederhof, Khalil Sima'an
Publikováno v:
Journal of Language Modelling, Vol 4, Iss 1 (2016)
Externí odkaz:
https://doaj.org/article/85b96aa6344547b7b5274b252894d137
Autor:
Rita Lucarelli, Mark-Jan Nederhof
Publikováno v:
Ancient Egypt, New Technology ISBN: 9789004501294
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a23d894714bad4c675e8286ced0aae9a
https://doi.org/10.1163/9789004501294_011
https://doi.org/10.1163/9789004501294_011
Autor:
Mark-Jan Nederhof
Publikováno v:
Transactions of the Association for Computational Linguistics, Vol 7, Pp 283-296 (2019)
We present a new cubic-time algorithm to calculate the optimal next step in shift-reduce dependency parsing, relative to ground truth, commonly referred to as dynamic oracle. Unlike existing algorithms, it is applicable if the training corpus contain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffbbad2768f712f2d3cf0b1950b2f966
https://doi.org/10.1162/tacl_a_00268
https://doi.org/10.1162/tacl_a_00268