A hardware algorithm for high speed morpheme extraction and its implementation

Authors:
Toshikazu Fukushima;Yutaka Ohyama;Hitoshi Miyai
Affiliations:
C&C Systems Research Laboratories, NEC Corporation, Miyamae-ku, Kawasaki City, Kanagawa, Japan;C&C Systems Research Laboratories, NEC Corporation, Miyamae-ku, Kawasaki City, Kanagawa, Japan;C&C Systems Research Laboratories, NEC Corporation, Miyamae-ku, Kawasaki City, Kanagawa, Japan
Venue:
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Year:
1990

Citing 8
Cited 0

A parallel parsing system for natural language analysis

Proceedings on Third international conference on logic programming
Parallel time O (log n) recognition of unambiguous context-free languages

Information and Computation
Content-Addressable and Associative Memory: Alternatives to the Ubiquitous RAM

Computer
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
A sentence analysis method for a Japanese book reading machine for the blind

ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
A morphological recognizer with syntactic and phonological rules

COLING '86 Proceedings of the 11th coference on Computational linguistics
A dictionary and morphological analyser for English

COLING '86 Proceedings of the 11th coference on Computational linguistics
A Kana-Kanji translation system for non-segmented input sentences based on syntactic and semantic analysis

COLING '86 Proceedings of the 11th coference on Computational linguistics

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper describes a new hardware algorithm for morpheme extraction and its implementation on a specific machine (MEX-I), as the first step toward achieving natural language parsing accelerators. It also shows the machine's performance, 100--1,000 times faster than a personal computer. This machine can extract morphemes from 10,000 character Japanese text by searching an 80,000 morpheme dictionary in 1 second. It can treat multiple text streams, which are composed of character candidates, as well as one text stream. The algorithm is implemented on the machine in linear time for the number of candidates, while conventional sequential algorithms are implemented in combinational time.