Hideto Tomabechi


2005

pdf bib
A Novel Method for Content Consistency and Efficient Full-text Search for P2P Content Sharing Systems
Hideki Mima | Hideto Tomabechi
Companion Volume to the Proceedings of Conference including Posters/Demos and tutorial abstracts

1992

pdf bib
Quasi-Destructive Graph Unification with Structure-Sharing
Hideto Tomabechi
COLING 1992 Volume 2: The 15th International Conference on Computational Linguistics

1991

pdf bib
Quasi-Destructive Graph Unification
Hideto Tomabechi
Proceedings of the Second International Workshop on Parsing Technologies

Graph unification is the most expensive part of unification-based grammar parsing. It often takes over 90% of the total parsing time of a sentence. We focus on two speed-up elements in the design of unification algorithms: 1) elimination of excessive copying by only copying successful unifications, 2) Finding unification failures as soon as possible. We have developed a scheme to attain these two criteria without expensive overhead through temporarily modifying graphs during unification to eliminate copying during unification. The temporary modification is invalidated in constant time and therefore, unification can continue looking for a failure without the overhead associated with copying. After a successful unification because the nodes are temporarily prepared for copying, a fast copying can be performed without overhead for handling reentrancy, loops and variables. We found that parsing relatively long sentences (requiring about 500 unifications during a parse) using our algorithm is 100 to 200 percent faster than parsing the same sentences using Wroblewski’s algorithm.

pdf bib
Quasi-Destructive Graph Unification
Hideto Tomabechi
29th Annual Meeting of the Association for Computational Linguistics

1989

pdf bib
Ambiguity Resolution in the DMTRANS PLUS
Hiroaki Kitano | Hideto Tomabechi | Lori Levin
Fourth Conference of the European Chapter of the Association for Computational Linguistics

1988

pdf bib
Application of the Direct Memory Access paradigm to natural language interlaces to knowledge-based systems
Hideto Tomabechi | Masaru Tomita
Coling Budapest 1988 Volume 2: International Conference on Computational Linguistics