short-paper

Levenshtein in Blocks World: String Matching via AI Planning

Authors:

Jimmy Xiangji HuangAuthors Info & Claims

ICTIR '18: Proceedings of the 2018 ACM SIGIR International Conference on Theory of Information Retrieval

Pages 171 - 174

https://doi.org/10.1145/3234944.3234976

Published: 10 September 2018 Publication History

Abstract

We provide in this paper an encoding which converts the string matching problems into planning problems in Artificial Intelligence. As an example use of the encoding, Levenshtein distance for measuring similarity between two strings particularly is to be calculated through searching for a feasible plan in shortest length from its initial state to the goal state. The research has its origin in Blocks World, a benchmark domain for studying the theory and application of AI planning. Connecting with AI planning in our belief not only creates promising opportunities in development of new, knowledge-rich heuristics, but also enables hands-on use of existing high-performance AI planners or reasoners, for string matching.

References

[1]

{n. d.}. Japanese Names. http://www.aboutnames.ch/japanese.htm. Accessed: May, 2018.

[2]

Arturs Backurs and Piotr Indyk. 2015. Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False). In Proceedings of the Fortyseventh Annual ACM Symposium on Theory of Computing (STOC '15). 51--58.

Digital Library

[3]

Ivan Bratko. 2012. Prolog Programming for Artificial Intelligence, 4th Edition. Addison-Wesley.

[4]

Tom Bylander. 1994. The Computational Complexity of Propositional STRIPS Planning. Artificial Intelligence 69, 1 (1994), 165 -- 204.

Digital Library

[5]

Peter Christen. 2012. Data Matching: Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Springer Publishing Company.

Digital Library

[6]

Stephen A. Cook and Yongmei Liu. 2003. A Complete Axiomatization for Blocks World. Journal of Logic and Computation 13, 4 (2003), 581--594.

[7]

Naresh Gupta and Dana S. Nau. 1992. On the Complexity of Blocks-World Planning. Artificial Intelligence 56, 2 (1992), 223 -- 254.

Digital Library

[8]

Malte Helmert. 2003. Complexity Results for Standard Benchmark Domains in Planning. Artificial Intelligence 143, 2 (2003), 219 -- 262.

Digital Library

[9]

VI Levenshtein. 1966. Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady 10 (1966), 707.

[10]

Bing Liu. 2009. Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data. Springer-Verlag, Berlin, Heidelberg.

Digital Library

[11]

Christopher D. Manning, Prabhakar Raghavan, and Hinrich Schütze. 2008. Introduction to Information Retrieval. Cambridge University Press.

Digital Library

[12]

Gonzalo Navarro. 2001. A Guided Tour to Approximate String Matching. ACM Comput. Surv. 33, 1 (March 2001), 31--88.

Digital Library

[13]

Stuart Russell and Peter Norvig. 2009. Artificial Intelligence: A Modern Approach (3rd ed.). Prentice Hall Press, Upper Saddle River, NJ, USA.

Digital Library

[14]

John Slaney and Sylvie ThiÃbaux. 2001. Blocks World Revisited. Artificial Intelligence 125, 1 (2001), 119 -- 153.

Digital Library

[15]

Xing Tan. 2012. The Application of Ontologies to Reasoning with Process Modeling Formalisms. Ph.D. Dissertation. University of Toronto.

[16]

Xing Tan and Michael Gruninger. 2014. The Complexity of Partial-Order Plan Viability Problems. In Proc. of the 24th ICAPS.

Digital Library

[17]

Robert A. Wagner and Michael J. Fischer. 1974. The String-to-String Correction Problem. J. ACM 21, 1 (Jan. 1974), 168--173.

Digital Library

Cited By

Tan XHuang JGu Y(2022)SMAT: String Matching in Action Theory2022 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)10.1109/WI-IAT55865.2022.00014(26-31)Online publication date: Nov-2022
https://doi.org/10.1109/WI-IAT55865.2022.00014
Abdulmalek SAL-Hagree SAlsurori MHadwan MAqlan AAlqasemi F(2021)Levenstein's Algorithm On English and Arabic: A Survey2021 International Conference of Technology, Science and Administration (ICTSA)10.1109/ICTSA52017.2021.9406547(1-6)Online publication date: 22-Mar-2021
https://doi.org/10.1109/ICTSA52017.2021.9406547
Bădică ABădică CBuligiu ICiora L(2021)Exploring the Blocks World state spaceConcurrency and Computation: Practice and Experience10.1002/cpe.647234:14Online publication date: 18-Jul-2021
https://doi.org/10.1002/cpe.6472

Index Terms

Levenshtein in Blocks World: String Matching via AI Planning

Recommendations

A Normalized Levenshtein Distance Metric

Although a number of normalized edit distances presented so far may offer good performance in some applications, none of them can be regarded as a genuine metric between strings because they do not satisfy the triangle inequality. Given two strings X ...
GPU acceleration of Levenshtein distance computation between long strings
Abstract
Computing edit distance for very long strings has been hampered by quadratic time complexity with respect to string length. The WFA algorithm reduces the time complexity to a quadratic factor with respect to the edit distance between ...
Highlights
- The WFA algorithm can be adapted to compute the edit distance for long strings by using a two-column approach.
A hierarchical goal-based formalism and algorithm for single-agent planning
AAMAS '12: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2

Plan generation is important in a number of agent applications, but such applications generally require elaborate domain models that include not only the definitions of the actions that an agent can perform in a given domain, but also information about ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICTIR '18: Proceedings of the 2018 ACM SIGIR International Conference on Theory of Information Retrieval

September 2018

238 pages

ISBN:9781450356565

DOI:10.1145/3234944

General Chairs:
Dawei Song
Beijing Institute of Technology, China and The Open University, UK
,
Tie-Yan Liu
Microsoft Research Asia, China
,
Le Sun
Chinese Information Processing Society of China, China
,
Program Chairs:
Peter Bruza
Queensland University of Technology, Australia
,
Massimo Melucci
University of Padua, Italy
,
Fabrizio Sebastiani
Consiglio Nazionale delle Ricerche, Italy
,
Grace Hui Yang
Georgetown University, USA

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGIR: ACM Special Interest Group on Information Retrieval

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 September 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Funding Sources

Natural Sciences and Engineering Research Council of Canada
NSERC CREATE award in ADERSIM
ORF-RE (Ontario Research Fund - Research Excellence) award in BRAIN Alliance

Conference

ICTIR '18

Sponsor:

SIGIR

ICTIR '18: The 2018 ACM SIGIR International Conference on the Theory of Information Retrieval

September 14 - 17, 2018

Tianjin, China

Acceptance Rates

ICTIR '18 Paper Acceptance Rate 19 of 47 submissions, 40%;

Overall Acceptance Rate 235 of 527 submissions, 45%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
120
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Tan XHuang JGu Y(2022)SMAT: String Matching in Action Theory2022 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)10.1109/WI-IAT55865.2022.00014(26-31)Online publication date: Nov-2022
https://doi.org/10.1109/WI-IAT55865.2022.00014
Abdulmalek SAL-Hagree SAlsurori MHadwan MAqlan AAlqasemi F(2021)Levenstein's Algorithm On English and Arabic: A Survey2021 International Conference of Technology, Science and Administration (ICTSA)10.1109/ICTSA52017.2021.9406547(1-6)Online publication date: 22-Mar-2021
https://doi.org/10.1109/ICTSA52017.2021.9406547
Bădică ABădică CBuligiu ICiora L(2021)Exploring the Blocks World state spaceConcurrency and Computation: Practice and Experience10.1002/cpe.647234:14Online publication date: 18-Jul-2021
https://doi.org/10.1002/cpe.6472

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents