Home
Catalogue search
Refine your search:
Keyword
Creator / Publisher:
Nederhof, Mark Jan (15)
University of St Andrews.School of Computer Science (15)
Satta, Giorgio (3)
Rahman, Fahrurrozi (2)
Bizzoni, Yuri (1)
Dietze, Toni (1)
España-Bonet, Cristina (1)
Fu, Yingxue (1)
Maletti, Andreas (1)
S´anchez-S´aez, Ricardo (1)
more
Year
Medium
Type
BLLDB-Access
Search in the Catalogues and Directories
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
Sort by
creator [A → Z]
'
creator [Z → A]
'
publishing year ↑ (asc)
'
publishing year ↓ (desc)
'
title [A → Z]
'
title [Z → A]
'
Simple Search
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
Nederhof, Mark Jan
. - 2019
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
Nederhof, Mark Jan
;
Rahman, Fahrurrozi
. - 2017
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
Abstract:
We present a new proof that O2 is a multiple context-free language. It contrasts with a recent proof by Salvati (2015) in its avoidance of concepts that seem specific to two-dimensional geometry, such as the complex exponential function. Our simple proof creates realistic prospects of widening the results to higher dimensions. This finding is of central importance to the relation between extreme free word order and classes of grammars used to describe the syntax of natural language. ; Postprint
Keyword:
Computational linguistics
;
Computational Theory and Mathematics
;
Formal language theory
;
Linguistics and Language
;
NDAS
;
P
;
P Language and Literature
;
QA75
;
QA75 Electronic computers. Computer science
URL:
http://hdl.handle.net/10023/9268
BASE
Hide 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
Satta, Giorgio
;
Nederhof, Mark Jan
. - 2012
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
BASE
Show details
14
Automatic creation of interlinear text for philological purposes
Nederhof, Mark Jan
. - 2011
BASE
Show details
15
Transforming lexica as trees
Nederhof, Mark Jan
. - : Curran Associates, Inc., 2011
BASE
Show details
Mobile view
All
Catalogues
UB Frankfurt Linguistik
0
IDS Mannheim
0
OLC Linguistik
0
UB Frankfurt Retrokatalog
0
DNB Subject Category Language
0
Institut für Empirische Sprachwissenschaft
0
Leibniz-Centre General Linguistics (ZAS)
0
Bibliographies
BLLDB
0
BDSL
0
IDS Bibliografie zur deutschen Grammatik
0
IDS Bibliografie zur Gesprächsforschung
0
IDS Konnektoren im Deutschen
0
IDS Präpositionen im Deutschen
0
IDS OBELEX meta
0
MPI-SHH Linguistics Collection
0
MPI for Psycholinguistics
0
Linked Open Data catalogues
Annohub
0
Online resources
Link directory
0
Journal directory
0
Database directory
0
Dictionary directory
0
Open access documents
BASE
15
Linguistik-Repository
0
IDS Publikationsserver
0
Online dissertations
0
Language Description Heritage
0
© 2013 - 2024 Lin|gu|is|tik
|
Imprint
|
Privacy Policy
|
Datenschutzeinstellungen ändern