An Agent-based Parallel HPSG Parser for Shared-memory Parallel Machines.
نویسندگان
چکیده
منابع مشابه
An Agent-based Parallel HPSG Parser for Shared-memory Parallel Machines
We describe an agent-based parallel HPSG parser that operates on shared-memory parallel machines. It efficiently parses real-world corpora by using a wide-coverage HPSG grammar. The efficiency is due to the use of a parallel parsing algorithm and the efficient treatment of feature structures. The parsing algorithm is based on the CKY algorithm, in which resolving constraints between a mother an...
متن کاملParallel Sequence Mining on Shared-Memory Machines
We present pSPADE, a parallel algorithm for fast discovery of frequent sequences in large databases. pSPADE decomposes the original search space into smaller suffix-based classes. Each class can be solved in main-memory using efficient search techniques, and simple join operations. Further each class can be solved independently on each processor requiring no synchronization. However, dynamic in...
متن کاملParallel Graph Generation Algorithms for Shared and Distributed Memory Machines
In this paper we give an overview and a comparison of two parallel algorithms for the state space generation in stochastic modeling on common classes of multiprocessors In this context state space generation simply means constructing a graph which usually gets extremely large On shared memory machines the key problem for a parallelization is the implementation of a shared data structure which e...
متن کاملParallel Algorithms for Shared-memory Machines. a Standard Wasteful Implementation
10 technique enables a simple cost-eeective implementation with little eeort. It was used for the rst time to implement a fast optimal parallel hashing algorithm 7]. The hashing algorithm in 7] comprises two parts: the rst part is a randomized geometric decaying algorithm which runs for O(lg lg n) steps. By using the technique of this paper and the O(lg lg n) time load balancing of 6], this par...
متن کاملAn Efficient Parallel Substrate tor Typed Feature Structures on Shared Memory Parallel Machines
This paper describes an efficient parallel system for processing Typed Feature Structures (TFSs) on shared-memory parallel machines. We call the system Parallel Substrate for TFS (PSTFS}. PSTFS is designed for parallel computing environments where a large number of agents are working and communicating with each other. Such agents use PSTFS as their low-level module for solving constraints on TF...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Natural Language Processing
سال: 2001
ISSN: 1340-7619,2185-8314
DOI: 10.5715/jnlp.8.21