[PDF] Top 20 Native Language Detection with Tree Substitution Grammars

... A more principled technique is to use a sparse nonparametric prior, as was recently presented by Cohn et al (2009) and Post and Gildea (2009). They provide a local Gibbs sampling algorithm, and Cohn and Blunsom (2010) ... See full document

... synchronous grammars to model the syntax-semantics interface (Nesson and Shieber, ...a tree set from the ...head tree in the derivation tree must domi- nate all its ...natural language ... See full document

... Context-free grammars (CFGs) are a useful tool for describing the structure of language, modeling a va- riety of linguistic phenomena while still permitting efficient ...in grammars that are overly ... See full document

... of grammars with an extended domain of ...from Tree Sub- stitution Grammars (Joshi, 1985) outperformed the Cherry and Quirk ...fewer substitution points in a derivation. Their grammars ... See full document

... in tree substitution grammar (TSG) as an alter- native to CFG for modeling syntax trees (Post and Gildea, 2009; Tenenbaum et ...large tree fragments. These tree frag- ments have great ... See full document

... of tree substitution grammars — such as the identify of particu- lar fragments, and a count of large and small fragments — are useful in binary grammatical classification ...parse tree ... See full document

... regular tree grammars (Alexandrakis and Bozapalidis, ...regular tree grammar over Σ and Q (for short: W RTG ) is an S TSG G over Σ, Σ, and Q where each rule has the form q → (s, s, id, a) where id is ... See full document

... Many successful models of syntax are based on Probabilistic Context Free Grammars (PCFGs) (e.g., Collins (1999)). However, directly learning a PCFG from a treebank results in poor parsing perfor- mance, due ... See full document

... natural language, such as the dependencies be- tween determiners and nouns, allowing them to overgenerate phrases like those ...probabilistic tree-substitution grammars ...natural ... See full document

... tion to the problem of computing the co-domain with the help of the product construction of Defi- nition 5. However, the co-domain of an MBOT is not necessarily representable by a TSG, which is not due to ... See full document

... in language competence models [Chomsky, ...actual language pro- duction instances, which include possible sloppiness, common mistakes and in general not entirely linguistically kosher ...consider ... See full document

... of language while also ensuring that it can be readily learned from ...free grammars and first order dependency grammars, which are not sufficiently expressive to model many common linguistic ... See full document

... Merging known MWEs into single tokens has been shown to improve accuracy for a variety of NLP tasks: dependency parsing (Nivre and Nilsson, 2004), constituency parsing (Arun and Keller, 2005), sentence generation (Hogan ... See full document

... When looking at the extracted fragments we ask if we could have predicted which fragments occur twice or more. Figure 3 attempts to tackle this ques- tion by reporting some statistics on the extracted fragments. The ... See full document

... from grammars of German for English learners suggests that both Gottsched and Adelung were somewhat conservative in their accounts, presenting a system that already appeared dated to some speakers at least; ... See full document

... TREE GRAMMARS (GRAMMARS) T R E E GRAMMARS ( = 4 GRAMMARS ) GladkyA V (Novosibirsk) ~ Melt~uk I A (Moscow) i T h i s p a p e r s u g g e s t s a n e w k i n d o f f o r m a l g r a m m a r ( h e r e a[.] ... See full document

... We then subsert this derived structure into the claims tree by substituting the root of the subject component of to adore at the S node of claims and by inserting the S node of the seems[r] ... See full document

... In our formulation of STAGs we use states (cf. F¨ul¨op et al. (2010) for the use of states in STSGs). The states make intersection with de- vices of finite-state power possible. More specif- ically, they allow for a ... See full document

... network grammars (RNNGs) (Dyer et ...sequential language models, achieve ex- cellent results on parsing (Dyer et ...of language (Kuncoro et ...network grammars for language modeling and ... See full document

... ACGs provide a framework in which several grammatical formalisms may be encoded (de Groote and Pogodalla, 2004). They generate lan- guages of linear λ-terms, which generalize both string and tree languages. A key ... See full document