DE eng

Search in the Catalogues and Directories

Hits 1 – 15 of 15

1
Calculating the optimal step of arc-eager parsing for non-projective trees
Nederhof, Mark Jan. - : Association for Computational Linguistics, 2021
BASE
Show details
2
Automatic classification of human translation and machine translation : a study from the perspective of lexical diversity
Fu, Yingxue; Nederhof, Mark Jan. - : Linkoping University Electronic Press, 2021
BASE
Show details
3
Calculating the optimal step in shift-reduce dependency parsing : from cubic to linear time
BASE
Show details
4
Regular transductions with MCFG input syntax
Nederhof, Mark Jan; Vogler, Heiko. - : Association for Computational Linguistics, 2019
BASE
Show details
5
A probabilistic model of Ancient Egyptian writing
BASE
Show details
6
Transition-based dependency parsing as latent-variable constituent parsing
Nederhof, Mark Jan. - : Association for Computational Linguistics, 2016
BASE
Show details
7
A short proof that O2 is an MCFL
Nederhof, Mark Jan. - : Association for Computational Linguistics, 2016
BASE
Show details
8
Count-based state merging for probabilistic regular tree grammars
Dietze, Toni; Nederhof, Mark Jan. - : Association for Computational Linguistics, 2015
BASE
Show details
9
A probabilistic model of Ancient Egyptian writing
Nederhof, Mark Jan; Rahman, Fahrurrozi. - : Association for Computational Linguistics, 2015
BASE
Show details
10
Computation of infix probabilities for probabilistic context-free grammars
Satta, Giorgio; Nederhof, Mark Jan. - : Association for Computational Linguistics, 2012
BASE
Show details
11
Splittability of bilexical context-free grammars is undecidable
BASE
Show details
12
Prefix probabilities for linear context-free rewriting systems
Nederhof, Mark Jan; Satta, Giorgio. - : Association for Computational Linguistics, 2012
BASE
Show details
13
Parsing of partially bracketed structures for parse selection
S´anchez-S´aez, Ricardo; Nederhof, Mark Jan. - : Association for Computational Linguistics, 2012
Abstract: We consider the problem of parsing a sentence that is partially annotated with information about where phrases start and end. The application domain is interactive parse selection with probabilistic grammars. It is explained that the main obstacle is spurious ambiguity. The proposed solution is first described in terms of appropriately constrained synchronous grammars, and then in terms of a computational model for parsing. Experiments show the feasibility for a practical grammar. ; Postprint
Keyword: QA75; QA75 Electronic computers. Computer science
URL: http://aclweb.org/anthology/W/W11/W11-2928.pdf
http://hdl.handle.net/10023/2436
BASE
Hide details
14
Automatic creation of interlinear text for philological purposes
BASE
Show details
15
Transforming lexica as trees
Nederhof, Mark Jan. - : Curran Associates, Inc., 2011
BASE
Show details

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
15
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern