44 search results - page 3 / 9 » On-line Approximate String Matching in Natural Language |
APLAS
2006
ACM
13 years 11 months ago
2006
ACM
The static determination of approximated values of string expressions has many potential applications. For instance, approximated string values may be used to check the validity an...
FQAS
2009
Springer
14 years 10 days ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
SIGIR
1998
ACM
13 years 10 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
ICALP
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
FINTAL
2006
13 years 9 months ago
2006
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...