Not enough data to create a plot.
Try a different view from the menu above.
Soderland, Stephen
Adapting Open Information Extraction to Domain-Specific Relations
Soderland, Stephen (University of Washington) | Roof, Brendan (University of Washington) | Qin, Bo (University of Washington) | Xu, Shi (University of Washington) | Mausam, - (University of Washington) | Etzioni, Oren (University of Washington)
Information extraction (IE) can identify a set of relations from free text to support question answering (QA). Until recently, IE systems were domain-specific and needed a combination of manual engineering and supervised learning to adapt to each target domain. A new paradigm, Open IE operates on large text corpora without any manual tagging of relations, and indeed without any pre-specified relations. We explore the steps needed to adapt Open IE to a domain-specific ontology and demonstrate our approach of mapping domain-independent tuples to an ontology using domains from DARPA's Machine Reading Project.
Adapting Open Information Extraction to Domain-Specific Relations
Soderland, Stephen (University of Washington) | Roof, Brendan (University of Washington) | Qin, Bo (University of Washington) | Xu, Shi (University of Washington) | Mausam, - (University of Washington) | Etzioni, Oren (University of Washington)
Information extraction (IE) can identify a set of relations from free text to support question answering (QA). Until recently, IE systems were domain-specific and needed a combination of manual engineering and supervised learning to adapt to each target domain. A new paradigm, Open IE operates on large text corpora without any manual tagging of relations, and indeed without any pre-specified relations. Due to its open-domain and open-relation nature, Open IE is purely textual and is unable to relate the surface forms to an ontology, if known in advance. We explore the steps needed to adapt Open IE to a domain-specific ontology and demonstrate our approach of mapping domain-independent tuples to an ontology using domains from DARPA’s Machine Reading Project. Our system achieves precision over 0.90 from as few as 8 training examples for an NFL-scoring domain.
Panlingual Lexical Translation via Probabilistic Inference
Mausam, ' (University of Washington) | (University of Washington) | Soderland, Stephen (University of Washington) | Etzioni, Oren
The bare minimum lexical resource required to translate between a pair of languages is a translation dictionary. Unfortunately, dictionaries exist only between a tiny fraction of the 49 million possible language-pairs making machine translation virtually impossible between most of the languages. This paper summarizes the last four years of our research motivated by the vision of panlingual communication. Our research comprises three key steps. First, we compile over 630 freely available dictionaries over the Web and convert this data into a single representation – the translation graph. Second, we build several inference algorithms that infer translations between word pairs even when no dictionary lists them as translations. Finally, we run our inference procedure offline to construct PANDICTIONARY– a sense-distinguished, massively multilingual dictionary that has translations in more than 1000 languages. Our experiments assess the quality of this dictionary and find that we have 4 times as many translations at a high precision of 0.9 compared to the English Wiktionary, which is the lexical resource closest to PANDICTIONARY.