Sciweavers

61 search results - page 2 / 13
» Efficient Processing Of Flexible Categorial Grammar
Sort
View
COLING
1992
15 years 25 days ago
Proof-Nets And Dependencies
Proof-Nets (Roorda 1990) are a good device for processing with categorial grammars, mainly because they avoid spurious ambiguities. Nevertheless, they do not provide easily readab...
Alain Lecomte
80
Voted
ECEASST
2008
88views more  ECEASST 2008»
14 years 11 months ago
Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators
: 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...
Steffen Mazanek, Mark Minas
114
Voted
CIKM
2010
Springer
14 years 6 months ago
On the definition of patterns for semantic annotation
The semantic annotation of documents is an additional advantage for retrieval, as long as the annotations and their maintenance process scale well. Automatic or semi-automatic ann...
Mónica Marrero, Julián Urbano, Jorge...
DAC
2004
ACM
16 years 19 days ago
An efficient scalable and flexible data transfer architecture for multiprocessor SoC with massive distributed memory
Massive data transfer encountered in emerging multimedia embedded applications requires architecture allowing both highly distributed memory structure and multiprocessor computati...
Sang-Il Han, Amer Baghdadi, Marius Bonaciu, Soo-Ik...
76
Voted
ACL
2006
15 years 1 months ago
Multi-Tagging for Lexicalized-Grammar Parsing
With performance above 97% accuracy for newspaper text, part of speech (POS) tagging might be considered a solved problem. Previous studies have shown that allowing the parser to ...
James R. Curran, Stephen Clark, David Vadas