Талдау ағашы

This brief paper, which is itself an extended abstract for a forthcoming paper, describes a metric that can be easily com- puted during either bottom-up or top-down construction of a …...

MLR, an extended LR parser, is introduced, and its application to natural language parsing is discussed. An LR parser is a ~;hift-reduce parser which is doterministically guided by a parsing …...

The Context-Free backbone of some natural language ana- lyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by …...

In Data Oriented Parsing (DOP), an annotated corpus is used as a stochastic grammar. An input string is parsed by combining subtrees from the corpus. As a consequence, one parse …...

In this paper 1 we present a new pars- ing algorithm for linear indexed grammars (LIGs) in the same spirit as the one de- scribed in (Vijay-Shanker and Weir, 1993) …...

In this article, we apply to natural language parsing and tagging the device of trigger- pair predictors, previously employed exclu- sively within the field of language mod- elling for speech …...

We describe a method for incorporating syntactic informa- tion in statistical machine translation systems. The first step of the method is to parse the source language string that is be- …...

AbstractIn syntax-directed translation, the source-language input is first parsed into a parse-tree, which is then recursively converted into a string in the target-language. We model this conversion by an extended …...

This paper describes a parser which gen- erates parse trees with empty elements in which traces and fillers are co-indexed. The parser is an unlexicalized PCFG parser which is guaranteed …...

We present a novel translation model based on tree-to-string alignment template (TAT) which describes the alignment be- tween a source parse tree and a target string. A TAT is capable …...

This paper describes the transfer compo- nent of a syntax-based Example-based Ma- chine Translation system. The source sen- tence parse tree is matched in a bottom-up fashion with the source …...

This paper describes a new method for un- supervised grammar induction based on the automatic extraction of certain pat- terns in the texts. Our starting hypoth- esis is that there …...

While it is generally accepted that many trans- lation phenomena are correlated with linguis- tic structures, employing linguistic syntax for translation has proven a highly non-trivial task. The key assumption …...

This paper proposes a method for learning a discriminative parser for machine trans- lation reordering using only aligned par- allel text. This is done by treating the parser’s derivation tree …...

. The robustness of probabilistic parsing generally comes at the expense of grammaticality judgment – the grammaticality of the most probable output parse remaining unknown. Parsers, such as the Stanford …...

A common approach to dependency parsing is scoring a parse via a linear function of a set of indicator features. These features are typically manually constructed from templates that are …...

AbstractIn this paper, we attempt to link the inner workings of a neural language model to linguistic theory, focusing on a complex phenomenon well discussed in formal linguistics: (negative) polarity …...

AbstractThis paper describes our system created for the SemEval-2018 Task 1: Affect in Tweets (AIT-2018). We participated in both the regression and the ordinal classification subtasks for emotion intensity detection …...