3818 search results - page 129 / 764 » Word Problems on Compressed Words |
164
click to vote
FLAIRS
2008
15 years 7 months ago
2008
The problem of recognizing textual entailment (RTE) has been recently addressed using syntactic and lexical models with some success. Here, we further explore this problem, this t...
160
Voted
EMNLP
2004
15 years 6 months ago
2004
This paper presents Japanese morphological analysis based on conditional random fields (CRFs). Previous work in CRFs assumed that observation sequence (word) boundaries were fixed...
138
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
143
click to vote
NLE
2008
15 years 4 months ago
2008
Words in Semitic texts often consist of a concatenation of word segments, each corresponding to a Part-of-Speech (POS) category. Semitic words may be ambiguous with regard to thei...
131
click to vote
STACS
2007
Springer
15 years 11 months ago
2007
Springer
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...