A novel look-ahead optimization strategy for trie-based approximate string matching (Q851727): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10044-006-0036-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047848293 / rank | |||
Normal rank | |||
Revision as of 18:30, 19 March 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
