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

Necip Fazil Ayan

dblp:10/995 · DBLP profile ↗
← Back
14ranked-venue papers
6as first author
0since 2021 · last 2013
—ORCID · none

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

Artificial intelligence and machine learning · 9 · 5 first-authorGraphics, computer vision, multimedia, augmented reality and games · 6 · 1 first-authorDatabases, data management, data science and information retrieval · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Databases, data mining, and information retrieval
2 papers
Data mining · 76% Information retrieval · 24%
Artificial intelligence
1 paper
Machine translation · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Machine translation
machine translation evaluation
0.112006
Going Beyond AER: An Extensive Analysis of Word Alignments and Their Impact on MT · ACL 2006
Natural language and speech › Machine translation › statistical machine translation
word alignment
0.112006
Going Beyond AER: An Extensive Analysis of Word Alignments and Their Impact on MT · ACL 2006
Data mining › pattern mining
association rule mining
0.011999
An Efficient Algorithm to Update Large Itemsets with Early Pruning · KDD 1999
Data mining › pattern mining › itemset mining
frequent itemset mining
0.011999
An Efficient Algorithm to Update Large Itemsets with Early Pruning · KDD 1999
Data mining › pattern mining › frequent pattern mining
incremental frequent pattern mining
0.011999
An Efficient Algorithm to Update Large Itemsets with Early Pruning · KDD 1999
Data mining
pattern mining
0.011999
An Efficient Algorithm to Update Large Itemsets with Early Pruning · KDD 1999
Data mining
online mining
0.011999
An Efficient Algorithm to Update Large Itemsets with Early Pruning · KDD 1999

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

alignment error rate analysis · 0.1link analysis · 0.0citation analysis · 0.0early pruning · 0.0dynamic lookahead · 0.0
YearPublicationVenuePosition
2013 "Can you give me another word for hyperbaric?": Improving speech translation using targeted clarification questions
abstract
We present a novel approach for improving communication success between users of speech-to-speech translation systems by automatically detecting errors in the output of automatic speech recognition (ASR) and statistical machine translation (SMT) systems. Our approach initiates system-driven targeted clarification about errorful regions in user input and repairs them given user responses. Our system has been evaluated by unbiased subjects in live mode, and results show improved success of communication between users of the system.
Necip Fazil Ayan, Arindam Mandal, Michael W. Frandsen, Jing Zheng 0001, Peter Blasco, Andreas Kathol, Frédéric Béchet, Benoît Favre, Alex Marin, Tom Kwiatkowski, Mari Ostendorf, Luke Zettlemoyer, Philipp Salletmayr, Julia Hirschberg, Svetlana Stoyanchev
ICASSP1
2010 Automatic disfluency removal for improving spoken language translation
abstract
Statistical machine translation (SMT) systems for spoken languages suffer from conversational speech phenomena, in particular, the presence of speech disfluencies. We examine the impact of disfluencies from broadcast conversation data on our hierarchical phrase-based SMT system and implement automatic disfluency removal approaches for cleansing the MT input. We evaluate the efficacy of proposed approaches and investigate the impact of disfluency removal on SMT performance across different disfluency types. We show that for translating Mandarin broadcast conversational transcripts into English, our automatic disfluency removal approaches could produce significant improvement in BLEU and TER.
Wen Wang 0001, Gökhan Tür, Jing Zheng 0001, Necip Fazil Ayan
ICASSP4
2010 Implementing SRI's Pashto speech-to-speech translation system on a smart phone
abstract
We describe our recent effort implementing SRI's UMPC-based Pashto speech-to-speech (S2S) translation system on a smart phone running the Android operating system. In order to maintain very low latencies of system response on computationally limited smart phone platforms, we developed efficient algorithms and data structures and optimized model sizes for various system components. Our current Android-based S2S system requires less than one-fourth the system memory and significantly lower processor speed with a sacrifice of 15% relative loss of system accuracy, compared to a laptop-based platform.
Jing Zheng 0001, Arindam Mandal, Michael W. Frandsen, Necip Fazil Ayan, Dimitra Vergyri, Wen Wang 0001, Murat Akbacak, Kristin Precoda
SLT5
2009 Using syntax in large-scale audio document translation
abstract
Recently, the use of syntax has very effectively improved machine translation (MT) quality in many text translation tasks. However, using syntax in speech translation poses additional challenges because of disfluencies and other spoken language phenomena, and of errors introduced by automatic speech recognition (ASR). In this paper, we investigate the effect of using syntax in a large-scale audio document translation task targeting broadcast news and broadcast conversations. We do so by comparing the performance of three synchronous context-free grammar based translation approaches: 1) hierarchical phrase-based translation, 2) syntax-augmented MT, and 3) string-to-dependency MT. The results show a positive effect of explicitly using syntax when translating broadcast news, but no benefit when translating broadcast conversations. The results indicate that improving the robustness of syntactic systems against conversational language style is important to their success and requires future effort. Index Terms: syntax, machine translation, audio document
Jing Zheng 0001, Necip Fazil Ayan, Wen Wang 0001, David Burkett
INTERSPEECH2
2008 Improving Alignments for Better Confusion Networks for Combining Machine Translation Systems
Necip Fazil Ayan, Jing Zheng 0001, Wen Wang 0001
COLING1
2008 Development of SRI's translation systems for broadcast news and broadcast conversations
abstract
We present our recent work on developing large-vocabulary Arabic-to-English and Chinese-to-English speech-to-text translation systems for the January 2008 Global Autonomous Language Exploitation (GALE) retest evaluation. Two audio genres were involved in the evaluation: broadcast news and broadcast conversation. Our system, following the hierarchical phrase-based translation approach, has a two-pass decoding strategy, with the first-pass integrated search generating 3000 unique n-best lists, which are then reranked by several different language models in the second pass. We emphasize our work on adapting the system, which was mostly trained on text data, to the speech genres, including number tokenization, punctuation compensation, and various optimization techniques. We present our results on several different tuning and testing data sets used for system development. Index Terms : speech-to-text translation, hierarchical-phrasebased translation, n-best reranking
Jing Zheng 0001, Wen Wang 0001, Necip Fazil Ayan
INTERSPEECH3
2008 Efficient data selection for machine translation
abstract
Performance of statistical machine translation (SMT) systems relies on the availability of a large parallel corpus which is used to estimate translation probabilities. However, the generation of such corpus is a long and expensive process. In this paper, we introduce two methods for efficient selection of training data to be translated by humans. Our methods are motivated by active learning and aim to choose new data that adds maximal information to the currently available data pool. The first method uses a measure of disagreement between multiple SMT systems, whereas the second uses a perplexity criterion. We performed experiments on Chinese-English data in multiple domains and test sets. Our results show that we can select only one-fifth of the additional training data and achieve similar or better translation performance, compared to that of using all available data.
Arindam Mandal, Dimitra Vergyri, Wen Wang 0001, Jing Zheng 0001, Andreas Stolcke, Gökhan Tür, Dilek Hakkani-Tür, Necip Fazil Ayan
SLT8
2007 Combining Outputs from Multiple Machine Translation Systems
Antti-Veikko I. Rosti, Necip Fazil Ayan, Bing Xiang, Spyridon Matsoukas, Richard M. Schwartz, Bonnie J. Dorr
HLT-NAACL2
2006 Going Beyond AER: An Extensive Analysis of Word Alignments and Their Impact on MT
abstract
This paper presents an extensive evaluation of five different alignments and investigates their impact on the corresponding MT system output. We introduce new measures for intrinsic evaluations and examine the distribution of phrases and untranslated words during decoding to identify which characteristics of different alignments affect translation. We show that precision-oriented alignments yield better MT output (translating more words and using longer phrases) than recall-oriented alignments.
Necip Fazil Ayan, Bonnie J. Dorr
ACL1
2006 A Maximum Entropy Approach to Combining Word Alignments
Necip Fazil Ayan, Bonnie J. Dorr
HLT-NAACL1
2003 Rapid porting of DUSTer to Hindi
abstract
The frequent occurrence of divergences —structural differences between languages---presents a great challenge for statistical word-level alignment and machine translation. This paper describes the adaptation of DUSTer, a divergence unraveling package, to Hindi during the DARPA TIDES-2003 Surprise Language Exercise. We show that it is possible to port DUSTer to Hindi in under 3 days.
Bonnie J. Dorr, Necip Fazil Ayan, Nizar Habash, Nitin Madnani, Rebecca Hwa
ACM Trans. Asian Lang. Inf. Process.2
2002 Automating extraction of logical domains in a web site
Necip Fazil Ayan, Wen-Syan Li, Okan Kolak
Data Knowl. Eng.1
2001 Constructing multi-granular and topic-focused web site maps
abstract
Site maps are essential to assist users in navigating a Web site. Most of the site maps are constructed manually and are static. However, di erent users may have di erent preferences and purposes for using a Web site. For example, a user may want to see a more detailed map while another user prefers a more abstract map. Two users looking for di erent topics at a large portal site would bene t more from two site maps with di erent focuses than a single map. In this paper, we present a technique for automatically constructing multi-granular and topic-focused site maps by utilizing directory paths, page contents, and link structures. In these site maps, the Web site topology is preserved and document importance, indicated by citation and semantic relevancy to user's topics of interest, is used for prioritizing the presentation of pages and directories. Experiments on real Web data have been conducted to validate the usefulness of the technique.
Wen-Syan Li, Necip Fazil Ayan, Okan Kolak, Quoc Vu, Hajime Takano, Hisashi Shimamura
WWW2
1999 An Efficient Algorithm to Update Large Itemsets with Early Pruning
abstract
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions.UWEP employs a dynamic lookahead strategy in updating the existing large itemsets by detecting and removing those that will no longer remain large after the contribution of the new set of transactions.It differs from the other update algorithms by scanning the existing database at most once and the new database exactly once.Moreover, it generates and counts the minimum number of candidates in the new database.The experiments on synthetic data show that UWEP outperforms the existing algorithms in terms of the candidates generated and counted.
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arkun
KDD1