Sciweavers

205 search results - page 15 / 41
» A CCG Approach to Free Word Order Languages
Sort
View
CPP
2011
107views more  CPP 2011»
12 years 7 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
IBERAMIA
2010
Springer
13 years 6 months ago
Improved Text Generation Using N-gram Statistics
Abstract. In Natural Language Generation (NLG) systems, a generalpurpose surface realisation module will usually require the underlying application to provide highly detailed input...
Eder Miranda de Novais, Thiago Dias Tadeu, Ivandr&...
ACL
2009
13 years 5 months ago
Part of Speech Tagger for Assamese Text
Assamese is a morphologically rich, agglutinative and relatively free word order Indic language. Although spoken by nearly 30 million people, very little computational linguistic ...
Navanath Saharia, Dhrubajyoti Das, Utpal Sharma, J...
CVPR
2003
IEEE
14 years 9 months ago
A Bayesian Framework for Fusing Multiple Word Knowledge Models in Videotext Recognition
Videotext recognition is challenging due to low resolution, diverse fonts/styles, and cluttered background. Past methods enhanced recognition by using multiple frame averaging, im...
DongQing Zhang, Shih-Fu Chang
CASSIS
2005
Springer
14 years 1 months ago
Information Flow Analysis for a Typed Assembly Language with Polymorphic Stacks
Abstract. We study secure information flow in a stack based Typed Assembly Language (TAL). We define a TAL with an execution stack and establish the soundness of its type system ...
Eduardo Bonelli, Adriana B. Compagnoni, Ricardo Me...