Results 11 to 20 of about 73,786 (298)
, 2006 It is shown how parsing can be described as a problem in the class ISBES, Intersections of Sets and Bags of Extended Substructures, defined in /pubs/1991/161/, by viewing parsing as a generalization of pattern matching in several ways. The resulting description is shown to be a good starting point for the transformational derivation of the Cocke-Kasami-
Broy, M. +4 more
openaire +5 more sources
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) enriching the input to a PCFG parser by gold scopes for any conjunct, 3) reranking the parser output for ...
Kübler, Sandra +3 more
openaire +4 more sources
Deductive parsing with interaction grammars [PDF]
, 2009 We present a parsing algorithm for Interaction Grammars using the deductive parsing framework. This approach brings new perspectives to this problem, departing from previous methods which rely on constraint-solving ...
Joseph Le Roux, Le Roux, Joseph
core +4 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 +4 more sources
Weighted parsing of trees [PDF]
, 2011 We show how parsing of trees can be formalized in terms of the intersection of two tree languages. The focus is on weighted regular tree grammars and weighted tree adjoining grammars.
Nederhof, Mark Jan
core +3 more sources
Parsing of partially bracketed structures for parse selection [PDF]
, 2012 We consider the problem of parsing a sentence that is partially annotated with information about where phrases start and end. The application domain is interactive parse selection with probabilistic grammars.
S´anchez-S´aez, Ricardo +1 more
core +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
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