675 search results - page 59 / 135 » On Compression of Parse Trees |
EMNLP
2006
13 years 10 months ago
2006
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...
EMNLP
2010
13 years 6 months ago
2010
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...
ACSC
2002
IEEE
14 years 1 months ago
2002
IEEE
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...
MICAI
2004
Springer
14 years 2 months ago
2004
Springer
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...
COLING
1992
13 years 10 months ago
1992
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...