A novel look-ahead optimization strategy for trie-based approximate string matching (Q851727): Difference between revisions
From MaRDI portal
Created claim: DBLP publication ID (P1635): journals/paa/BadrO06, #quickstatements; #temporary_batch_1731508824982 |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10044-006-0036-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10044-006-0036-8 / rank | |||
Normal rank | |||
Latest revision as of 05:21, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A novel look-ahead optimization strategy for trie-based approximate string matching |
scientific article |
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
