Results 1  10
of
620
A Theory of Program Size Formally Identical to Information Theory
, 1975
"... A new definition of programsize complexity is made. H(A;B=C;D) is defined to be the size in bits of the shortest selfdelimiting program for calculating strings A and B if one is given a minimalsize selfdelimiting program for calculating strings C and D. This differs from previous definitions: (1) ..."
Abstract

Cited by 380 (15 self)
 Add to MetaCart
A new definition of programsize complexity is made. H(A;B=C;D) is defined to be the size in bits of the shortest selfdelimiting program for calculating strings A and B if one is given a minimalsize selfdelimiting program for calculating strings C and D. This differs from previous definitions: (1
Logophors in possessed picture noun phrases
 Proceedings of the 21st West Coast Conference on Formal Linguistics
, 2002
"... There have been two main approaches to "picture " NPs (PNPs) containing pronouns and reflexives like (1): (1) a. John saw a picture of him on the wall. b. John saw a picture of himself on the wall The "standard " Binding Theory (BT) view (e.g., Chomsky 1981, 1986) claims that pro ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
commanding antecedent) in some minimal domain D (=the minimal phrase containing a referential specifier). BT Condition B, for pronouns, requires that pronouns be free (=not bound) in D.
Model With Minimal Translation Units, But Decode With Phrases
, 2013
"... Ngrambased models coexist with their phrasebased counterparts as an alternative SMT framework. Both techniques have pros and cons. While the Ngrambased framework provides a better model that captures both source and target contexts and avoids spurious phrasal segmentation, the ability to memor ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Ngrambased models coexist with their phrasebased counterparts as an alternative SMT framework. Both techniques have pros and cons. While the Ngrambased framework provides a better model that captures both source and target contexts and avoids spurious phrasal segmentation, the ability
Optimal Growth in Phrase Structure
"... This article claims that some familiar properties of phrase structure reflect laws of form. It is shown that optimal sequencing of recursive Merge operations so as to dynamically minimize ccommand and containment relations in unlabeled branching forms leads to structural correlates of projection. T ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
This article claims that some familiar properties of phrase structure reflect laws of form. It is shown that optimal sequencing of recursive Merge operations so as to dynamically minimize ccommand and containment relations in unlabeled branching forms leads to structural correlates of projection
Class phrase models for language modeling
 In Proceedings of ICSLP
, 1996
"... Previous attempts to automatically determine multiwords as the basic unit for language modeling have been successful for extending bigram models [10, 9, 2, 8] to improve the perplexity ofthelanguage model and/or the word accuracy of the speech decoder. However, none ofthese techniques gave improvem ..."
Abstract

Cited by 28 (4 self)
 Add to MetaCart
improvements over the trigram model so far, except for the rather controlled ATIS task [8]. We therefore propose an algorithm, that minimizes the perplexity improvement ofa bigram model directly. The new algorithm is able to reduce the trigram perplexity andalso achieves word accuracy improvements
Bayesian extraction of minimal scfg rules for hierarchical phrasebased translation
 In Proceedings of the Sixth Workshop on SMT
, 2011
"... We present a novel approach for extracting a minimal synchronous contextfree grammar (SCFG) for Hierostyle statistical machine translation using a nonparametric Bayesian framework. Our approach is designed to extract rules that are licensed by the word alignments and heuristically extracted phras ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
and the automatic identification of commonly reused rules. We show that our Bayesian model is able to extract minimal set of hierarchical phrase rules without impacting the translation quality as measured by the BLEU score. 1
Phrase Structure Sets
"... In this talk, we discuss a structure representation system that replaces Phrase Structure (PS) trees with setbased representations of relational structures. The goal is to restrict the expressive power of the grammar at the foundational level. In this respect, it is the same sort of endeavour as St ..."
Abstract
 Add to MetaCart
In this talk, we discuss a structure representation system that replaces Phrase Structure (PS) trees with setbased representations of relational structures. The goal is to restrict the expressive power of the grammar at the foundational level. In this respect, it is the same sort of endeavour
On directionality of phrase structure building
, 2013
"... Minimalism, in grammatical theorizing (Chomsky 1995) led to simpler linguistic devices and a better focalization of the core properties of the structurebuilding engine: a lexicon and a free (recursive) phrase formation operation, dubbed Merge, are the basic components that serve in building syntact ..."
Abstract
 Add to MetaCart
Minimalism, in grammatical theorizing (Chomsky 1995) led to simpler linguistic devices and a better focalization of the core properties of the structurebuilding engine: a lexicon and a free (recursive) phrase formation operation, dubbed Merge, are the basic components that serve in building
Late Adjunction and Minimalist Phrase Structure
 Syntax
, 2001
"... An algorithm of phrase structure building is proposed within the bare phrase structure framework. The algorithm is rooted in the idea that applications of Merge  the operation that combines syntactic objects  should not change the set of basic relations (in particular, ccommand) in the exist ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
An algorithm of phrase structure building is proposed within the bare phrase structure framework. The algorithm is rooted in the idea that applications of Merge  the operation that combines syntactic objects  should not change the set of basic relations (in particular, c
Key words and phrases. Optimal shape, minimization problem, first Dirichlet eigenvalue,
, 2000
"... Abstract. We consider the following eigenvalue optimization problem: Given a bounded domain Ω ⊂ R n and numbers α ≥ 0, A ∈ [0, Ω], find a subset D ⊂ Ω of area A for which the first Dirichlet eigenvalue of the operator − ∆ + αχD is as small as possible. We prove existence of solutions and investiga ..."
Abstract
 Add to MetaCart
Abstract. We consider the following eigenvalue optimization problem: Given a bounded domain Ω ⊂ R n and numbers α ≥ 0, A ∈ [0, Ω], find a subset D ⊂ Ω of area A for which the first Dirichlet eigenvalue of the operator − ∆ + αχD is as small as possible. We prove existence of solutions and investigate their qualitative properties. For example, we show that for some symmetric domains (thin annuli and dumbbells with narrow handle) optimal solutions must possess fewer symmetries than Ω; on the other hand, for convex Ω reflection symmetries are preserved. Also, we present numerical results and formulate some conjectures suggested by them. 1. Problem and Main Results We study qualitative properties of solutions of a certain eigenvalue optimization problem. In physical terms, the problem can be stated as follows: Problem (P) Build a body of prescribed shape out of given materials (of varying densities) in such a way that the body has a prescribed mass and so that the basic frequency of the resulting membrane (with fixed boundary) is as small as possible. In fact, we will consider a more general problem, which we now state in mathematical terms: Given a domain Ω ⊂ R n (bounded, connected, with Lipschitz boundary) and numbers α> 0, A ∈ [0, Ω] (with  ·  denoting volume). For any measurable subset D ⊂ Ω let χD be its characteristic function and λΩ(α,D) the lowest eigenvalue λ of the problem (1) Define −∆u + αχDu = λu u = 0 on Ω on ∂Ω.
Results 1  10
of
620