We show how a general grammar may be automatically adapted for fast parsing of utterances from a specific domain by means of constituent pruning and grammar specialization based o...
Given the increasing need to process massive amounts of textual data, efficiency of NLP tools is becoming a pressing concern. Parsers based on lexicalised grammar formalisms, such...
Yue Zhang 0004, Byung-Gyu Ahn, Stephen Clark, Curt...
Sophisticated grammar formalisms, such as LFG, allow concisely capturing complex linguistic phenomena. The powerful operators provided by such formalisms can however introduce spu...
We present several improvements to unlexicalized parsing with hierarchically state-split PCFGs. First, we present a novel coarse-to-fine method in which a grammar’s own hierarc...
We present an efficientmulti-levelchart parser that was designed forsyntacticanalysisofclosedcaptions (subtitles) in a real-time Machine Translation (MT) system. In order to achie...