Sciweavers

AAAI
2012
12 years 1 months ago
Ontological Smoothing for Relation Extraction with Minimal Supervision
Relation extraction, the process of converting natural language text into structured knowledge, is increasingly important. Most successful techniques use supervised machine learni...
Congle Zhang, Raphael Hoffmann, Daniel S. Weld
ACL
2012
12 years 1 months ago
Learning to "Read Between the Lines" using Bayesian Logic Programs
Most information extraction (IE) systems identify facts that are explicitly stated in text. However, in natural language, some facts are implicit, and identifying them requires â€...
Sindhu Raghavan, Raymond J. Mooney, Hyeonseo Ku
ACL
2011
13 years 3 months ago
Knowledge-Based Weak Supervision for Information Extraction of Overlapping Relations
Information extraction (IE) holds the promise of generating a large-scale knowledge base from the Web’s natural language text. Knowledge-based weak supervision, using structured...
Raphael Hoffmann, Congle Zhang, Xiao Ling, Luke S....
COLING
2010
13 years 6 months ago
A Semantic Network Approach to Measuring Relatedness
Humans are very good at judging the strength of relationships between two terms, a task which, if it can be automated, would be useful in a range of applications. Systems attempti...
Brian Harrington
CIKM
2010
Springer
13 years 9 months ago
Index structures for efficiently searching natural language text
Many existing indexes on text work at the document granularity and are not effective in answering the class of queries where the desired answer is only a term or a phrase. In this...
Pirooz Chubak, Davood Rafiei
ACL
2010
13 years 9 months ago
Learning 5000 Relational Extractors
Many researchers are trying to use information extraction (IE) to create large-scale knowledge bases from natural language text on the Web. However, the primary approach (supervis...
Raphael Hoffmann, Congle Zhang, Daniel S. Weld
FUIN
2006
98views more  FUIN 2006»
13 years 11 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
ESA
2010
Springer
161views Algorithms» more  ESA 2010»
14 years 18 days ago
Top-k Ranked Document Search in General Text Databases
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...
J. Shane Culpepper, Gonzalo Navarro, Simon J. Pugl...
COLING
1990
14 years 20 days ago
Information Extraction and Semantic Constraints
We consider the problem of extracting specified types of information from natural language text. To properly analyze the text, we wish to apply semantic (selectional) constraints ...
Ralph Grishman, John Sterling
NAACL
1994
14 years 24 days ago
(Almost) Automatic Semantic Feature Extraction from Technical Text
Acquisition of semantic information is necessary for proper understanding of natural language text. Such information is often domain-speclfic in nature and must be acquized from t...
Rajeev Agarwal