A preprocessing for approximate string matching

Kensuke Baba; Tetsuya Nakatoh; Yasuhiro Yamada; Daisuke Ikeda

doi:10.1007/978-3-642-25453-6_50

A preprocessing for approximate string matching

Kensuke Baba, Tetsuya Nakatoh, Yasuhiro Yamada, Daisuke Ikeda

Intelligence Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

Approximate string matching is a basic and important concept in many applications of information retrieval. This paper proposes an algorithm for the problem of approximate string matching. The algorithm solves the match-count problem as a preprocessing. For input strings of each length n, the time complexities of the approximate string matching problem and the match-count problem are O(n²) and O(nlogn), respectively. Therefore, the computation time of the algorithm is expected to be short when the scope of search is drastically restricted by the preprocessing. This paper makes clear the relation between the solutions of the two problems.

Original language	English
Title of host publication	Informatics Engineering and Information Science - International Conference, ICIEIS 2011, Proceedings
Pages	610-615
Number of pages	6
Edition	PART 2
DOIs	https://doi.org/10.1007/978-3-642-25453-6_50
Publication status	Published - 2011
Event	International Conference on Informatics Engineering and Information Science, ICIEIS 2011 - Kuala Lumpur, Malaysia Duration: Nov 14 2011 → Nov 16 2011

Publication series

Name	Communications in Computer and Information Science
Number	PART 2
Volume	252 CCIS
ISSN (Print)	1865-0929

Other

Other	International Conference on Informatics Engineering and Information Science, ICIEIS 2011
Country/Territory	Malaysia
City	Kuala Lumpur
Period	11/14/11 → 11/16/11

All Science Journal Classification (ASJC) codes

Computer Science(all)
Mathematics(all)

Access to Document

10.1007/978-3-642-25453-6_50

Cite this

A preprocessing for approximate string matching. / Baba, Kensuke; Nakatoh, Tetsuya; Yamada, Yasuhiro et al.
Informatics Engineering and Information Science - International Conference, ICIEIS 2011, Proceedings. PART 2. ed. 2011. p. 610-615 (Communications in Computer and Information Science; Vol. 252 CCIS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Baba, K, Nakatoh, T, Yamada, Y & Ikeda, D 2011, A preprocessing for approximate string matching. in Informatics Engineering and Information Science - International Conference, ICIEIS 2011, Proceedings. PART 2 edn, Communications in Computer and Information Science, no. PART 2, vol. 252 CCIS, pp. 610-615, International Conference on Informatics Engineering and Information Science, ICIEIS 2011, Kuala Lumpur, Malaysia, 11/14/11. https://doi.org/10.1007/978-3-642-25453-6_50

@inproceedings{1d1f45568c744a62acfecf00a7bfadb9,

title = "A preprocessing for approximate string matching",

abstract = "Approximate string matching is a basic and important concept in many applications of information retrieval. This paper proposes an algorithm for the problem of approximate string matching. The algorithm solves the match-count problem as a preprocessing. For input strings of each length n, the time complexities of the approximate string matching problem and the match-count problem are O(n2) and O(nlogn), respectively. Therefore, the computation time of the algorithm is expected to be short when the scope of search is drastically restricted by the preprocessing. This paper makes clear the relation between the solutions of the two problems.",

author = "Kensuke Baba and Tetsuya Nakatoh and Yasuhiro Yamada and Daisuke Ikeda",

note = "Copyright: Copyright 2011 Elsevier B.V., All rights reserved.; International Conference on Informatics Engineering and Information Science, ICIEIS 2011 ; Conference date: 14-11-2011 Through 16-11-2011",

year = "2011",

doi = "10.1007/978-3-642-25453-6_50",

language = "English",

isbn = "9783642254529",

series = "Communications in Computer and Information Science",

number = "PART 2",

pages = "610--615",

booktitle = "Informatics Engineering and Information Science - International Conference, ICIEIS 2011, Proceedings",

edition = "PART 2",

}

TY - GEN

T1 - A preprocessing for approximate string matching

AU - Baba, Kensuke

AU - Nakatoh, Tetsuya

AU - Yamada, Yasuhiro

AU - Ikeda, Daisuke

PY - 2011

Y1 - 2011

N2 - Approximate string matching is a basic and important concept in many applications of information retrieval. This paper proposes an algorithm for the problem of approximate string matching. The algorithm solves the match-count problem as a preprocessing. For input strings of each length n, the time complexities of the approximate string matching problem and the match-count problem are O(n2) and O(nlogn), respectively. Therefore, the computation time of the algorithm is expected to be short when the scope of search is drastically restricted by the preprocessing. This paper makes clear the relation between the solutions of the two problems.

AB - Approximate string matching is a basic and important concept in many applications of information retrieval. This paper proposes an algorithm for the problem of approximate string matching. The algorithm solves the match-count problem as a preprocessing. For input strings of each length n, the time complexities of the approximate string matching problem and the match-count problem are O(n2) and O(nlogn), respectively. Therefore, the computation time of the algorithm is expected to be short when the scope of search is drastically restricted by the preprocessing. This paper makes clear the relation between the solutions of the two problems.

UR - http://www.scopus.com/inward/record.url?scp=82955176917&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=82955176917&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-25453-6_50

DO - 10.1007/978-3-642-25453-6_50

M3 - Conference contribution

AN - SCOPUS:82955176917

SN - 9783642254529

T3 - Communications in Computer and Information Science

SP - 610

EP - 615

BT - Informatics Engineering and Information Science - International Conference, ICIEIS 2011, Proceedings

T2 - International Conference on Informatics Engineering and Information Science, ICIEIS 2011

Y2 - 14 November 2011 through 16 November 2011

ER -

A preprocessing for approximate string matching

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this