Sciweavers

66 search results - page 6 / 14
» An Optimal Tabular Parsing Algorithm
Sort
View
GRC
2007
IEEE
14 years 1 months ago
Enhancing Discovery of Web Services through Optimized Algorithms
This paper describes research in methods to discover Web Service Description Language (WSDL) documents. This work extends current discovery research through use of the Google Web ...
Janette Hicks, Madhusudhan Govindaraju, Weiyi Meng
ACL
1994
13 years 8 months ago
Optimizing the Computational Lexicalization of Large Grammars
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
Christian Jacquemin
ICML
2006
IEEE
14 years 7 months ago
Learning the structure of Factored Markov Decision Processes in reinforcement learning problems
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
Thomas Degris, Olivier Sigaud, Pierre-Henri Wuille...
EMNLP
2010
13 years 4 months ago
Turbo Parsers: Dependency Parsing by Approximate Variational Inference
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
André F. T. Martins, Noah A. Smith, Eric P....
DEXA
2007
Springer
154views Database» more  DEXA 2007»
14 years 26 days ago
Beyond Lazy XML Parsing
XML has become the standard format for data representation and exchange in domains ranging from Web to desktop applications. However, wide adoption of XML is hindered by inefficien...
Fernando Farfán, Vagelis Hristidis, Raju Ra...