Proceedings ArticleDOI
Design of a high speed string matching co-processor for NLP
V.S. Murty,P. C. Reghu Raj,S. Raman +2 more
- pp 183-188
Reads0
Chats0
TLDR
The FPGA design of a system with m parallel matching units is reported, shown to improve the performance by a factor of nearly m, without increasing the chip area by more than 45%Abstract:
In Natural Language Processing applications, string matching is the main time-consuming operation A dedicated co-processor for string matching that uses memory interleaving and parallel processing techniques can relieve the host CPU from this burden This paper reports the FPGA design of such a system with m parallel matching units It has been shown to improve the performance by a factor of nearly m, without increasing the chip area by more than 45% The time complexity of the proposed algorithm is O(log/sub 2/ n), where n is the number of lexical entries The memory used by the lexicon has been efficiently organized and the space saving achieved is about 67%read more
Citations
More filters
Journal ArticleDOI
Reconfigurable hardware solution to parallel prefix computation
Jin Hwan Park,Ho-Kwok Dai +1 more
TL;DR: The design and implementation of an efficient reconfigurable parallel prefix computation hardware on field-programmable gate arrays (FPGAs) based on a pipelined dataflow algorithm, and control logic is added to reconfigure the system for arbitrary parallelism degree.
Journal ArticleDOI
Parallel Hardware for Faster Morphological Analysis
TL;DR: In this paper, a linguistic-based stemmer for Arabic verb root extraction with extended infix processing is presented, achieving accuracies of 87% and 90.7% for analyzing the Holy Quran and its Chapter 29 - Surat Al-Ankabut.
Journal ArticleDOI
Parallel hardware for faster morphological analysis
TL;DR: The investigation presented in this paper confirms that the effective development of parallel algorithms and the derivation of corresponding processors in hardware enable implementations with appealing performance characteristics.
Dissertation
A deterministic dynamic associative memory (ddam) model for concept space representation
TL;DR: The thesis of this dissertation is that the solution to the problem of representing and processing information on conceptual principles, in an unsupervised, human-like manner, and using existing computational methods can be approached in the most appropriate way by memory models that specifically address each and every one of the four fundamental properties.
Proceedings ArticleDOI
Design of a language-independent parallel string matching unit for NLP
TL;DR: The FPGA design of a dedicated hardware for string matching that uses memory interleaving and parallel processing techniques can relieve the host CPU from this burden, thereby making the system suitable for real-time applications.
References
More filters
Book
Natural Language Understanding
TL;DR: The text features a new chapter on statistically-based methods using large corpora and an appendix on speech recognition and spoken language understanding and information on semantics that was covered in the first edition has been largely expanded in this edition.
Journal ArticleDOI
Data structures and algorithms for approximate string matching
Zvi Galil,Raffaele Giancarlo +1 more
TL;DR: This paper surveys techniques for designing efficient sequential and parallel approximate string matching algorithms and special attention is given to the methods for the construction of data structures that efficiently support primitive operations needed in approximatestring matching.
Proceedings ArticleDOI
An FPGA-based coprocessor for the parsing of context-free grammars
TL;DR: This paper presents an FPGA-based implementation of a co-processing unit able to parse context-free grammars of real-life sizes that can be used for programming language syntactic analysis and natural language applications where parsing speed is an important issue.
Proceedings ArticleDOI
FPGA-based coprocessor for text string extraction
TL;DR: The design and synthesis of a high-performance coprocessor to meet the compute load for image morphology operations is described and the algorithm has been synthesized for Splash 2, an attached processor on Sun hosts.
Proceedings ArticleDOI
A programmable processor for approximate string matching with high throughput rate
H.-M. Bluthgen,T.G. Noll +1 more
TL;DR: The algorithm and architecture of a processor for approximate string matching with high throughput rate is presented, dedicated for multimedia and information retrieval applications working on huge amounts of mass data where short response times are necessary.
Related Papers (5)
VLSI architecture for fast context-free language recognition (Earley's algorithm)
Yetung Chiang,K.S. Fu +1 more