Parser

In this paper we present a parser which al lows to make explicit the interconnections between syntax and semantics, to analyze the sentences in a quasi-deterministic fashion and, in many …...

1 Practical natural language interfaces must exhibit robust bei~aviour in the presence of extragrammaticat user input. This paper classifies different types of grammatical deviations and related phenomena at the lexical …...

By generalizing the notion of location of a constituent to allow discontinuous Ioctaions, one can describe the discontinuous consti- tuents of non-configurational languages. These discontinuous consti- tuents can be described …...

We outline a model of generation with revision, focusing on improving textual coherence. We argue that high quality text is more easily produced by iteratively revising and regenerating, as people …...

The two-level grammar is investigated as a notation for giving formal specification of the context-frec and context-sensitive aspects of n,~tural language syntax. In this paper, a large class of English …...

The logic behind parsers for categorial grammars can be formalized in several different ways. Lam- bek Calculus (LC) constitutes an example for a na- tural deduction 1 style parsing method. …...

In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for nat- ural language description -- analysis as well as generation. In this paper we concentrate on the …...

We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOG programs are derived by an off-line compilation process: a parser …...

We describe the modification of a grammar to take advantage of prosodic information provided by a speech recognition system. This initial study is lim- ited to the use of relative …...

A style checker is a tool which supports authors during the process of writing: Certain style markers are analyzed, their values are compared with a given norm, deviations are detected, …...

In this paper, we concern ourselves with an applica- tion of text-to-speech for speech-impaired, deaf, and hard of hearing people. The application is unusual because it requires real-time synthesis of …...

This paper presents a direct implementation of Government-Binding theory in a parser for German, which faithfully models the modular structure of the theory. The modular design yields a flexible environment, …...

1 Efficient natural language generation has been successfully demonstrated using highly compiled knowledge about speech acts and their related social actions. A design and prototype implementation of a parser which …...

The parsing component of previous principle-based machine translation systems are inefficient since they tend to adopt a generate-and-test paradigm. We combine the benefits of a message-passing paradigm with the benefits …...

: In a lexicalized grammar Ibrnlal- isni such as LexicMized Tree-Adjoining (h'~unmar (I3'AG), each lexicM item is associated with at least one elementary structure (supertag) that localizes syntactic a.nd semantic …...

An extension to classical unification, called graded unifica- tion is presented. It is capable of combining contradictory information. An interactive processing paradigm and parser based on this new operator are …...

We present an efI]cient, broad-coverage, principle-based parser for English. The parser has been implemented in C++ and runs on SUN Sparcstations with X-windows. It con- rains a lexicon with over …...

We describe a practical parser for unre- stricted dependencies. The parser creates links between words and names the links according to their syntactic functions. We first describe the older Constraint …...

This paper describes a spelling correction system that functions as part of an intelligent tutor that car- ries on a natural language dialogue with its users. The process that searches …...

This paper describes a spelling correction system that functions as part of an intelligent tutor that car- ries on a natural language dialogue with its users. The process that searches …...

We propose a parser for constraint- logic grammars implementing HPSG that combines the advantages of dy- namic bottom-up and advanced top- down control. The parser allows the user to apply …...

AbstractIn this paper we present a methodology for automating the evaluation of the grammatical coverage of machine translation (MT) systems. The methodology is based on the importance of unfolded grammatical …...

Previous works on question classification are based on complex natural language process- ing techniques: named entity extractors, parsers, chunkers, etc. While these ap- proaches have proven to be effective they …...

We compare two approaches for describing and gen- erating bodies of rules used for natural language parsing. In today’s parsers rule bodies do not ex- ist a priori but are …...

Tree-based approaches to alignment model translation as a sequence of probabilistic op- erations transforming the syntactic parse tree of a sentence in one language into that of the other. The …...

In this paper, we extend an existing parser to produce richer output annotated with function labels. We obtain state-of-the-art results both in function labelling and in parsing, by automatically relabelling …...

We describe a new method for the repre- sentation of NLP structures within rerank- ing approaches. We make use of a condi- tional log–linear model, with hidden vari- ables representing …...

This paper describes the development of QuestionBank, a corpus of 4000 parse- annotated questions for (i) use in training parsers employed in QA, and (ii) evalua- tion of question parsing. …...

This paper describes a parser which gen- erates parse trees with empty elements in which traces and fillers are co-indexed. The parser is an unlexicalized PCFG parser which is guaranteed …...

This paper explores the problem of com- puting text similarity between verb phrases describing skilled human behav- ior for the purpose of finding approximate matches. Four parsers are evaluated on …...

For the Affective Text task at SemEval- 2007, University Paris 7’s system first evaluates emotion and valence on all words of a news headline (using enriched versions of SentiWordNet and …...

The limitations of existing data sets for train- ing parsers has led to a need for additional data. However, the cost of manually annotat- ing the amount and range of …...

This paper presents a methodology for the comparative performance analysis of the parsers developed for different grammar frameworks. For such a comparison, we need a common representation format of the …...

To date, parsers have made limited use of se- mantic information, but there is evidence to suggest that semantic features can enhance parse disambiguation. This paper shows that semantic classes …...

AbstractThis article discusses the treatment of collocations in the context of a long-term project on the development of multilingual NLP tools. Besides “classical” two-word collocations, we will focus on the …...

AbstractPrevious work has shown that large scale subcategorisation lexicons could be extracted from parsed corpora with reasonably high precision. In this paper, we apply a standard extraction procedure to a …...

We present a simple but accurate parser which exploits both large tree fragments and symbol refinement. We parse with all fragments of the training set, in con- trast to much …...

Probabilistic models of sentence com- prehension are increasingly relevant to questions concerning human language processing. However, such models are of- ten limited to syntactic factors. This paper introduces a novel …...

AbstractMT systems typically use parsers to help reorder constituents. However most languages do not have adequate treebank data to learn good parsers, and such training data is extremely time-consuming to …...

AbstractWe describe an electronic lexical resource for German and the structure of its lexicon entries, notably the structure of verbal single-word and multi-word entries. The verb as the center of …...

AbstractWe present the Hamburg Dependency Treebank (HDT), which to our knowledge is the largest dependency treebank currently available. It consists of genuine dependency annotations, i. e. they have not been …...

AbstractA treebank is an important language resource for supervised statistical parsers. The parser induces the grammatical properties of a language from this language resource and uses the model to parse …...

We present a parser that relies primar- ily on extracting information directly from surface spans rather than on propagat- ing information through enriched gram- mar structure. For example, instead of …...

Cooking recipes exist in abundance; but due to their unstructured text format, they are hard to study quantitatively beyond treating them as simple bags of words. In this paper, we …...

Morphologically rich languages often lack the annotated linguistic resources required to develop accurate natural language pro- cessing tools. We propose models suitable for training morphological taggers with rich tagsets for …...

AbstractThis article presents the results we obtained on a complex annotation task (that of dependency syntax) using a specifically designed Game with a Purpose, ZombiLingo. We show that with suitable …...

This is a system description paper for a sub- mission to Task 8 of SemEval-2016: Meaning Representation Parsing. No use was made of the training data provided by the task. …...

This paper demonstrates that it is possible for a parser to improve its performance with a hu- man in the loop, by posing simple questions to non-experts. For example, given …...

AbstractWe present the first parser for UCCA, a cross-linguistically applicable framework for semantic representation, which builds on extensive typological work and supports rapid annotation. UCCA poses a challenge for existing …...

AbstractSinglish can be interesting to the ACL community both linguistically as a major creole based on English, and computationally for information extraction and sentiment analysis of regional social media. We …...

Since the idea of combining Lexicalized Tree Adjoining Grammars (LTAG) and frame semantics was proposed (Kallmeyer and Osswald, 2013), a set of resources of this type has been created. These …...

AbstractMeasuring what linguistic information is encoded in neural models of language has become popular in NLP. Researchers approach this enterprise by training “probes”—supervised models designed to extract linguistic structure from …...

AbstractPyVallex is a Python-based system for presenting, searching/filtering, editing/extending and automatic processing of machine-readable lexicon data originally available in a text-based format. The system consists of several components: a parser …...

AbstractA lack of datasets for spelling and grammatical error correction in Icelandic, along with language-specific issues, has caused a dearth of spell and grammar checking systems for the language. We …...

AbstractWe introduce a constraint-based parser for Minimalist Grammars (MG), implemented as a working computer program, that falls within the long established “Parsing as Deduction” framework. The parser takes as input …...

AbstractTreebank selection for parsing evaluation and the spurious effects that might arise from a biased choice have not been explored in detail. This paper studies how evaluating on a single …...