An approximate string-matching algorithm (Q1190457): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(92)90138-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023843553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel and serial approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast String Matching in Stationary Ergodic Sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:44, 16 May 2024

scientific article
Language Label Description Also known as
English
An approximate string-matching algorithm
scientific article

    Statements