Sciweavers

681 search results - page 129 / 137
» Parsing as Natural Deduction
Sort
View
COLING
1990
14 years 10 months 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
UAIS
2008
104views more  UAIS 2008»
14 years 9 months ago
A knowledge-based sign synthesis architecture
This paper presents the modules that comprise a knowledge-based sign synthesis architecture for Greek sign language (GSL). Such systems combine natural language (NL) knowledge, mac...
Stavroula-Evita Fotinea, Eleni Efthimiou, George C...
COLING
2002
14 years 9 months ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
ICTAI
2008
IEEE
15 years 4 months ago
Information Extraction as an Ontology Population Task and Its Application to Genic Interactions
Ontologies are a well-motivated formal representation to model knowledge needed to extract and encode data from text. Yet, their tight integration with Information Extraction (IE)...
Alain-Pierre Manine, Érick Alphonse, Philip...
90
Voted
SAT
2007
Springer
118views Hardware» more  SAT 2007»
15 years 3 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov