Sciweavers

656 search results - page 69 / 132
» Marrying Words and Trees
Sort
View
VLDB
2007
ACM
89views Database» more  VLDB 2007»
16 years 3 days ago
Effective Phrase Prediction
Autocompletion is a widely deployed facility in systems that require user input. Having the system complete a partially typed "word" can save user time and effort. In th...
Arnab Nandi, H. V. Jagadish
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
15 years 1 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
14 years 11 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
ACL
2008
15 years 1 months ago
A Single Generative Model for Joint Morphological Segmentation and Syntactic Parsing
Morphologicalprocesses in Semitic languages deliver space-delimited words which introduce multiple, distinct, syntactic units into the structure of the input sentence. These words...
Yoav Goldberg, Reut Tsarfaty
LREC
2008
131views Education» more  LREC 2008»
15 years 1 months ago
Developing a TT-MCTAG for German with an RCG-based Parser
Developing linguistic resources, in particular grammars, is known to be a complex task in itself, because of (amongst others) redundancy and consistency issues. Furthermore some l...
Laura Kallmeyer, Timm Lichte, Wolfgang Maier, Yann...