10 citations · 26 across the 14 of their papers we have counts for
14 papers
Automatic Classification of Human Translation and Machine Translation: A Study from the Perspective of Lexical Diversity
Yingxue Fu, Mark-Jan Nederhof
By using a trigram model and fine-tuning a pretrained BERT model for sequence classification, we show that machine translation and human translation can be classified with an accur…
A short proof that is an MCFL
Mark-Jan Nederhof
We present a new proof that 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-dim…
On the Computation of Distances for Probabilistic Context-Free Grammars
Colin de la Higuera, James Scicluna, Mark-Jan Nederhof
Probabilistic context-free grammars (PCFGs) are used to define distributions over strings, and are powerful modelling tools in a number of areas, including natural language process…
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing
M. J. Nederhof, G. Satta
We propose a formalism for representation of finite languages, referred to as the class of IDL-expressions, which combines concepts that were only considered in isolation in existi…
Tabular Parsing
Mark-Jan Nederhof, Giorgio Satta
This is a tutorial on tabular parsing, on the basis of tabulation of nondeterministic push-down automata. Discussed are Earley's algorithm, the Cocke-Kasami-Younger algorithm, tabu…
Probabilistic Parsing Strategies
Mark-Jan Nederhof, Giorgio Satta
We present new results on the relation between purely symbolic context-free parsing strategies and their probabilistic counter-parts. Such parsing strategies are seen as constructi…