It has always been difficult for language understanding systems to handle spontaneous speech with satisfactory robustness, primarily due to such problems as the fragments, disflue...
Bor-shen Lin, Berlin Chen, Hsin-Min Wang, Lin-Shan...
We present a simple but accurate parser which exploits both large tree fragments and symbol refinement. We parse with all fragments of the training set, in contrast to much recent...
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
The task of selecting information and rendering it appropriately appears in multiple contexts in summarization. In this paper we present a model that simultaneously optimizes sele...