Results 11 to 20 of about 59,222 (317)
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 +3 more sources
, 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 +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 +1 more source
A syntactic component for Vietnamese language processing
Journal of Language Modelling, 2015 This paper presents the development of a syntactic component for the Vietnamese language. We first discuss the construction of a lexicalized tree-adjoining grammar using an automatic extraction approach. We then present the construction and evaluation of
Phuong Le-Hong +2 more
doaj +1 more source
Cross-linguistic evidence for storage costs in filler-gap dependencies with wh-adjuncts
Frontiers in Psychology, 2015 This study investigates processing of interrogative filler-gap dependencies in which the filler integration site or gap is not directly subcategorized by the verb.
Artur eStepanov, Penka eStateva
doaj +1 more source
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
Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey
Algorithms, 2016 Parsing for mildly context-sensitive language formalisms is an important area within natural language processing. While the complexity of the parsing problem for some such formalisms is known to be polynomial, this is not the case for all of them.
Henrik Björklund +2 more
doaj +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
A Semi-Automatic Methodology for Making FMEA Surveys [PDF]
International Journal of Mathematical, Engineering and Management Sciences, 2021 This paper proposes a semi-automatic methodology to assist the user in creating surveys about FMEA and Risk Analysis, based on a customized use of the tools for semantic analysis and in particular a home-developed syntactic parser called Kompat Cognitive.
Christian Spreafico, Davide Russo
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