Парсер на основе ограничений

There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formal- ism is likely to be more …...

We present a stochastic parsing system consisting of a Lexical-Functional Gram- mar (LFG), a constraint-based parser and a stochastic disambiguation model. We re- port on the results of applying this …...

We present an application of ambiguity pack- ing and stochastic disambiguation techniques for Lexical-Functional Grammars (LFG) to the domain of sentence condensation. Our system incorporates a linguistic parser/generator for LFG, …...

AbstractWe present a dependency to constituent tree conversion technique that aims to improve constituent parsing accuracies by leveraging dependency treebanks available in a wide variety in many languages. The technique …...