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

Martin Franz

dblp:81/6493 · DBLP profile ↗
← Back
41ranked-venue papers
15as first author
5since 2021 · last 2025
0000-0001-6697-3022ORCID · corroborated

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

Artificial intelligence and machine learning · 19 · 4 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 13 · 3 first-authorDatabases, data management, data science and information retrieval · 12 · 8 first-author · 2 since 2021Security and privacy · 5 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorTheory of computation · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

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
12 papers
Information retrieval · 82% Data integration and cleaning · 16% Data mining · 2%
Artificial intelligence
3 papers
Transfer learning and domain adaptation · 99% Machine translation · 1%
Network and information security
1 paper
Cryptographic protocols and secure computation · 100%

Topics — the 27 heaviest of 32, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation
0.712023
UDAPDR: Unsupervised Domain Adaptation via LLM Prompting and Distillation of Rerankers · EMNLP 2023
Information retrieval › document retrieval
passage retrieval
0.712023
UDAPDR: Unsupervised Domain Adaptation via LLM Prompting and Distillation of Rerankers · EMNLP 2023
Information retrieval
reranking
0.712023
UDAPDR: Unsupervised Domain Adaptation via LLM Prompting and Distillation of Rerankers · EMNLP 2023
Information retrieval › retrieval models
neural retrieval
0.612022
Entity-Conditioned Question Generation for Robust Attention Distribution in Neural Information Retrieval · SIGIR 2022
Information retrieval › retrieval models
retrieval model training
0.612022
Entity-Conditioned Question Generation for Robust Attention Distribution in Neural Information Retrieval · SIGIR 2022
Data integration and cleaning › data generation
synthetic data generation
0.612022
Entity-Conditioned Question Generation for Robust Attention Distribution in Neural Information Retrieval · SIGIR 2022
Information retrieval
evaluation
0.242007
User-oriented text segmentation evaluation measure · SIGIR 2007
Building an information retrieval test collection for spontaneous conversational speech · SIGIR 2004
Influence of speech recognition errors on topic detection · SIGIR 2000
Cryptographic protocols and secure computation
garbled circuits
0.112012
Secure two-party computations in ANSI C · CCS 2012
Cryptographic protocols and secure computation › secure multiparty computation
secure two-party computation
0.112012
Secure two-party computations in ANSI C · CCS 2012
Machine learning › Transfer learning and domain adaptation
domain adaptation
0.112020
The TechQA Dataset · ACL 2020
Information retrieval
cross-language information retrieval
0.132007
Quantifying the Utility of Parallel Corpora · SIGIR 2001
Machine Translation and Monolingual Information Retrieval (poster abstract) · SIGIR 1999
Story segmentation of broadcast news in Arabic, Chinese and English using multi-window features · SIGIR 2007
Information retrieval › text analysis
text segmentation
0.112007
Story segmentation of broadcast news in Arabic, Chinese and English using multi-window features · SIGIR 2007
Information retrieval › evaluation › test collection
test collection construction
0.012004
Building an information retrieval test collection for spontaneous conversational speech · SIGIR 2004
Audio and music processing
speech recognition
0.012004
Automatic recognition of spontaneous speech for access to multilingual oral history archives · IEEE Trans. Speech Audio Process. 2004
Multimedia analysis and retrieval › video content analysis
topic segmentation
0.012004
Automatic recognition of spontaneous speech for access to multilingual oral history archives · IEEE Trans. Speech Audio Process. 2004
Information retrieval › text analysis › topic analysis
topic detection and tracking
0.022001
Influence of speech recognition errors on topic detection · SIGIR 2000
Unsupervised and Supervised Clustering for Topic Tracking · SIGIR 2001
Information retrieval › indexing
index compression
0.012002
How Many Bits are Needed to Store Term Frequencies? · SIGIR 2002
Data mining › clustering
document clustering
0.012001
Unsupervised and Supervised Clustering for Topic Tracking · SIGIR 2001
Information retrieval › information filtering
topic tracking
0.012001
Unsupervised and Supervised Clustering for Topic Tracking · SIGIR 2001
Information retrieval › ranking › relevance estimation
relevance scoring
0.012000
Word document density and relevance scoring · SIGIR 2000
Information retrieval
retrieval models
0.012000
Word document density and relevance scoring · SIGIR 2000
Data mining › text mining
topic detection
0.012000
Influence of speech recognition errors on topic detection · SIGIR 2000
Data mining › dimensionality reduction › feature selection
feature ranking
0.011998
A Method for Scoring Correlated Features in Query Expansion · SIGIR 1998
Information retrieval › query reformulation
query expansion
0.011998
A Method for Scoring Correlated Features in Query Expansion · SIGIR 1998
Information retrieval › document retrieval
spoken document retrieval
0.012004
Building an information retrieval test collection for spontaneous conversational speech · SIGIR 2004
Information retrieval
term frequency
0.012002
How Many Bits are Needed to Store Term Frequencies? · SIGIR 2002
Information retrieval › text analysis › text corpus analysis
word frequency distribution
0.012000
Word document density and relevance scoring · SIGIR 2000

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

knowledge distillation · 1.3LLM prompting · 1.3targeted synthetic data generation · 0.6neural information retrieval · 0.6dataset construction · 0.4garbled circuits · 0.1user-oriented evaluation · 0.1multi-window features · 0.1maximum entropy · 0.1unsupervised clustering · 0.1search-guided relevance assessment · 0.0nearest neighbor · 0.0automatic speech recognition · 0.0
YearPublicationVenuePosition
2025 Automated Single-Turn Solution Recommendation System for Software IT Support Tickets
Paulina Toro Isaza, Michael Nidd, Noah Zheutlin, Jae-wook Ahn, Chidansh Amitkumar Bhatt, Yu Deng 0004, Ruchi Mahindru, Martin Franz, Hans Florian, Salim Roukos
IEEE Big Data8
2023 UDAPDR: Unsupervised Domain Adaptation via LLM Prompting and Distillation of Rerankers
abstract
Jon Saad-Falcon, Omar Khattab, Keshav Santhanam, Radu Florian, Martin Franz, Salim Roukos, Avirup Sil, Md Sultan, Christopher Potts. Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing. 2023.
Jon Saad-Falcon, Omar Khattab, Keshav Santhanam, Radu Florian, Martin Franz, Salim Roukos, Avirup Sil, Md. Arafat Sultan, Christopher Potts
EMNLP5
2022 Towards Robust Neural Retrieval with Source Domain Synthetic Pre-Finetuning
abstract
Research on neural IR has so far been focused primarily on standard supervised learning settings, where it outperforms traditional term matching baselines. Many practical use cases of such models, however, may involve previously unseen target domains. In this paper, we propose to improve the out-of-domain generalization of Dense Passage Retrieval (DPR) - a popular choice for neural IR - through synthetic data augmentation only in the source domain. We empirically show that pre-finetuning DPR with additional synthetic data in its source domain (Wikipedia), which we generate using a fine-tuned sequence-to-sequence generator, can be a low-cost yet effective first step towards its generalization. Across five different test sets, our augmented model shows more robust performance than DPR in both in-domain and zero-shot out-of-domain evaluation.
Revanth Gangi Reddy, Vikas Yadav, Md. Arafat Sultan, Martin Franz, Vittorio Castelli, Heng Ji 0001, Avirup Sil
COLING4
2022 Learning Cross-Lingual IR from an English Retriever
abstract
Yulong Li, Martin Franz, Md Arafat Sultan, Bhavani Iyer, Young-Suk Lee, Avirup Sil. Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 2022.
Martin Franz, Md. Arafat Sultan, Bhavani Iyer, Young-Suk Lee 0001, Avirup Sil
NAACL-HLT2
2022 Entity-Conditioned Question Generation for Robust Attention Distribution in Neural Information Retrieval
abstract
We show that supervised neural information retrieval (IR) models are prone to learning sparse attention patterns over passage tokens, which can result in key phrases including named entities receiving low attention weights, eventually leading to model under-performance. Using a novel targeted synthetic data generation method that identifies poorly attended entities and conditions the generation episodes on those, we teach neural IR to attend more uniformly and robustly to all entities in a given passage. On two public IR benchmarks, we empirically show that the proposed method helps improve both the model's attention patterns and retrieval performance, including in zero-shot settings.
Revanth Gangi Reddy, Md. Arafat Sultan, Martin Franz, Avirup Sil, Heng Ji 0001
SIGIR3
2020 The TechQA Dataset
abstract
Vittorio Castelli, Rishav Chakravarti, Saswati Dana, Anthony Ferritto, Radu Florian, Martin Franz, Dinesh Garg, Dinesh Khandelwal, Scott McCarley, Michael McCawley, Mohamed Nasr, Lin Pan, Cezar Pendus, John Pitrelli, Saurabh Pujar, Salim Roukos, Andrzej Sakrajda, Avi Sil, Rosario Uceda-Sosa, Todd Ward, Rong Zhang. Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics. 2020.
Vittorio Castelli, Rishav Chakravarti, Saswati Dana, Anthony Ferritto, Radu Florian, Martin Franz, Dinesh Garg, Dinesh Khandelwal, J. Scott McCarley, Mike McCawley, Mohamed Nasr, Lin Pan 0003, Cezar Pendus, John F. Pitrelli, Saurabh Pujar, Salim Roukos, Andrej Sakrajda, Avirup Sil, Rosario Uceda-Sosa, Todd Ward, Rong Zhang 0010
ACL6
2017 On compiling Boolean circuits optimized for secure multi-party computation
Niklas Büscher, Martin Franz, Andreas Holzer, Helmut Veith, Stefan Katzenbeisser 0001
Formal Methods Syst. Des.2
2014 CBMC-GC: An ANSI C Compiler for Secure Two-Party Computations
Martin Franz, Andreas Holzer, Stefan Katzenbeisser 0001, Christian Schallhart, Helmut Veith
CC1
2013 The first workshop on language support for privacy-enhancing technologies (PETShop'13)
abstract
The Workshop on Language Support for Privacy-Enhancing Technologies (PETShop'13) aims at bringing together researchers from the areas of security, programming languages, compiler construction, and program verification to exchange ideas and research results to improve the practicality of state of the art cryptographic privacy-enhancing technologies.
Martin Franz, Andreas Holzer, Rupak Majumdar, Bryan Parno, Helmut Veith
CCS1
2013 Secure computations on non-integer values with applications to privacy-preserving sequence analysis
Martin Franz, Björn Deiseroth, Kay Hamacher, Somesh Jha, Stefan Katzenbeisser 0001, Heike Schröder
Inf. Secur. Tech. Rep.1
2012 Secure two-party computations in ANSI C
abstract
The practical application of Secure Two-Party Computation is hindered by the difficulty to implement secure computation protocols. While recent work has proposed very simple programming languages which can be used to specify secure computations, it is still difficult for practitioners to use them, and cumbersome to translate existing source code into this format. Similarly, the manual construction of two-party computation protocols, in particular ones based on the approach of garbled circuits, is labor intensive and error-prone.
Andreas Holzer, Martin Franz, Stefan Katzenbeisser 0001, Helmut Veith
CCS2
2010 Redactable Signatures for Tree-Structured Data: Definitions and Constructions
Christopher Brzuska, Heike Schröder, Özgür Dagdelen, Marc Fischlin, Martin Franz, Stefan Katzenbeisser 0001, Mark Manulis, Cristina Onete, Andreas Peter 0001, Bertram Poettering, Dominique Schröder
ACNS5
2010 Learning to Predict Readability using Diverse Linguistic Features
Rohit J. Kate, Xiaoqiang Luo, Siddharth Patwardhan, Martin Franz, Radu Florian, Raymond J. Mooney, Salim Roukos, Christopher A. Welty
COLING4
2009 Privacy-Preserving Face Recognition
Zekeriya Erkin, Martin Franz, Jorge Guajardo, Stefan Katzenbeisser 0001, Reginald L. Lagendijk, Tomas Toft
Privacy Enhancing Technologies2
2008 A methodology and tool suite for evaluation of accuracy of interoperating statistical natural language processing engines
abstract
Evaluation of accuracy of natural language processing (NLP) engines plays an important role in their development and im-provement. Such evaluation usually takes place at a per-engine level. For example, there are evaluation methods for engines such as speech recognition, machine translation, story bound-ary detection, etc. Many real-world applications require combi-nations of these functions. This has become possible now with NLP engines attaining sufficient accuracy to be able to combine them for complex tasks. However, it is not evident how the ac-curacy of output of such aggregates of engines will be evaluated. We present an evaluation methodology to address this problem. The key contribution of our work is an extensible methodology that narrows down possible combinations of machine outputs and ground truths to be compared at various stages in an aggre-gate of interoperating engines. We also describe two example evaluation modules that we developed following this methodol-ogy. Index Terms: evaluation, accuracy, natural language process-ing, NLP, interoperation, UIMA
Uma Murthy, John F. Pitrelli, Ganesh N. Ramaswamy, Martin Franz, Burn L. Lewis
INTERSPEECH4
2008 Aggregating distributed STT, MT, and information extraction engines: the GALE interoperability-demo system
John F. Pitrelli, Burn L. Lewis, Edward A. Epstein, Martin Franz, Daniel Kiecza, Jerome L. Quinn, Ganesh N. Ramaswamy, Amit Srivastava, Paola Virga
INTERSPEECH4
2007 User-oriented text segmentation evaluation measure
abstract
The paper describes a user oriented performance evaluation measure for text segmentation. Experiments show that the proposed measure differentiates well between error distributions with varying user impact.
Martin Franz, J. Scott McCarley, Jian-Ming Xu
SIGIR1
2007 Story segmentation of broadcast news in Arabic, Chinese and English using multi-window features
abstract
The paper describes a maximum entropy based story segmentation system for Arabic, Chinese and English. In experiments with broadcast news data from TDT-3, TDT-4, and corpora collected in the DARPA GALE project we obtain a substantial performance gain using multiple overlapping windows for text-based features.
Martin Franz, Jian-Ming Xu
SIGIR1
2004 Building an information retrieval test collection for spontaneous conversational speech
abstract
Test collections model use cases in ways that facilitate evaluation of information retrieval systems. This paper describes the use of search-guided relevance assessment to create a test collection for retrieval of spontaneous conversational speech. Approximately 10,000 thematically coherent segments were manually identified in 625 hours of oral history interviews with 246 individuals. Automatic speech recognition results, manually prepared summaries, controlled vocabulary indexing, and name authority control are available for every segment. Those features were leveraged by a team of four relevance assessors to identify topically relevant segments for 28 topics developed from actual user requests. Search-guided assessment yielded sufficient inter-annotator agreement to support formative evaluation during system development. Baseline results for ranked retrieval are presented to illustrate use of the collection.
Douglas W. Oard, Dagobert Soergel, David S. Doermann, G. Craig Murray, Jianqiang Wang 0002, Bhuvana Ramabhadran, Martin Franz, Samuel Gustman, James Mayfield, Liliya Kharevych, Stephanie M. Strassel
SIGIR8
2004 Automatic recognition of spontaneous speech for access to multilingual oral history archives
abstract
Much is known about the design of automated systems to search broadcast news, but it has only recently become possible to apply similar techniques to large collections of spontaneous speech. This paper presents initial results from experiments with speech recognition, topic segmentation, topic categorization, and named entity detection using a large collection of recorded oral histories. The work leverages a massive manual annotation effort on 10 000 h of spontaneous speech to evaluate the degree to which automatic speech recognition (ASR)-based segmentation and categorization techniques can be adapted to approximate decisions made by human annotators. ASR word error rates near 40% were achieved for both English and Czech for heavily accented, emotional and elderly spontaneous speech based on 65-84 h of transcribed speech. Topical segmentation based on shifts in the recognized English vocabulary resulted in 80% agreement with manually annotated boundary positions at a 0.35 false alarm rate. Categorization was considerably more challenging, with a nearest-neighbor technique yielding F=0.3. This is less than half the value obtained by the same technique on a standard newswire categorization benchmark, but replication on human-transcribed interviews showed that ASR errors explain little of that difference. The paper concludes with a description of how these capabilities could be used together to search large collections of recorded oral histories.
William J. Byrne, David S. Doermann, Martin Franz, Samuel Gustman, Jan Hajic 0001, Douglas W. Oard, Michael Picheny, Josef Psutka, Bhuvana Ramabhadran, Dagobert Soergel, Todd Ward, Wei-Jing Zhu
IEEE Trans. Speech Audio Process.3
2003 Automated transcription and topic segmentation of large spoken archives
abstract
Digital archives have emerged as the pre-eminent method for capturing the human experience. Before such archives can be used efficiently, their contents must be described. The scale of such archives along with the associated content mark up cost make it impractical to provide access via purely manual means, but automatic technologies for search in spoken materials still have relatively limited capabilities. The NSF-funded MALACH project will use the world’s largest digital archive of video oral histories, collected by the Survivors of the Shoah Visual History Foundation (VHF) to make a quantum leap in the ability to access such archives by advancing the state-of-the-art in Automated Speech Recognition (ASR), Natural Language Processing (NLP) and related technologies [1, 2]. This corpus consists of over 115,000 hours of unconstrained, natural speech from 52,000 speakers in 32 different languages, filled with disfluencies, heavy accents, age-related coarticulations, and un-cued speaker and language switching. This paper discusses some of the ASR and NLP tools and technologies that we have been building for the English speech in the MALACH corpus. We also discuss this new test bed while emphasizing the unique characteristics of this corpus. 1.
Martin Franz, Bhuvana Ramabhadran, Todd Ward, Michael Picheny
INTERSPEECH1
2003 TIPS: A Translingual Information Processing System
Yaser Al-Onaizan, Radu Florian, Martin Franz, Hany Hassan, Young-Suk Lee 0001, J. Scott McCarley, Kishore Papineni, Salim Roukos, Jeffrey S. Sorensen, Christoph Tillmann, Todd Ward
HLT-NAACL3
2002 Semantic indexing of multimedia using audio, text and visual cues
abstract
We describe methods for automatic labeling of high-level semantic concepts in documentary style videos. The emphasis of this paper is on audio processing and on fusing information from multiple modalities. The work described represents initial work towards a trainable system that acquires a collection of generic "intermediate" semantic concepts across modalities (such as audio, video, text) and combines information from these modalities for automatic labeling of a "high-level" concept. Initial results suggest that multi-modal fusion achieves a 12.5% relative improvement over the best unimodal model.
Giridharan Iyengar, Harriet J. Nock, Chalapathy Neti, Martin Franz
ICME (2)4
2002 How Many Bits are Needed to Store Term Frequencies?
abstract
Search algorithms in most current text retrieval systems use index data structures extracted from the original text documents. In this paper we focus on reducing the size of the indices by reducing the amount of space dedicated to store term frequencies. In experiments using TREC Ad Hoc [2, 3] corpora and query sets, we show that it is possible to store the term frequency in only two bits without decreasing retrieval performance.
Martin Franz, J. Scott McCarley
SIGIR1
2001 Speech recognition for DARPA Communicator
abstract
We report the results of investigations in acoustic modeling, language modeling and decoding techniques, for the DARPA Communicator, a speaker-independent, telephone-based dialog system. By a combination of methods, including enlarging the acoustic model, augmenting the recognizer vocabulary, conditioning the language model upon the dialog state, and applying a post-processing decoding method, we lowered the overall word error rate from 21.9% to 15.0%, a gain of 6.9% absolute and 31.5% relative.
Andrew Aaron, Scott Saobing Chen, Paul S. Cohen, Satya Dharanipragada, Ellen Eide, Martin Franz, Jean-Michel LeRoux, X. Luo, Benoît Maison, Lidia Mangu, T. Mathes, Miroslav Novak, Peder A. Olsen, Michael Picheny, Harry Printz, Bhuvana Ramabhadran, Andrej Sakrajda, George Saon, Borivoj Tydlitát, Karthik Visweswariah, D. Yuk
ICASSP6
2001 Topic styles in IR and TDT: effect on system behavior
abstract
The TREC Spoken Document Retrieval Track (SDR) and the Topic Detection and Tracking (TDT) project have annotated the same corpus with difference styles of relevance judgements, using differenct notions of topic. We compare the behavior of a topic tracking system using relevance judgements from TDT with that of the same system using relevance from the SDR in order to investigate the influence of differences document relevance judgements on the behavior of the tracking system.
Martin Franz, J. Scott McCarley, Todd Ward, Wei-Jing Zhu
INTERSPEECH1
2001 Question Answering Using Maximum-Entropy Components
Abraham Ittycheriah, Martin Franz, Wei-Jing Zhu, Adwait Ratnaparkhi
NAACL2
2001 Unsupervised and Supervised Clustering for Topic Tracking
abstract
We investigate important differences between two styles of document clustering in the context of Topic Detection and Tracking. Converting a Topic Detection system into a Topic Tracking system exposes fundamental differences between these two tasks that are important to consider in both the design and the evaluation of TDT systems. We also identify features that can be used in systems for both tasks.
Martin Franz, J. Scott McCarley, Todd Ward, Wei-Jing Zhu
SIGIR1
2001 Quantifying the Utility of Parallel Corpora
abstract
Our English-Chinese cross-language IR system is trained from parallel corpora; we investigate its performance as a function of training corpus size for three different training corpora. We find that the performance of the system as trained on the three parallel corpora can be related by a simple measure, namely the out-of-vocabulary rate of query words.
Martin Franz, J. Scott McCarley, Todd Ward, Wei-Jing Zhu
SIGIR1
2000 Statistical methods for topic segmentation
Satya Dharanipragada, Martin Franz, J. Scott McCarley, Kishore Papineni, Salim Roukos, Todd Ward, Wei-Jing Zhu
INTERSPEECH2
2000 Semantic tokenization of verbalized numbers in language modeling
Xiaoqiang Luo, Martin Franz
INTERSPEECH2
2000 Word document density and relevance scoring
abstract
Previous work addressing the issue of word distribution in documents has shown the importance of Word repetitiveness as an indicator of the word content-bearing characteristics. In this paper we propose a simple method using a measure of the tendency of words to repeat within a document to separate the words with similar document frequencies, but different topic discriminating characteristics. We describe the application of the new measure in query-document relevance scoring. Experiments on the TREC Ad Hoc and Spoken Document Retrieval tasks [7] show useful performance improvements.
Martin Franz, J. Scott McCarley
SIGIR1
2000 Influence of speech recognition errors on topic detection
abstract
We investigate the effect of speech-recognition errors on a system for the unsupervised, nearly synchronous clustering of broadcast news stories, using the TDT (Topic Detection and Tracking) Corpora. Two questions are addressed: (1) Are speech recognition errors detrimental to the performance of the system? (2) Can a background collection of contemporaneous clean text improve performance? We investigate both the large-cluster and small-cluster limits.
J. Scott McCarley, Martin Franz
SIGIR2
1999 Phrase splicing and variable substitution using the IBM trainable speech synthesis system
abstract
This paper describes a phrase splicing and variable substitution system which offers an intermediate form of automated speech production lying in-between the extremes of recorded utterance playback and full text-to-speech synthesis. The system incorporates a trainable speech synthesiser and an application specific set of pre-recorded phrases. The text to be synthesised is converted to a phone sequence using phone sequences present in the pre-recorded phrases wherever possible, and a pronunciation dictionary elsewhere. The synthesis inventory of the synthesiser is augmented with the synthesis information associated with the pre-recorded phrases used to construct the phone sequence. The synthesiser then performs a dynamic programming search over the augmented inventory to select a segment sequence to produce the output speech. The system enables the seamless splicing of pre-recorded phrases both with other phrases and with synthetic speech. It enables very high quality speech to be produced automatically within a limited domain.
Robert E. Donovan, Martin Franz, Jeffrey S. Sorensen, Salim Roukos
ICASSP2
1999 The IBM conversational telephony system for financial applications
abstract
We describe our development work on a telephonebased conversational system in the domain of mutual fund transactions. This system uses several components including robust large vocabulary continuous speech recognition, natural language understanding, dialog management, and text-to-speech synthesis technologies.
K. Davies, Robert E. Donovan, Mark Epstein, Martin Franz, Abraham Ittycheriah, Ea-Ee Jan, Jean-Michel LeRoux, David M. Lubensky, Chalapathy Neti, Mukund Padmanabhan, Kishore Papineni, Salim Roukos, Andrej Sakrajda, Jeffrey S. Sorensen, Borivoj Tydlitát, Todd Ward
EUROSPEECH4
1999 Story segmentation and topic detection for recognized speech
abstract
We present a technique for the segmention of a sound track into two classes of segments. Each frame of signal is preprocessed by extracting cepstral coefficients and their first order derivatives. For each class, the distribution of the frame parameter vectors is modeled by a Gaussian Mixture Model (GMM). GMM order is selected using two criteria : the Minimum Description Length (MDL) criterion and the Akaike Information Criterion (AIC). Frame score is based on a weighted loglikelihood ratio in a window around the frame. Decision for each frame is taken by comparing its score to a threshold. Experiments are presented on speech / music segmentation in audio tracks. In these experiments, the MDL criterion leads to a reasonable GMM order. Using the MDL criterion for GMM order selection, frame classification error rate is around 20%. However, using GMMs with much lower orders, only decreases marginally performances.
Satya Dharanipragada, Martin Franz, J. Scott McCarley, Salim Roukos, Todd Ward
EUROSPEECH2
1999 Reducing search complexity in low perplexity tasks
Martin Franz, Miroslav Novak
EUROSPEECH1
1999 Machine Translation and Monolingual Information Retrieval (poster abstract)
abstract
No abstract available.
Martin Franz, J. Scott McCarley
SIGIR1
1998 A Method for Scoring Correlated Features in Query Expansion
abstract
No abstract available.
Martin Franz, Salim Roukos
SIGIR1
1996 An Architectural Study of a Massively Parallel Processor for Convolution-Type Operations in Complex Vision Tasks
Martin Franz, René Schüffny
ICANN1
1995 Performance of the IBM large vocabulary continuous speech recognition system on the ARPA Wall Street Journal task
abstract
In this paper we discuss various experimental results using our continuous speech recognition system on the Wall Street Journal task. Experiments with different feature extraction methods, varying amounts and type of training data, and different vocabulary sizes are reported.
Lalit R. Bahl, S. Balakrishnan-Aiyer, Jerome R. Bellegarda, Martin Franz, Ponani S. Gopalakrishnan, David Nahamoo, Miroslav Novak, Mukund Padmanabhan, Michael Picheny, Salim Roukos
ICASSP4