Approximate String Matching-Reference-Cited by-同舟云学术

Approximate String Matching

Published:1980-12 Issue:4 Volume:12 Page:381-402
ISSN:0360-0300
Container-title:ACM Computing Surveys
language:en
Short-container-title:ACM Comput. Surv.

Author:

Hall Patrick A. V.¹,Dowling Geoff R.²

Affiliation:

1. SCICON Consultancy International Limited, Sanderson House, 49 Berners Street, London WIP 4AQ, England

2. Department of Computer Science, The City University, Northampton Square, London EC1V OHB, England

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science,Theoretical Computer Science

Reference83 articles.

1. A minimum distance error-correcting parser for context-free languages;AHO A. V.;SIAM J. Comput.,1972

2. Efficient string matching

3. Bounds on the Complexity of the Longest Common Subsequence Problem

4. String similarity and misspellings

5. BACON M. D. AND BULL G.M. Dam transmission Macdonald and Jane's London 1973. BACON M. D. AND BULL G.M. Dam transmission Macdonald and Jane's London 1973.

Cited by 326 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Disambiguating usernames across platforms: the GeekMAN approach;Social Network Analysis and Mining;2024-08-31

2. Towards automated transcribing and coding of embodied teamwork communication through multimodal learning analytics;British Journal of Educational Technology;2024-05-30

3. Matching Literature Heritage Entities From Heterogeneous Data Sources Based On The Textual Description;2024 35th Conference of Open Innovations Association (FRUCT);2024-04-24

4. Statistical analysis of lexemes generated in ‘C’ programming using fuzzy automation;Journal of Intelligent & Fuzzy Systems;2024-01-10

5. Reanalyst: Scalable Analysis of Reverse Engineering Activities;2024