Parsing Time
Related Papers
Terminology Finite-state Preprocessing for Computational LFG
This paper presents a technique to deal with multiword nominal terminology in a compu- tational Lexical Functional Grammar. This method treats multiword terms as single to- kens by modifying the …...
A Bag of Useful Techniques for Efficient and Robust Parsing
This paper describes new and improved tech- niques which help a unification-based parser to process input efficiently and robustly. In com- bination these methods result in a speed-up in parsing …...
Top Accuracy and Fast Dependency Parsing is not a Contradiction
In addition to a high accuracy, short pars- ing and training times are the most impor- tant properties of a parser. However, pars- ing and training times are still relatively …...
Transition-based Dependency Parsing with Selectional Branching
We present a novel approach, called selec- tional branching, which uses confidence es- timates to decide when to employ a beam, providing the accuracy of beam search at speeds close …...
Automatic Feature Selection for Agenda-Based Dependency Parsing
In this paper we present an in-depth study on automatic feature selection for beam-search depen- dency parsers. The search strategy is inherited from the one implemented in MaltOptimizer, but searches …...