Sciweavers

116 search results - page 13 / 24
» An Efficient Parsing Algorithm for Tree Adjoining Grammars
Sort
View
VLDB
1987
ACM
92views Database» more  VLDB 1987»
13 years 11 months ago
Mind Your Grammar: a New Approach to Modelling Text
Beginning to create the New Oxford English Dictionary database has resulted in the realization that databases for reference texts are unlike those for conventional enterprises. Wh...
Gaston H. Gonnet, Frank Wm. Tompa
ACL
1993
13 years 9 months ago
Automatic Grammar Induction and Parsing Free Text: A Transformation-Based Approach
In this paper we describe a new technique for parsing free text: a transformational grammar I is automatically learned that is capable of accurately parsing text into binary-branc...
Eric Brill
HIS
2008
13 years 9 months ago
Learning Spatial Grammars for Drawn Documents Using Genetic Algorithms
The problem of object recognition may be cast into a spatial grammar framework. This system comprises three novel elements: a spatial organisation of line features, an efficient t...
Simon J. Hickinbotham, Anthony G. Cohn
CICLING
2010
Springer
13 years 10 months ago
Systematic Processing of Long Sentences in Rule Based Portuguese-Chinese Machine Translation
The translation quality and parsing efficiency are often disappointed when Rule based Machine Translation systems deal with long sentences. Due to the complicated syntactic structu...
Francisco Oliveira, Fai Wong, Iok-Sai Hong
ACL
2010
13 years 5 months ago
Simple, Accurate Parsing with an All-Fragments Grammar
We present a simple but accurate parser which exploits both large tree fragments and symbol refinement. We parse with all fragments of the training set, in contrast to much recent...
Mohit Bansal, Dan Klein