Sciweavers

615 search results - page 56 / 123
» Unsupervised Semantic Parsing
Sort
View
EACL
2003
ACL Anthology
15 years 3 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
IPM
2008
159views more  IPM 2008»
15 years 1 months ago
Exploring syntactic structured features over parse trees for relation extraction using kernel methods
Extracting semantic relationships between entities from text documents is challenging in information extraction and important for deep information processing and management. This ...
Min Zhang, Guodong Zhou, AiTi Aw
CLEF
2007
Springer
15 years 8 months ago
MIRACLE at GeoCLEF Query Parsing 2007: Extraction and Classification of Geographical Information
This paper describes the participation of MIRACLE research consortium at the Query Parsing task of GeoCLEF 2007. Our system is composed of three main modules. First, the Named Geo...
Sara Lana-Serrano, Julio Villena-Román, Jos...
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 5 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
GG
2004
Springer
15 years 7 months ago
Parsing String Generating Hypergraph Grammars
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of...
Sebastian Seifert, Ingrid Fischer