Grant: Discovery Grants Program - Individual
Dalhousie University
$21,000.00
Harmonized string-based and unification-based methodology for text mining and processing
FY 2008-09
Summary
The importance of information availability and Internet is clearly evident in many areas, from a personal level to a general society effect, such as in economy, health care, or scientific research. While general search engines seem to provide a frequently satisfactory document and site retrieval, based on short ad-hoc queries, there is still an enormous time-consuming manual effort required to gather data, filter it, organize it, and use it in the actual tasks that a user wants to get accomplished. Here, we propose to develop three different core natural language processing methodologies that will make a strong contribution to solving this information management problem. Beside the theoretical results, we develop several tools that actually implement designed solutions, and we also apply these methodologies and tools to specific application areas.
Our focus is on the methods for (1) Common N-gram analysis, (2) Regular Expression based and finite state processing, and (3) unification-based processing and matching of typed feature structures; with an effort to harmonize these fairly different techniques. The developed software systems include tools for n-gram based text mining (Ngrams.pm and Swordfish), Starfish -- a text preprocessing and embedded programming tool, the question answering system Jellyfish, the system with typed feature structures in Java -- Stefs, and Shrack -- a peer-to-peer system for scientific information dissemination. The application areas include textual mining, authorship attribution, web usage and web content mining, dementia detection of Alzheimer type from spontaneous speech, phylogenetic tree generation, malicious code detection, bio-medical semantic text annotation, and knowledge management in eScience.
The N-gram model, regular expressions, and unification-base approach have been known concepts in NLP. The novelty of our approach lies in a specific methodologies developed on top of these models: specific profiling and distance functions used with n-grams, iterative regular expression substitutions, and modifications to classical unification, such as relaxed unification.
Program
Discovery Grants Program - Individual
Recipient
Location
Nova Scotia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
262059-2008
Name nom
Keselj, Vlado
Department département
Computer Science, Faculty of
Organization id
79
Institution établissement
Dalhousie University
Province en
Nova Scotia
Province fr
Nouvelle-Écosse
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2008
Award amount
21000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2801
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Natural language and speech understanding
Research subject fr
Langage naturel et reconnaissance de la parole
Partie
1
Nb partie
5
Application title
Harmonized string-based and unification-based methodology for text mining and processing
Keyword
NA
Application summary
The importance of information availability and Internet is clearly evident in many areas, from a personal level to a general society effect, such as in economy, health care, or scientific research. While general search engines seem to provide a frequently satisfactory document and site retrieval, based on short ad-hoc queries, there is still an enormous time-consuming manual effort required to gather data, filter it, organize it, and use it in the actual tasks that a user wants to get accomplished. Here, we propose to develop three different core natural language processing methodologies that will make a strong contribution to solving this information management problem. Beside the theoretical results, we develop several tools that actually implement designed solutions, and we also apply these methodologies and tools to specific application areas.
Our focus is on the methods for (1) Common N-gram analysis, (2) Regular Expression based and finite state processing, and (3) unification-based processing and matching of typed feature structures; with an effort to harmonize these fairly different techniques. The developed software systems include tools for n-gram based text mining (Ngrams.pm and Swordfish), Starfish -- a text preprocessing and embedded programming tool, the question answering system Jellyfish, the system with typed feature structures in Java -- Stefs, and Shrack -- a peer-to-peer system for scientific information dissemination. The application areas include textual mining, authorship attribution, web usage and web content mining, dementia detection of Alzheimer type from spontaneous speech, phylogenetic tree generation, malicious code detection, bio-medical semantic text annotation, and knowledge management in eScience.
The N-gram model, regular expressions, and unification-base approach have been known concepts in NLP. The novelty of our approach lies in a specific methodologies developed on top of these models: specific profiling and distance functions used with n-grams, iterative regular expression substitutions, and modifications to classical unification, such as relaxed unification.