Sciweavers

360 search results - page 49 / 72
» Dependency Parsing
Sort
View
EMNLP
2009
13 years 5 months ago
Unsupervised Semantic Parsing
We present the first unsupervised approach to the problem of learning a semantic parser, using Markov logic. Our USP system transforms dependency trees into quasi-logical forms, r...
Hoifung Poon, Pedro Domingos
ACL
2011
12 years 11 months ago
A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
Michael Auli, Adam Lopez
ACL
2004
13 years 9 months ago
Head-Driven Parsing for Word Lattices
We present the first application of the head-driven statistical parsing model of Collins (1999) as a simultaneous language model and parser for largevocabulary speech recognition....
Christopher Collins, Bob Carpenter, Gerald Penn
ACL
2012
11 years 10 months ago
A Comparison of Chinese Parsers for Stanford Dependencies
Stanford dependencies are widely used in natural language processing as a semanticallyoriented representation, commonly generated either by (i) converting the output of a constitu...
Wanxiang Che, Valentin I. Spitkovsky, Ting Liu
ADBIS
2010
Springer
203views Database» more  ADBIS 2010»
13 years 6 months ago
Detecting XML Functional Dependencies through Formal Concept Analysis
Abstract. As XML becomes a popular data representation and exchange format over the web, XML schema design has become an important research area. Formal Concept Analysis (FCA) has ...
Katalin Tunde Janosi-Rancz, Viorica Varga, Timea N...