29 search results - page 3 / 6 » Graph parsing with s-graph grammars |
LACL
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. This paper introduces a novel approach to language processing, in which linguistic facts are represented as predicates over ranges of the intput text, usually, but not li...
ICTAI
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper presents a grammar-induction based approach to partitioning a Web page into several small pages while each small page fits not only spatially but also logically for mob...
ECEASST
2008
13 years 7 months ago
2008
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
ACL
2000
13 years 8 months ago
2000
In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the me...
EMNLP
2010
13 years 5 months ago
2010
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...