10493 search results - page 108 / 2099 » Dynamic Word Problems |
DLT
2008
13 years 9 months ago
2008
Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equ...
EMNLP
2007
13 years 9 months ago
2007
It has been widely observed that different NLP applications require different sense granularities in order to best exploit word sense distinctions, and that for many applications ...
NIPS
2008
13 years 9 months ago
2008
Polysemy is a problem for methods that exploit image search engines to build object category models. Existing unsupervised approaches do not take word sense into consideration. We...
ACL
2010
13 years 6 months ago
2010
Word Sense Disambiguation remains one of the most complex problems facing computational linguists to date. In this paper we present a system that combines evidence from a monoling...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de�...