نتایج جستجو برای: phrase structure parser

تعداد نتایج: 1585623  

2011
Jennifer Foster Özlem Çetinoglu Joachim Wagner Joseph Le Roux Joakim Nivre Deirdre Hogan Josef van Genabith

We investigate the problem of parsing the noisy language of social media. We evaluate four Wall-Street-Journal-trained statistical parsers (Berkeley, Brown, Malt and MST) on a new dataset containing 1,000 phrase structure trees for sentences from microblogs (tweets) and discussion forum posts. We compare the four parsers on their ability to produce Stanford dependencies for these Web 2.0 senten...

2004
Michael W. Daniels Walt Detmar Meurers

Linearization-based HPSG theories are widely used for analyzing languages with relatively free constituent order. This paper introduces the Generalized ID/LP (GIDLP) grammar format, which supports a direct encoding of such theories, and discusses key aspects of a parser that makes use of the dominance, precedence, and linearization domain information explicitly encoded in this grammar format. W...

2011
Feiyu Xu Hong Li Yi Zhang Hans Uszkoreit Sebastian Krause

The paper demonstrates how the generic parser of a minimally supervised information extraction framework can be adapted to a given task and domain for relation extraction (RE). For the experiments a generic deep-linguistic parser was employed that works with a largely hand-crafted headdriven phrase structure grammar (HPSG) for English. The output of this parser is a list of n best parses select...

2010
Xianchao Wu Takuya Matsuzaki Jun'ichi Tsujii

Tree-to-string translation rules are widely used in linguistically syntax-based statistical machine translation systems. In this paper, we propose to use deep syntactic information for obtaining fine-grained translation rules. A head-driven phrase structure grammar (HPSG) parser is used to obtain the deep syntactic information, which includes a fine-grained description of the syntactic property...

Journal: :Journal of experimental psychology. Learning, memory, and cognition 1994
L Osterhout P J Holcomb D A Swinney

Event-related potentials were recorded from 13 scalp locations while participants read sentences containing a syntactic ambiguity. In Experiment 1, syntactically disambiguating words that were inconsistent with the "favored" syntactic analysis elicited a positive-going brain potential (P600). Experiment 2 examined whether syntactic ambiguities are resolved by application of a phrase-structure-b...

Journal: :Journal of Japanese Linguistics 1998

2011
Donna Marie Gates

This paper discusses the implementation and evaluation of automatically generated cloze questions in the style of the definitions found in Collins COBUILD English language learner’s dictionary. The definitions and the cloze questions are used in an automated reading tutor to help second and third grade students learn new vocabulary. A parser provides syntactic phrase structure trees for the def...

2015
Yusuke Oda Graham Neubig Sakriani Sakti Tomoki Toda Satoshi Nakamura

This paper describes Ckylark, a PCFG-LA style phrase structure parser that is more robust than other parsers in the genre. PCFG-LA parsers are known to achieve highly competitive performance, but sometimes the parsing process fails completely, and no parses can be generated. Ckylark introduces three new techniques that prevent possible causes for parsing failure: outputting intermediate results...

2013
Natsuda Laokulrat Makoto Miwa Yoshimasa Tsuruoka Takashi Chikayama

In this paper, we present a system, UTTime, which we submitted to TempEval-3 for Task C: Annotating temporal relations. The system uses logistic regression classifiers and exploits features extracted from a deep syntactic parser, including paths between event words in phrase structure trees and their path lengths, and paths between event words in predicateargument structures and their subgraphs...

2012
Joseph Le Roux Benoît Favre Alexis Nasr Seyed Abolghasem Mirroshandel

We present an architecture for parsing in two steps. A phrase-structure parser builds for each sentence an n-best list of analyses which are converted to dependency trees. These dependency structures are then rescored by a discriminative reranker. Our method is language agnostic and enables the incorporation of additional information which are useful for the choice of the best parse candidate. ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید