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

Patrick Schone

dblp:47/3564 · also Patrick John Schone · DBLP profile ↗
← Back
16ranked-venue papers
7as first author
0since 2021 · last 2018
—ORCID · none

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

Artificial intelligence and machine learning · 11 · 5 first-authorGraphics, computer vision, multimedia, augmented reality and games · 7 · 3 first-authorHuman-computer interaction and ubiquitous 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.

Human-computer interaction and pervasive computing
1 paper
Collaborative and social computing · 100%
Artificial intelligence
2 papers
Information extraction and text analysis · 95% Learning paradigms · 5%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Collaborative and social computing
crowdsourcing
0.212013
Quality control mechanisms for crowdsourcing: peer review, arbitration, & expertise at familysearch indexing · CSCW 2013
Natural language and speech › Information extraction and text analysis › named entity recognition
cross-lingual named entity recognition
0.112008
Mining Wiki Resources for Multilingual Named Entity Recognition · ACL 2008
Natural language and speech › Information extraction and text analysis
named entity recognition
0.112008
Mining Wiki Resources for Multilingual Named Entity Recognition · ACL 2008
Natural language and speech › Information extraction and text analysis › lexical semantics
multiword expression
0.012001
Is Knowledge-Free Induction of Multiword Unit Dictionary Headwords a Solved Problem? · EMNLP 2001
Knowledge graphs › knowledge graph construction › knowledge extraction
wikipedia-based knowledge extraction
0.012008
Mining Wiki Resources for Multilingual Named Entity Recognition · ACL 2008
Machine learning › Learning paradigms
unsupervised learning
0.012001
Is Knowledge-Free Induction of Multiword Unit Dictionary Headwords a Solved Problem? · EMNLP 2001

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

historical data analysis · 0.2field experiment · 0.2wiki resource mining · 0.2
YearPublicationVenuePosition
2018 Neural Text Line Segmentation of Multilingual Print and Handwriting with Recognition-Based Evaluation
abstract
We present a novel method for detecting text lines in historical handwritten and printed document images. Our hybrid technique begins by leveraging deep neural networks to perform multi-class pixel-wise prediction. The predictor not only discovers text and graphics pixels in the document, but it is also designed to automatically adhere contiguous regions from the same text line while also predicting buffers that prevent disassociated text lines from merging. The system breaks neural "ties" through dynamic programming. To the best of our knowledge, our system is the first neural system to predict the entire perimeters of full text lines. Also, to aid in scaling and full-scope awareness, the network during training is initially given small regions of the image to study and then expands its scope to full images as training continues. Our goal for line segmentation is to enable automatic transcription on huge heterogenous collections of historical images, so we use transcription accuracy as our metric. We document and leverage our state-of-the-art transcription system as an evaluation harness for scoring our segmenter along with various other competitor segmenters. We then show the effectiveness of our system as it relates to other systems by comparing it to both known data sets (IAM) and to three 50K-word "in the wild" test sets consisting of (a) US handwritten wills and deeds, (b) US historical newsprint images, and (c) Spanish Church and Government records.
Patrick Schone, Christian Hargraves, Jon Morrey, Rachael Day, Mindy Jacox
ICFHR1
2014 Corpus and Evaluation of Handwriting Recognition of Historical Genealogical Records
Patrick Schone, Heath E. Nielson, Mark Ward
LREC1
2013 Quality control mechanisms for crowdsourcing: peer review, arbitration, & expertise at familysearch indexing
abstract
The FamilySearch Indexing project has enabled hundreds of thousands of volunteers to transcribe billions of records, making it one of the largest crowdsourcing initiatives in the world. Assuring high quality transcriptions (i.e., indexes) with a reasonable amount of volunteer effort is essential to keep pace with the mounds of newly digitized documents. Using historical data, we show the relationship between prior experience and native language on transcriber agreement. We then present a field experiment comparing the effectiveness (accuracy) and efficiency (time) of two quality control mechanisms: (1) Arbitration -- the existing mechanism wherein two volunteers independently transcribe records and disagreements go to an arbitrator, and (2) Peer Review -- a mechanism wherein one volunteer's work is reviewed by another volunteer. Peer Review is significantly more efficient, though not as effective for certain fields as Arbitration. Design suggestions for FamilySearch Indexing and related crowdsourcing initiatives are provided.
Derek L. Hansen, Patrick Schone, Douglas Corey, Matthew Reid, Jake Gehring
CSCW2
2011 Bootstrapping Multilingual Relation Discovery Using English Wikipedia and Wikimedia-Induced Entity Extraction
abstract
Relation extraction has been a subject of significant study over the past decade. Most relation extractors have been developed by combining the training of complex computational systems on large volumes of annotations with extensive rule writing by language experts. Moreover, many relation extractors are reliant on other non-trivial NLP technologies which themselves are developed through significant human efforts, such as entity tagging, parsing, etc. Due to the high cost of creating and assembling the required resources, relation extractors have typically been developed for only high-resourced languages. In this paper, we describe a near-zero-cost methodology to build relation extractors for significantly distinct non-English languages using only freely available Wikipedia and other web documents, and some knowledge of English. We apply our methodology and build alma-mater, birthplace, father, occupation, and spouse relation extractors in Greek, Spanish, Russian, and Chinese. We conduct evaluations of induced relations at the file level which are the most refined we have seen in the literature.
Patrick Schone, Tim Allison, Chris Giannella, Craig Pfeifer
ICTAI1
2010 An Evaluation of Technologies for Knowledge Base Population
Paul McNamee, Hoa Trang Dang, Heather Simpson, Patrick Schone, Stephanie M. Strassel
LREC4
2008 Mining Wiki Resources for Multilingual Named Entity Recognition
Alexander E. Richman, Patrick Schone
ACL2
2008 Learning Named Entity Hyponyms for Question Answering
Paul McNamee, Rion Snow, Patrick Schone, James Mayfield
IJCNLP3
2006 Low-resource autodiacritization of abjads for speech keyword search
Patrick Schone
INTERSPEECH1
2004 Mandarin-English Information (MEI): investigating translingual speech retrieval
Helen M. Meng, Berlin Chen, Sanjeev Khudanpur, Gina-Anne Levow, Wai Kit Lo, Douglas W. Oard, Patrick Schone, Karen Tang, Hsin-Min Wang, Jianqiang Wang 0002
Comput. Speech Lang.7
2003 Novel approaches to Arabic speech recognition: report from the 2002 Johns-Hopkins Summer Workshop
abstract
Although Arabic is currently one of the most widely spoken languages in the world, there has been relatively little speech recognition research on Arabic compared to other languages. Moreover, most previous work has concentrated on the recognition of formal rather than dialectal Arabic. This paper reports on our project at the 2002 Johns Hopkins Summer Workshop, which focused on the recognition of dialectal Arabic. Three problems were addressed: (a) the lack of short vowels and other pronunciation information in Arabic texts; (b) the morphological complexity of Arabic; and (c) the discrepancies between dialectal and formal Arabic. We present novel approaches to automatic vowel restoration, morphology-based language modeling and the integration of out-of-corpus language model data, and report significant word error rate improvements on the LDC Arabic CallHome task.
Katrin Kirchhoff, Jeff A. Bilmes, Sourin Das, Nicolae Duta, Melissa Egan, Gang Ji, John Henderson, Daben Liu, Mohammed Noamany, Patrick Schone, Richard M. Schwartz, Dimitra Vergyri
ICASSP (1)11
2003 Language-reconfigurable universal phone recognition
Brenton D. Walker, Bradley C. Lackey, Jennifer S. Muller, Patrick Schone
INTERSPEECH4
2001 Is Knowledge-Free Induction of Multiword Unit Dictionary Headwords a Solved Problem?
Patrick Schone, Daniel Jurafsky
EMNLP1
2001 Multi-scale-audio indexing for translingual spoken document retrieval
abstract
MEI (Mandarin-English Information) is an English-Chinese crosslingual spoken document retrieval (CL-SDR) system developed during the Johns Hopkins University Summer Workshop 2000. We integrate speech recognition, machine translation, and information retrieval technologies to perform CL-SDR. MEI advocates a multi-scale paradigm, where both Chinese words and subwords (characters and syllables) are used in retrieval. The use of subword units can complement the word unit in handling the problems of Chinese word tokenization ambiguity, Chinese homophone ambiguity, and out-of-vocabulary words in audio indexing. This paper focuses on multi-scale audio indexing in MEI. Experiments are based on the Topic Detection and Tracking Corpora (TDT-2 and TDT-3), where we indexed Voice of America Mandarin news broadcasts by speech recognition on both the word and subword scales. We discuss the development of the MEI syllable recognizer, the representations of spoken documents using overlapping subword n-grams and lattice structures. Results show that augmenting words with subwords is beneficial to CL-SDR performance.
Hsin-Min Wang, Helen M. Meng, Patrick Schone, Berlin Chen, Wai Kit Lo
ICASSP3
2001 Multi-scale retrieval in MEI: an English-Chinese translingual speech retrieval system
abstract
This paper presents a multi-scale retrieval approach in MEI (Mandarin-English Information), an English-Chinese crosslingual spoken document retrieval (CL-SDR) system. It accepts an entire English news story (from newspaper text) as the input query, and automatically retrieves Mandarin news stories (from broadcast audio). This allows the user to search for personally relevant content across the language and media barriers – a cross-lingual and cross-media retrieval task. MEI advocates a multi-scale paradigm for the retrieval task. Multiscale refers to the use of both words and subwords (Chinese characters and syllables) for retrieval. Words offer lexical knowledge to enhance precision, and subwords can potentially alleviate some prevailing problems in CL-SDR, e.g. open vocabularies in translation and recognition, out-of-vocabulary words in audio indexing, and ambiguities in Chinese homophones and word tokenizaiton. We present techniques for word-subword fusion, which improved retrieval performance in our experiments with the Topic Detection and Tracking collection.
Wai Kit Lo, Patrick Schone, Helen M. Meng
INTERSPEECH2
2001 Knowledge-Free Induction of Inflectional Morphologies
Patrick Schone, Daniel Jurafsky
NAACL1
1996 A Dictionary Based Method for Determining Topics in Text and Transcribed Speech
abstract
An automatic technique which attempts to determine and cluster topical information in text and transcribed speech is described. The method uses an electronic dictionary which is recursively closed. The method identifies each word of a given excerpt of text by its root form in the dictionary and a salience is affixed. The salience from each individual word is then propagated to those terms which define it, which terms may themselves be propagated. Thus, each word in the excerpt spawns a directed graph of dictionary words and related weights. A combining function is then applied to the union of these graphs which enhances any mutual information. The N words with the largest combined scores are identified as either the topic or words pertaining to the topic. These top N words and their scores can then be used in cross-message correlations as a means to cluster topics.
Patrick Schone, Douglas J. Nelson
ICASSP1