Flat noun phrase structure was, up until recently, the standard in annotation for the Penn Treebanks. With the recent addition of internal noun phrase annotation, dependency parsing and applications down the NLP pipeline are likely affected. Some machine translation systems, such as TectoMT, use deep syntax as a language transfer layer. It is proposed that changes to the noun phrase dependency ...

In this study, we describe a method for parsing part-of-speech tagged unrestricted texts in Swedish using finite-state networks. We use the Xerox Finite-State Tool because of its expressiveness and power for writing and compiling regular expressions and relations. The parser is divided into four modules: i) contiguous phrase structure marker, ii) phrasal head marker, iii) syntactic function tag...

Abstract Vector symbolic architectures (VSA) are a viable approach for the hyperdimensional representation of data, such as documents, syntactic structures, or semantic frames. We present rigorous mathematical framework phrase structure trees and parse context-free grammars (CFG) in Fock space, i.e. infinite-dimensional Hilbert space being used quantum field theory. define novel normal form CFG...

In this paper, we introduce a restricted form of phrase structure grammar to handle the characteristics of Korean more eeciently. Based on this restricted form of the grammar, we propose a probabilistic parser for Korean sentences. To show usefulness of the parser proposed in this paper, we made a preliminary experiment. We extract a set of rules from about 1,682 tree annotated sentences. The e...

PTB 23 Model F1 Sent./s. Charniak (2000) 89.5 Stanford PCFG (2003) 85.5 5.3 Petrov (2007) 90.1 8.6 Zhu (2013) 90.3 39.0 Carreras (008) 91.1 CJ Reranking (2005) 91.5 4.3 Stanford RNN (2013) 90.0 2.8 PAD 90.6 34.3 PAD (Pruned) 90.5 58.6 CTB 5 Model F1 Charniak (2000) 80.8 Bikel (2004) 80.6 Petrov (2007) 83.3 Zhu (2013) 83.2 PAD 82.4 Experiments Contributions • A phrase-structure parser (PAD) achi...

We investigate the problem of automatically converting from a dependency representation to a phrase structure representation, a key aspect of understanding the relationship between these two representations for NLP work. We implement a new approach to this problem, based on a small number of supertags, along with an encoding of some of the underlying principles of the Penn Treebank guidelines. ...

Mixed-initiative dialogs often contain interruptions in phrase structure such as repairs and backchannel responses. Phrase structure as traditionally defined does not accommodate such phenomena, so it is not surprising that phrase structure parsers are ill-equipped to handle them. This paper presents metarules that specify how phrase structure rules may be restarted or interrupted (including ov...

Mixed-initiative dialogs often contain interruptions in phrase structure such as repairs and backchannel responses. Phrase structure as traditionally de ned does not accommodate such phenomena, so it is not surprising that phrase structure parsers are ill-equipped to handle them. This paper presents metarules that specify how the instantiations of phrase structure rules may be restarted or inte...

Parsing is an important step for natural language understanding, including phrase alignment for supporting statistical machine translation. Ability on analysing real text by parser strongly depends on grammar. Treebank could be one of the sources for grammar extraction. However, treebank construction largely relies on human annotators intuitions. Different intuitions from multiple annotators br...

This paper introduces a new technique for phrase-structure parser analysis, categorizing possible treebank structures by integrating regular expressions into derivation trees. We analyze the performance of the Berkeley parser on OntoNotes WSJ and the English Web Treebank. This provides some insight into the evalb scores, and the problem of domain adaptation with the web data. We also analyze a ...