Sciweavers

17 search results - page 2 / 4
» The Complexity of Recognition of Linguistically Adequate Dep...
Sort
View
ACL
1997
13 years 7 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
NAACL
2010
13 years 3 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...
CIARP
2009
Springer
13 years 3 months ago
Incorporating Linguistic Information to Statistical Word-Level Alignment
Abstract. Parallel texts are enriched by alignment algorithms, thus establishing a relationship between the structures of the implied languages. Depending on the alignment level, t...
Eduardo Cendejas, Grettel Barceló, Alexande...
LREC
2010
153views Education» more  LREC 2010»
13 years 7 months ago
Developing a Deep Linguistic Databank Supporting a Collection of Treebanks: the CINTIL DeepGramBank
Corpora of sentences annotated with grammatical information have been deployed by extending the basic lexical and morphological data with increasingly complex information, such as...
António Branco, Francisco Costa, Joã...
NAACL
2010
13 years 3 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea