44 search results - page 5 / 9 » On-line Approximate String Matching in Natural Language |
ICS
2010
Tsinghua U.
15 years 2 months ago
2010
Tsinghua U.
We explore the intersection between an emerging class of architectures and a prominent workload: GPGPUs (General-Purpose Graphics Processing Units) and regular expression matching...
73
Voted
MUC
1992
15 years 1 months ago
1992
This paper reports on the results of the adjunct test performed by GE for the MUC-4 evaluation of text processing systems . In this test, we evaluated the effect of an object-orie...
173
Voted
VLDB
2003
ACM
15 years 9 months ago
2003
ACM
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
EDBT
2004
ACM
15 years 9 months ago
2004
ACM
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
101
click to vote
ICALP
2011
Springer
14 years 28 days ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...