Sciweavers

1269 search results - page 77 / 254
» Learning Correction Grammars
Sort
View
111
Voted
VLDB
1991
ACM
196views Database» more  VLDB 1991»
15 years 4 months ago
Kaleidoscope Data Model for An English-like Query Language
Most database interfaces provide poor guidance on ad hoc query formulation, burdening users to learn, and to recall precisely the query language and the database. Kaleidoscope avo...
Sang Kyun Cha, Gio Wiederhold
NAACL
2010
14 years 10 months ago
From Baby Steps to Leapfrog: How "Less is More" in Unsupervised Dependency Parsing
We present three approaches for unsupervised grammar induction that are sensitive to data complexity and apply them to Klein and Manning's Dependency Model with Valence. The ...
Valentin I. Spitkovsky, Hiyan Alshawi, Daniel Jura...
EMNLP
2011
14 years 16 days ago
Inducing Sentence Structure from Parallel Corpora for Reordering
When translating among languages that differ substantially in word order, machine translation (MT) systems benefit from syntactic preordering—an approach that uses features fro...
John DeNero, Jakob Uszkoreit
ICDAR
2003
IEEE
15 years 6 months ago
A Segmentation Method for Bibliographic References by Contextual Tagging of Fields
In this paper, a method based on part-of-speech tagging (PoS) is used for bibliographic reference structure. This method operates on a roughly structured ASCII file, produced by O...
Dominique Besagni, Abdel Belaïd, Nelly Benet
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
15 years 5 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...