675 search results - page 103 / 135 » On Compression of Parse Trees |
172
click to vote
SSDBM
2010
IEEE
15 years 8 months ago
2010
IEEE
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
145
click to vote
ICIP
2002
IEEE
16 years 6 months ago
2002
IEEE
In this paper a fully automatic system for embedding visually recognizable watermark patterns to video objects is proposed. The architecture consists of 3 main modules. During the...
138
click to vote
EACL
2009
ACL Anthology
16 years 5 months ago
2009
ACL Anthology
In this paper we compare and contrast two approaches to Machine Translation (MT): the CMU-UKA Syntax Augmented Machine Translation system (SAMT) and UPC-TALP N-gram-based Statisti...
136
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
We investigate the problem of determining the polarity of sentiments when one or more occurrences of a negation term such as “not” appear in a sentence. The concept of the sco...
148
click to vote
CALCO
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general a...