32 search results - page 5 / 7 » Improved count suffix trees for natural language data |
EMNLP
2010
13 years 4 months ago
2010
We examine effects that empty categories have on machine translation. Empty categories are elements in parse trees that lack corresponding overt surface forms (words) such as drop...
STOC
2004
ACM
14 years 6 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
PODC
2009
ACM
14 years 7 months ago
2009
ACM
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
IJCNLP
2005
Springer
14 years 2 days ago
2005
Springer
Abstract. In this paper, we explore the syntactic relation patterns for opendomain factoid question answering. We propose a pattern extraction method to extract the various relatio...
IR
2010
13 years 5 months ago
2010
Abstract We present a new ranking algorithm that combines the strengths of two previous methods: boosted tree classification, and LambdaRank, which has been shown to be empiricall...