Sciweavers

20 search results - page 4 / 4
» A Learnable Constraint-based Grammar Formalism
Sort
View
GRAMMARS
1998
111views more  GRAMMARS 1998»
13 years 4 months ago
Quantitative Comparison of Languages
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
András Kornai
JUCS
2006
141views more  JUCS 2006»
13 years 4 months ago
Constraint Based Methods for Biological Sequence Analysis
: The need for processing biological information is rapidly growing, owing to the masses of new information in digital form being produced at this time. Old methodologies for proce...
Maryam Bavarian, Verónica Dahl
EACL
1993
ACL Anthology
13 years 5 months ago
Disjunctions and Inheritance in the Context Feature Structure System
Substantial efforts have been made in order to cope with disjunctions in constraint based grammar formalisms (e.g. [Kasper, 1987; Maxwell and Kaplan, 1991; DSrre and Eisele, 1990]...
Martin Böttcher
JMLR
2010
134views more  JMLR 2010»
12 years 11 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
ACL
1993
13 years 5 months ago
Parsing Free Word Order Languages in the Paninian Framework
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
Akshar Bharati, Rajeev Sangal