Approximate Dictionary Searching at a Scale using Ternary Search Trees and Implicit Levenshtein Automata

Peter Schneider-Kamp

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Approximate Dictionary Searching at a Scale using Ternary Search Trees and Implicit Levenshtein Automata

Topics: Artificial Intelligence Applications; Big Data and Data Science; Natural Language Technologies

In Proceedings of the 17th International Conference on Software Technologies ICSOFT - Volume 1, 657-662, 2022 , Lisbon, Portugal

Author: Peter Schneider-Kamp

Affiliation: Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, Odense, Denmark

Keyword(s): Approximate Dictionary Searching, Ternary Search Tree, Edit Distance, Levenshtein Automata, Scalable Algorithms.

Abstract: Approximate Dictionary Searching refers to the problem of finding entries in a dictionary that match a search word either exactly or with a certain allowed distance between entry and search word. Extant computationally efficient data structures and algorithms addressing this problem typically do not scale well to large alphabets and/or dictionaries, often requiring prohibitive amounts of memory as the sizes of alphabets and dictionaries increase. This paper presents a data structure and an algorithm for approximate dictionary searching that rely on ternary search trees and implicit Levenshtein automata and scale well with the sizes of both alphabets and dictionaries.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 18.118.32.7

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Schneider-Kamp, P. (2022). Approximate Dictionary Searching at a Scale using Ternary Search Trees and Implicit Levenshtein Automata. In Proceedings of the 17th International Conference on Software Technologies - ICSOFT; ISBN 978-989-758-588-3; ISSN 2184-2833, SciTePress, pages 657-662. DOI: 10.5220/0011312300003266

@conference{icsoft22,
author={Peter Schneider{-}Kamp.},
title={Approximate Dictionary Searching at a Scale using Ternary Search Trees and Implicit Levenshtein Automata},
booktitle={Proceedings of the 17th International Conference on Software Technologies - ICSOFT},
year={2022},
pages={657-662},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0011312300003266},
isbn={978-989-758-588-3},
issn={2184-2833},
}

TY - CONF

JO - Proceedings of the 17th International Conference on Software Technologies - ICSOFT
TI - Approximate Dictionary Searching at a Scale using Ternary Search Trees and Implicit Levenshtein Automata
SN - 978-989-758-588-3
IS - 2184-2833
AU - Schneider-Kamp, P.
PY - 2022
SP - 657
EP - 662
DO - 10.5220/0011312300003266
PB - SciTePress