Sciweavers

329 search results - page 50 / 66
» Stacking Dependency Parsers
Sort
View
PPNA
2011
12 years 10 months ago
Ad-hoc limited scale-free models for unstructured peer-to-peer networks
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
Durgesh Rani Kumari, Hasan Guclu, Murat Yuksel
LREC
2010
202views Education» more  LREC 2010»
13 years 9 months ago
Can Syntactic and Logical Graphs help Word Sense Disambiguation?
This paper presents a word sense disambiguation (WSD) approach based on syntactic and logical representations. The objective here is to run a number of experiments to compare stan...
Amal Zouaq, Michel Gagnon, Benoît Ozell
ACL
2009
13 years 5 months ago
Insights into Non-projectivity in Hindi
Large scale efforts are underway to create dependency treebanks and parsers for Hindi and other Indian languages. Hindi, being a morphologically rich, flexible word order language...
Prashanth Mannem, Himani Chaudhry, Akshar Bharati
ACL
1992
13 years 8 months ago
SEXTANT: Exploring Unexplored Contexts for Semantic Extraction from Syntactic Analysis
For a very long time, it has been considered that the only way of automatically extracting similar groups of words from a text collection for which no semantic information exists ...
Gregory Grefenstette
POPL
2007
ACM
14 years 7 months ago
PADS/ML: a functional data description language
Massive amounts of useful data are stored and processed in ad hoc formats for which common tools like parsers, printers, query engines and format converters are not readily availa...
Artem Gleyzer, David Walker, Kathleen Fisher, Mary...