Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Takefumi Yamazaki

dblp:25/565 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 1 first-authorComputer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Machine translation · 46% Knowledge representation and reasoning · 40% Information extraction and text analysis · 14%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Machine translation › parallel corpora
sentence alignment
0.011996
High-Performance Bilingual Text Alignment Using Statistical and Dictionary Information · ACL 1996
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition › ontology learning
concept hierarchy learning
0.011995
Learning Hierarchies from Ambiguous Natural Language Data · ICML 1995

Methods — techniques the papers use, named apart from their topics

statistical alignment · 0.0bilingual dictionary · 0.0natural language processing · 0.0
YearPublicationVenuePosition
2011 Designing HTIP: Home Network Topology Identifying Protocol
abstract
This paper introduces the design and functions of HTIP (Home network Topology Identifying Protocol), which can identify the home network topology and check the connectivity to end devices and/or network devices. Applications can utilize this information to perform the rapid, high-resolution fault localization needed if network services are not provided properly. The HTIP-manager agent collects the device and link information required for identifying the network's topology. In HTIP, end devices send device information via UDA while network devices send both device and link information via LLDP. HTIP is light weight, so any low performance device can implement it. We have already standardized HTIP in Japan, and are currently standardizing it in ITU-T.
Yoshiyuki Mihara, Takefumi Yamazaki, Takehiro Akama
ICC2
2001 Design and construction of a machine-tractable Japanese-Malay dictionary
abstract
We present a method for combining two bilingual dictionaries to make a third, using one language as a pivot. In this case we combine a Japanese-English dictionary with a Malay-English dictionary, to produce a Japanese-Malay dictionary suitable for use in a machine translation system. Our method differs from previous methods in its use of semantic classes to rank translation equivalents: word pairs with compatible semantic classes are preferred to those with dissimilar classes. We also experiment with the use of two pivot languages. We have made a prototype dictionary of over 75,000 pairs.
Francis Bond, Ruhaida Binti Sulong, Takefumi Yamazaki, Kentaro Ogura
MTSummit3
1997 High-performance bilingual text alignment using statistical and dictionary information
abstract
This paper describes an accurate and robust text alignment system for structurally different languages. Among structurally different languages such as Japanese and English, there is a limitation on the amount of word correspondences that can be statistically acquired. The main reason for this is the systems of functional (closed) words are quite different in the two languages. The proposed method makes use of two kinds of word correspondences in aligning bilingual texts. One is a bilingual dictionary of general use. The other is the word correspondences that are statistically acquired in the alignment process. Our method gradually determines sentence pairs (anchors) that correspond to each other by relaxing parameters. The method, by combining two kinds of word correspondences, achieves adequate word correspondences for complete alignment. As a result, texts of various length and of various genres in structurally different languages can be aligned with high precision. Experimental results show our system outperforms conventional methods for various kinds of Japanese–English texts.
Masahiko Haruno, Takefumi Yamazaki
Nat. Lang. Eng.2
1996 High-Performance Bilingual Text Alignment Using Statistical and Dictionary Information
abstract
This paper describes an accurate and robust text alignment system for structurally different languages. Among structurally different languages such as Japanese and English, there is a limitation on the amount of word correspondences that can be statistically acquired. The proposed method makes use of two kinds of word correspondences in aligning bilingual texts. One is a bilingual dictionary of general use. The other is the word correspondences that are statistically acquired in the alignment process. Our method gradually determines sentence pairs (anchors) that correspond to each other by relaxing parameters. The method, by combining two kinds of word correspondences, achieves adequate word correspondences for complete alignment. As a result, texts of various length and of various genres in structurally different languages can be aligned with high precision. Experimental results show our system outperforms conventional methods for various kinds of Japanese-English texts.
Masahiko Haruno, Takefumi Yamazaki
ACL2
1996 Learning Bilingual Collocations by Word-Level Sorting
Masahiko Haruno, Satoru Ikehara, Takefumi Yamazaki
COLING3
1995 Learning Hierarchies from Ambiguous Natural Language Data
Takefumi Yamazaki, Michael J. Pazzani, Christopher J. Merz
ICML1
1994 Two Methods for Learning ALT-J/E Translation Rules from Examples and a Semantic Hierarchy
Hussein Almuallim, Yasuhiro Akiba, Takefumi Yamazaki, Akio Yokoo, Shigeo Kaneda
COLING3