This paper describes an extremely lexicalized probabilistic model for fast and accurate HPSG parsing. In this model, the probabilities of parse trees are defined with only the pro...
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
Terry Koo, Alexander M. Rush, Michael Collins, Tom...
The Block Sorting process of Burrows and Wheeler can be applied to any sequence in which symbols are (or might be) conditioned upon each other. In particular, it is possible to pa...
R. Yugo Kartono Isal, Alistair Moffat, A. C. H. Ng...
The paper presents a method of automatic enrichment of a very large dictionary of word combinations. The method is based on results of automatic syntactic analysis (parsing) of sen...
Alexander F. Gelbukh, Grigori Sidorov, Sang-Yong H...
We describe a method and its implementation for self-monitoring during natural language generation. In situations of communication where the generation of ambiguous utterances sho...