Results 11 to 20 of about 222,860 (288)
Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics on - EACL '09, 2009 The present paper is concerned with statistical parsing of constituent structures in German. The paper presents four experiments that aim at improving parsing performance of coordinate structure: 1) reranking the n-best parses of a PCFG parser, 2 ...
Hinrichs, Erhard +3 more
core +4 more sources
Proceedings of the AAAI Conference on Artificial Intelligence, 2020 Recent analyses suggest that encoders pretrained for language modeling capture certain morpho-syntactic structure. However, probing frameworks for word vectors still do not report results on standard setups such as constituent and dependency parsing.
Vilares, David +3 more
openaire +5 more sources
To Parse or Not To Parse [PDF]
, 1998 In this paper, we reconsider the problem of specialising the vanilla meta interpreter through fully automatic and completely general partial deduction techniques. In particular, we study how the homeomorphic embedding relation guides specialisation of the interpreter. We focus on the so-called parsing problem, i.e.
Vanhoof, Wim, Martens, Bern
openaire +3 more sources
Scene Graph Parsing as Dependency Parsing [PDF]
Proceedings of the 2018 Conference of the North American Chapter of
the Association for Computational Linguistics: Human Language
Technologies, Volume 1 (Long Papers), 2018 In this paper, we study the problem of parsing structured knowledge graphs from textual descriptions. In particular, we consider the scene graph representation that considers objects together with their attributes and relations: this representation has been proved useful across a variety of vision and language applications.
Yu-Siang Wang +3 more
openaire +2 more sources
Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - NAACL '03, 2003 We present an extension of the classic A* search procedure to tabular PCFG parsing. The use of A* search can dramatically reduce the time required to find a best parse by conservatively estimating the probabilities of parse completions. We discuss various estimates and give efficient algorithms for computing them.
Dan Klein 0001, Christopher D. Manning
openaire +2 more sources
To parse or not to parse [PDF]
Proceedings of the 13th conference on Computational linguistics -, 1990 We have designed and implemented a text processing system that can extract important information from hundreds of paragraphs per hour and can be transported within weeks to a new domain. The system performs efficiently because it determines the level of processing required to understand a text. This "skimming" method identifies surface relations in the
openaire +2 more sources
Proceedings of the 18th annual meeting on Association for Computational Linguistics -, 1980 Computer Science ...
Philip J. Hayes, George V. Mouradian
openaire +1 more source
Language Processing, Linguistics and Constraints
Miscelánea: A Journal of English and American Studies, 2003 Recently, Gibson and Pearlmutter (1998, 2000) and Lewis (2000a, 2000b), among others, have debated whether the initial spark that gets language comprehension started is deterministically created in the same narrow place, always, or, on the contrary ...
Juan Carlos Acuña Fariña
doaj +1 more source
PENGARUH STRATEGI PARSING TERHADAP KEMAMPUAN MENYIMAK SISWA KELAS VII SMP NEGERI 8 MALANG
BASINDO: Jurnal Kajian Bahasa, Sastra Indonesia, dan Pembelajarannya, 2017 Penelitian ini bertujuan untuk mengetahui pengaruh strategi parsing sintaksis, pengaruh strategi parsing semantik, dan perbedaan pengaruh strategi parsing sintaksis dan semantik terhadap kemampuan menyimak siswa.
Sripit Widiastuti, Abdul Syukur Ghazali
doaj +1 more source
Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), 2015 We reduce phrase-representation parsing to dependency parsing. Our reduction is grounded on a new intermediate representation, "head-ordered dependency trees", shown to be isomorphic to constituent trees. By encoding order information in the dependency labels, we show that any off-the-shelf, trainable dependency parser can be used to produce ...
Daniel Fernández-González +1 more
openaire +3 more sources