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.

Hitoshi Iida

dblp:41/5465 · DBLP profile ↗
← Back
33ranked-venue papers
6as first author
0since 2021 · last 2013
0000-0002-2180-9998ORCID · corroborated

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

Artificial intelligence and machine learning · 31 · 6 first-authorGraphics, computer vision, multimedia, augmented reality and games · 20 · 1 first-author

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
5 papers
Machine translation · 76% Information extraction and text analysis · 21% Question answering and dialogue systems · 3%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Performance modeling and evaluation · 64% Processor architecture and microarchitecture · 19% Parallel and multicore computing · 17%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

Topics — the 6 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Machine translation
example-based machine translation
0.021993
Example-Based Machine Translation on Massively Parallel Processors · IJCAI 1993
Experiments and Prospects of Example-Based Machine Translation · ACL 1991
Natural language and speech › Machine translation › rule-based machine translation
transfer-based machine translation
0.011997
Improving Performance of Transfer-Driven Machine Translation with Extra-Linguistic Informatioon from Context, Situation and Environment · IJCAI (2) 1997
Performance modeling and evaluation
workload characterization
0.011994
The Relationship between Architectures and Example-Retrieval Times · AAAI 1994
Programming languages and type systems › grammar formalisms
unification grammar
0.011988
Parsing Japanese Honorifics in Unification-Based Grammar · ACL 1988
Parallel and multicore computing › parallel architecture
massively parallel processor
0.011993
Example-Based Machine Translation on Massively Parallel Processors · IJCAI 1993
Natural language and speech › Machine translation
rule-based machine translation
0.011991
Experiments and Prospects of Example-Based Machine Translation · ACL 1991

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

parallel processing · 0.0example-based machine translation · 0.0transfer learning · 0.0extra-linguistic information · 0.0empirical measurement · 0.0unification · 0.0discourse information change rules · 0.0parallel computing · 0.0indexing · 0.0case patterns · 0.0
YearPublicationVenuePosition
2013 Prosodic changes pre-announcing a syntactic completion point in Japanese utterance
Yuichi Ishimoto, Mika Enomoto, Hitoshi Iida
INTERSPEECH3
2011 Projectability of Transition-Relevance Places Using Prosodic Features in Japanese Spontaneous Conversation
Yuichi Ishimoto, Mika Enomoto, Hitoshi Iida
INTERSPEECH3
2008 Emotion recognition in spontaneous emotional speech for anonymity-protected voice chat systems
Yoshiko Arimoto, Hiromi Kawatsu, Sumio Ohno, Hitoshi Iida
INTERSPEECH4
2008 Automatic Emotional Degree Labeling for Speakers' Anger Utterance during Natural Japanese Dialog
Yoshiko Arimoto, Sumio Ohno, Hitoshi Iida
LREC3
2007 Acoustic features of anger utterances during natural dialog
Yoshiko Arimoto, Sumio Ohno, Hitoshi Iida
INTERSPEECH3
1999 Prospects for advanced speech translation
abstract
Speech communication includes many important issues on natural language processing and they are related with desirable advanced speech translation systems. Advanced systems need to be able to handle the interaction for speech communication, pragmatics in speech, and arbitrariness of speech usage. General characteristics of speech communication are discussed. Also the various viewpoints regarding interaction, pragmatics, and arbitrary usage are discussed. Some of the present speech translation approaches are explained and new basic technologies are introduced. In this paper, a synthetic NLP technology such as a composite art form is proposed for speech communication and speech translation.
Hitoshi Iida
MTSummit1
1998 Example-based error recovery method for speech translation: repairing sub-trees according to the semantic distance
Kai Ishikawa, Eiichiro Sumita, Hitoshi Iida
ICSLP3
1998 A Japanese-to-English speech translation system: ATR-MATRIX
Toshiyuki Takezawa, Tsuyoshi Morimoto, Yoshinori Sagisaka, Nick Campbell 0001, Hitoshi Iida, Fumiaki Sugaya, Akio Yokoo, Seiichi Yamamoto
ICSLP5
1997 Improving Performance of Transfer-Driven Machine Translation with Extra-Linguistic Informatioon from Context, Situation and Environment
Hideki Mima, Osamu Furuse, Hitoshi Iida
IJCAI (2)3
1996 Incremental Translation Utilizing Constituent Boundary Patterns
Osamu Furuse, Hitoshi Iida
COLING2
1996 Spoken-Language Translation Method Using Examples
Hitoshi Iida, Eiichiro Sumita, Osamu Furuse
COLING1
1996 An evaluation of statistical language modeling for speech recognition using a mixed category of both words and parts-of-speech
abstract
In our previous paper, we proposed a mixed category of words and parts-of-speech names the MWP category based on class N-gram modeling [1].However, we had not conrmed the eciency of MWP category.In this paper, we evaluate the proposed MWP category.At rst we use \coverage of words and category sequences to open data" and \perplexity to training data" for the evaluation and we conrmed the characteristics of parts-of-speech are useful to for generating a suitable class N-gram modeling.As a result of the speech recognition experimentation, we also conrmed that the class N-gram modeling using MWP category is effective in improving the recognition rate for open data that shows a low coverage of words and category sequences, without decreasing the recognition rate much for closed data.
Yumi Wakita, Jun Kawai, Hitoshi Iida
ICSLP3
1995 Spoken dialogue translation technologies and speech translation
Hitoshi Iida
MTSummit1
1994 The Relationship between Architectures and Example-Retrieval Times
Eiichiro Sumita, Naoya Nisiyama, Hitoshi Iida
AAAI3
1994 Constituent Boundary Parsing for Example-Based Machine Translation
Osamu Furuse, Hitoshi Iida
COLING2
1994 A Bidirectional, Transfer-Driven Machine Translation System For Spoken Dialogues
Yasuhiro Sobashima, Osamu Furuse, Susumu Akamine, Jun Kawai, Hitoshi Iida
COLING5
1994 A dialog analysis using information of the previous sentence
Shin-ichiro Kamei, Shinichi Doi, Takako Komatsu, Susumu Akamine, Hitoshi Iida, Kazunori Muraki
ICSLP5
1994 A speech and language database for speech translation research
Tsuyoshi Morimoto, Noriyoshi Uratani, Toshiyuki Takezawa, Osamu Furuse, Yasuhiro Sobashima, Hitoshi Iida, Atsushi Nakamura, Yoshinori Sagisaka, Norio Higuchi, Yasuhiro Yamazaki
ICSLP6
1994 A corpus-based local context analysis for spoken dialogues
Yasuhiro Sobashima, Osamu Furuse, Hitoshi Iida
Speech Communication3
1993 Example-Based Machine Translation on Massively Parallel Processors
Eiichiro Sumita, Kozo Oi, Osamu Furuse, Hitoshi Iida, Tetsuya Higuchi, Naoto Takahashi, Hiroaki Kitano
IJCAI4
1992 Cooperation between Transfer and Analysis in Example-Based Framework
Osamu Furuse, Hitoshi Iida
COLING2
1992 Predicting Noun-Phrase Surface Forms Using Contextual Information
Takayuki Yamaoka, Hitoshi Iida, Hidekazu Arita
COLING2
1991 Experiments and Prospects of Example-Based Machine Translation
abstract
EBMT (Example-Based Machine Translation) is proposed. EBMT retrieves similar examples (pairs of source phrases, sentences, or texts and their translations) from a database of examples, adapting the examples to translate a new input. EBMT has the following features: (1) It is easily upgraded simply by inputting appropriate examples to the database; (2) It assigns a reliability factor to the translation result; (3) It is accelerated effectively by both indexing and parallel computing; (4) It is robust because of best-match reasoning; and (5) It well utilizes translator expertise. A prototype system has been implemented to deal with a difficult translation problem for conventional Rule-Based Machine Translation (RBMT), i.e., translating Japanese noun phrases of the form "N1 no N2" into English. The system has achieved about a 78% success rate on average. This paper explains the basic idea of EBMT, illustrates the experiment in detail, explains the broad applicability of EBMT to several difficult translation problems for RBMT and discusses the advantages of integrating EBMT with RBMT.
Eiichiro Sumita, Hitoshi Iida
ACL2
1991 Dialogue interpretation model and its application to next utterance prediction for spoken language processing
Takayuki Yamaoka, Hitoshi Iida
EUROSPEECH2
1991 Language processing in connection with speech translation at ATR interpreting telephony research laboratories
Akira Kurematsu, Hitoshi Iida, Tsuyoshi Morimoto, Kiyohiro Shikano
Speech Commun.2
1990 Three Typed Pragmatics for Dialogue Structure Analysis
Hitoshi Iida, Takayuki Yamaoka, Hidekazu Arita
COLING1
1990 A Method to Predict the Next Utterance Using a Four-Layered Plan Recognition Model
Takayuki Yamaoka, Hitoshi Iida
ECAI2
1990 Integration of speech recognition and language processing in spoken language translation system (SL-TRANS)
Tsuyoshi Morimoto, Kiyohiro Shikano, Hitoshi Iida, Akira Kurematsu
ICSLP3
1989 An experimental spoken natural dialogue translation system using a lexicon-driven grammar
Hitoshi Iida, Kiyoshi Kogure, Kei Yoshimoto, Teruaki Aizawa
EUROSPEECH1
1989 A massively parallel model of speech-to-speech dialog translation: a step toward interpreting telephony
Hiroaki Kitano, Hideto Tomabechi, Teruko Mitamura, Hitoshi Iida
EUROSPEECH4
1988 Parsing Japanese Honorifics in Unification-Based Grammar
abstract
This paper presents a unification-based approach to Japanese honorifics based on a version of HPSG (Head-driven Phrase Structure Grammar). Utterance parsing is based on lexical specifications of each lexical item, including honorifics, and a few general PSG rules using a parser capable of unifying cyclic feature structures. It is shown that the possible word orders of Japanese honorific predicate constituents can be automatically deduced in the proposed framework without independently specifying them. Discourse Information Change Rules (DICRs) that allow resolving a class of anaphors in honorific contexts are also formulated.
Hiroyuki Maeda, Susumu Kato, Kiyoshi Kogure, Hitoshi Iida
ACL4
1984 A Case Analysis Method Cooperating with ATNG and Its Application to Machine Translation
abstract
This paper present a new method for parsing English sentences. The parser called LUTE-EJ parser is combined with case analysis and ATNG-based analysis. LUTE-EJ parser has two interesting mechanical characteristics. One is providing a structured buffer, Structured Constituent Buffer, so as to hold previous fillers for a case structure, instead of case registers before a verb appears in a sentence. The other is extended HOLD mechanism(in ATN), in whose use an embedded clause, especially a "bedeleted" clause, is recursively analyzed by case analysis. This parser's features are (1)extracting a case filler, basically as a noun phrase, by ATNG-based analysis, including recursive case analysis, and (2)mixing syntactic and semantic analysis by using case frames in case analysis.
Hitoshi Iida
COLING1
1979 Experimental Japanese Language Question Answering System MSSS78 - Using Case Patterns with Procedures
Akira Shimazu, Hitoshi Iida
IJCAI2