In this paper, we propose adding long-term grammatical information in a Whole Sentence Maximun Entropy Language Model (WSME) in order to improve the performance of the model. The ...
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Recently, dependency grammar has become quite popular in relatively free word-order languages. We encounter many structural ambiguities when parsing a sentence using dependency gr...
We propose an interface specification language based on grammars for modular software model checking. In our interface specification language, component interfaces are specified a...
We describe how simple, commonly understood statistical models, such as statistical dependency parsers, probabilistic context-free grammars, and word-to-word translation models, c...