A novel look-ahead optimization strategy for trie-based approximate string matching (Q851727)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5075237
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A novel look-ahead optimization strategy for trie-based approximate string matching |
scientific article; zbMATH DE number 5075237 |
Statements
A novel look-ahead optimization strategy for trie-based approximate string matching (English)
0 references
22 November 2006
0 references
trie-based syntactic pattern recognition
0 references
approximate string matching
0 references
noisy syntactic recognition using tries
0 references
branch-and-bound techniques
0 references
pruning
0 references
0.8125368356704712
0 references
0.7993748784065247
0 references
0.7678905129432678
0 references
0.7633405923843384
0 references
