44 search results - page 6 / 9 » On-line Approximate String Matching in Natural Language |
90
Voted
SPIRE
1998
Springer
15 years 1 months ago
1998
Springer
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
FOIKS
2008
Springer
14 years 11 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
EACL
1989
ACL Anthology
14 years 10 months ago
1989
ACL Anthology
Koskenniemi's model of two-level morphology has been very influential in recent years, but definitions of the formalism have generally been phrased in terms of a compilation ...
106
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
WWW
2009
ACM
15 years 10 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...