Al Birr Karim Susanto, Nuraziz Muliadi, Bagus Wahyu Nugroho et al. · Journal of Applied Intelligent System · 2023
The Optical Character Recognition (OCR) problem that often occurs is that the image used, has a lot of noise covering letters in a word partially. This can cause misspellings in the process of word recognition or detection in the image. After the OCR process, we must do some post-processing for correcting the word. The words will be corrected using a string similarity algorithm. So what is the best algorithm? We conducted a comparison algorithm including the Levenshtein distance, Hamming distance, Jaro-Winkler, and Sørensen – Dice coefficient. After testing, the most effective algorithm is the Sørensen-Dice coefficient with a value of 0.88 for the value of precision, recall, and F1 score
Cited by 3Open access
西本, 崇晃, Nishimoto, Takaaki, ニシモト, タカアキ · Kyushu University Institutional Repository (QIR) (Kyushu University) · 2017
Cited by 0Open access
Sumit Gulwani · 2011
We describe the design of a string programming/expression language that supports restricted forms of regular expressions, conditionals and loops. The language is expressive enough to represent a wide variety of string manipulation tasks that end-users struggle with. We describe an algorithm based on several novel concepts for synthesizing a desired program in this language from input-output examples. The synthesis algorithm is very efficient taking a fraction of a second for various benchmark examples. The synthesis algorithm is interactive and has several desirable features: it can rank multiple solutions and has fast convergence, it can detect noise in the user input, and it supports an active interaction model wherein the user is prompted to provide outputs on inputs that may have multiple computational interpretations.
Cited by 438
G. Andrés Cisneros · 1991
String-processing languages have typically been implemented as interpreters, macro generators or program generators. Convert, a language whose main appeal is the ease with which string transformations may be expressed as sets of pattern-matching and substitution rules, was developed initially as an interpreter under a symbol manipulation version of REC. This paper describes the implementation of a machine-code compiler of Convert for the Motorola MC680x0 family of microprocessors. The execution speed of programs produced with this compiler compares favorably with that of equivalent programs written in other string-processing languages.
Cited by 0
Gagolewski, Marek · Zenodo (CERN European Organization for Nuclear Research) · 2025
Fast and portable character string processing in R (with the Unicode ICU)
Cited by 0Open access
Nicola Prezza · IRIS - Institutional Research Information System (Libera Università Internazionale degli Studi Sociali Guido Carli) · 2017
In this paper we present DYNAMIC, an open-source C++ library implementing dynamic compressed data structures for string manipulation. Our framework includes useful tools such as searchable partial sums, succinct/gap-encoded bitvectors, and entropy/run-length compressed strings and FM indexes. We prove close-to-optimal theoretical bounds for the resources used by our structures, and show that our theoretical predictions are empirically tightly verified in practice. To conclude, we turn our attention to applications. We compare the performance of five recently-published compression algorithms implemented using DYNAMIC with those of stateof-the-art tools performing the same task. Our experiments show that algorithms making use of dynamic compressed data structures can be up to three orders of magnitude more space-efficient (albeit slower) than classical ones performing the same tasks.
Cited by 20Open access
Ricardo Baeza‐Yates · McGill-Queen's University Press eBooks · 1997
We use string processing to denote any use of computers to process and manage strings or sequences of symbols. This includes text retrieval, compression, computational biology, natural language processing, word theory, etc. Strings can also be extended to other dimensions, including images and complex objects, such as trees or graphs. These areas are important for many applications, including text, image or genetic databases. Nowadays, the most important motivation for research is searching and managing the World Wide Web. The Web contains terabytes of data and searching for information is becoming as difficult as finding a needle in a haystack. Future versions of this work-shop will focus on generic information retrieval, query languages, user interfaces and visualization tools.
Cited by 1
2001
Cited by 5
Paul Anthony Bailes · The University of Queensland · 1983
Cited by 1
Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi et al. · Theoretical Computer Science · 2020
Cited by 2Open access
George Eadon, Eugene Inseok Chong, Ananth Raghavan · Lecture notes in computer science · 2015
Cited by 0
Uwe D. Reichel · Open access LMU (Ludwid Maxmilian's Universitat Munchen) · 2012
Two online research tools are presented in this paper: PermA, a general-purpose string aligner which can for example be used for grapheme-to-phoneme and phoneme-to-phoneme alignment, and Balloon, a text processing toolkit for German and English providing components for part-of-speech tagging, morphological analyses, and grapheme-to-phoneme conversion including syllabifica- tion and word-stress assignment. The general architectures of these tools are introduced with a focus on recent improvements concerning the alignment cost function derivation and word stress assignment.
Cited by 62Open access
Grossi, R, Sebastiani, F, Silvestri, F · IRIS Research product catalog (Sapienza University of Rome) · 2011
Cited by 0
Raphaël Clifford, Klim Efremenko, Benny Porat et al. · 2008
Cited by 6
K. Yu. Polyakov · Informatics in school · 2025
This review article considers various approaches to solving problems for processing character strings included in the materials of the Unified State Examination (USE) in informatics. Among them are the brute force method, finite automata, one-pass algorithms, substitution method, dynamic programming, regular expressions. Some of these tools are insufficiently covered in school textbooks, although mastering them can significantly improve the efficiency of solving problems on processing character strings in the conditions of USE. For each of the considered methods we present characteristic problems that can be effectively solved by this method. All solutions are given in Python. The article can be useful for informatics teachers, as well as for pupils with an advanced level of programming skills.
Cited by 0Open access
Muhammad Hamza Waseem · Oxford University Research Archive (ORA) (University of Oxford) · 2024
Applied category theory provides powerful mathematical tools for modelling processes and their composition. Symmetric monoidal categories, which involve series and parallel composition, are particularly well-suited for describing the composition of processes in space and time. Also called process theories, they admit string diagrams, which constitute a visually intuitive, mathematically rigorous, expressive and flexible syntax that is applicable to wide-ranging scientific domains. In this thesis, we employ string diagrams to investigate a selection of topics in the areas of quantum foundations, computing, and natural language processing. We report three main contributions: • We formalise constructor theory as a process theory. In the context of quantum physics, we also demonstrate the conflict between constructor-theoretic principles of locality and composition. Moreover, we argue that if the principle of locality is rejected, categorical quantum mechanics (CQM) can be conceived as a constructor theory of quantum physics. • We develop a formalism for wave-based logic circuits with phase encoding. We motivate the formalism using the example of spin-wave circuits, and then demonstrate its utility in design, analysis and optimisation of Boolean logic circuits. • We investigate the elimination of inter-language grammatical bureaucracy in the distributional compositional circuits (DisCoCirc) framework. In particular, we develop a hybrid grammar for a restricted fragment of the Urdu language, and show that Urdu text endowed with this hybrid grammar maps surjectively to DisCoCirc text circuits. Furthermore, we show that for the same language fragment, Urdu and English text circuits become the same up to gate-level translation. The aforementioned work supports the view that a process-relational outlook in science is well-supported by applied category-theoretic tools, particularly string diagrams.
Cited by 0Open access
Uwe D. Reichel · 2012
Two online research tools are presented in this paper: PermA, a general-purpose string aligner which can for example be used for grapheme-to-phoneme and phonemeto-phoneme alignment, and Balloon, a text processing toolkit for German and English providing components for part-of-speech tagging, morphological analyses, and grapheme-to-phoneme conversion including syllabification and word-stress assignment.The general architectures of these tools are introduced with a focus on recent improvements concerning the alignment cost function derivation and word stress assignment.
Cited by 33
Ralph E. Griswold, David R. Hanson · ACM Transactions on Programming Languages and Systems · 1980
SNOBOL4 is best known for its string processing facilities, which are based on patterns as data objects. Despite the demonstrated success of patterns, there are many shortcomings associated with their use. The concept of patterns in SNOBOL4 is examined and problem areas are discussed. An alternative method for high-level string processing is described. This method, implemented in the programming language Icon, employs generators , which are capable of producing alternative values. Generators, coupled with a goal-driven method of expression evaluation, provide the string processing facilities of SNOBOL4 without the disadvantages associated with patterns. Comparisons between SNOBOL4 and Icon are included and the broader implications of the new approach are discussed.
Cited by 31Open access
Charaka Geethal Kapugama · Zenodo (CERN European Organization for Nuclear Research) · 2022
GRAMMAR2FIX is an active oracle learning technique for programs processing string inputs. Given a single failing input of a bug, it learns a grammar describing the pattern of all the failing inputs of the bug, interacting with a bug oracle systematically. GRAMMAR2FIX returns this grammar as a collection of Deterministic Finite Automata(DFA), and the grammar can serve as an automated test oracle for the bug. GRAMMAR2FIX also produces a test suite in grammar learning, which can be used as a repair test suite in Automated Program Repair.
Cited by 0Open access
Fábio Crestani, Paolo Ferragina, Mark Sanderson · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · 2008
Cited by 0