Sciweavers

62 search results - page 3 / 13
» Polish parsers, step by step
Sort
View
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 7 months ago
Towards Effective Sentence Simplification for Automatic Processing of Biomedical Text
The complexity of sentences characteristic to biomedical articles poses a challenge to natural language parsers, which are typically trained on large-scale corpora of non-technica...
Siddhartha Jonnalagadda, Luis Tari, Jörg Hake...
INTERSPEECH
2010
13 years 2 months ago
Rapid bootstrapping of five eastern european languages using the rapid language adaptation toolkit
This paper presents our latest efforts toward LVCSR systems for five Eastern European languages such as Bulgarian, Croatian, Czech, Polish, and Russian using our Rapid Language Ad...
Ngoc Thang Vu, Tim Schlippe, Franziska Kraus, Tanj...
ACL
2011
12 years 11 months ago
Temporal Restricted Boltzmann Machines for Dependency Parsing
We propose a generative model based on Temporal Restricted Boltzmann Machines for transition based dependency parsing. The parse tree is built incrementally using a shiftreduce pa...
Nikhil Garg, James Henderson
ASPDAC
1999
ACM
107views Hardware» more  ASPDAC 1999»
13 years 11 months ago
New Multilevel and Hierarchical Algorithms for Layout Density Control
Certain manufacturing steps in very deep submicron VLSI involve chemical-mechanical polishing CMP which has varying e ects on device and interconnect features, depending on loca...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Alex...
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
14 years 4 days ago
Dependently Typed Grammars
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
Kasper Brink, Stefan Holdermans, Andres Löh