activity
19942021
most citedEfficient Tabular LR Parsing

10 citations · 26 across the 14 of their papers we have counts for

collaborators
Showing cs.CLShow all

6 papers · 1 filter

cs.CL2021★ 1 cited

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…

cs.CL2004

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…

cs.CL2002

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…

cs.CL1999

Practical experiments with regular approximation of context-free languages

Mark-Jan Nederhof

Several methods are discussed that construct a finite automaton given a context-free grammar, including both methods that lead to subsets and those that lead to supersets of the or…

cs.CL1999★ 2 cited

Robust Grammatical Analysis for Spoken Dialogue Systems

Gertjan van Noord, Gosse Bouma, Rob Koeling +1

We argue that grammatical analysis is a viable alternative to concept spotting for processing spoken input in a practical spoken dialogue system. We discuss the structure of the gr…

cs.CL1998

Prefix Probabilities from Stochastic Tree Adjoining Grammars

Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta

Language models for speech recognition typically use a probability model of the form Pr(a_n | a_1, a_2, ..., a_{n-1}). Stochastic grammars, on the other hand, are typically used to…