Контекстен тәуелсіз грамматика

This paper surveys some issues that arise in the study of the syntax and semantics of natural languages (NL's) and have potential relevance to the automatic recognition, parsing, and translation …...

Computer Science Department Boston University 111 Cummington Street Boston, Massachusetts 02215 USA PREL1MIN A R IES We study the formal and linguistic proper- ties of a class of parenthesis-free categorial …...

A morphologic and morphosyntactic analyzer for the Italian language has been implemented in VM/Prolog 131 at the IBM Romc Scientific Center as part of a project on text understanding. Aim …...

We consider the structural descriptions produced by vari- ous grammatical formalisms in ~ of the complexity of the paths and the relationship between paths in the sets of structural descriptions …...

A new natural language system, TINA, has been developed for applications involving speech understanding tasks, which integrates key ideas from context free grammars, Augmented Transition Networks (ATN's) [1], and Lexical …...

We describe a series of three experiments in which supervised learning techniques were used to acquire three different types of grammars for English news stories. The acquired grammar types were: …...

We present an integrated approach to speech and natural language processing which uses a single parser to create training for a statistical speech recognition component and for interpreting recognized text. …...

In this paper 1 we present a new pars- ing algorithm for linear indexed grammars (LIGs) in the same spirit as the one de- scribed in (Vijay-Shanker and Weir, 1993) …...

The statistical induction of context free grammars from bracketed cor- pora with the Inside Outside Algorithm has often inspired researchers, but the computational complexity has made it impossible to generate …...

In this paper we study the problem of learning context-free grammar from a cor- pus. We investigate a technique that is based on the notion of minimum description length of …...

. The current state of Philippine linguistic resources, which includes formal grammars, electronic dictionaries and corpora are not yet significant to address industrial- strength language technologies. This paper discusses a …...

. Machine Translation systems expect target language output to be grammatically correct. In Myanmar-English statistical machine translation system, target language output (English) can often be ungrammatical. To address this issue, …...

The state-of-the-art system combination method for machine translation (MT) is based on confusion networks constructed by aligning hypotheses with regard to word similarities. We introduce a novel system combination framework …...

In Corpus-Based Machine Translation, the search space of the translation candidates for a given input sentence is often defined by a set of (cycle- free) context-free grammar rules. This happens …...

LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Gram- mar. In this paper, …...

Parsing for a wide variety of grammar for- malisms can be performed by intersecting finite tree automata. However, naive im- plementations of parsing by intersection are very inefficient. We present …...

AbstractIn this paper we demonstrate that context free grammar (CFG) based methods for grammar induction benefit from modeling lexical dependencies. This contrasts to the most popular current methods for grammar …...

AbstractWe propose to tackle data-to-text generation tasks by directly splicing together retrieved segments of text from “neighbor” source-target pairs. Unlike recent work that conditions on retrieved neighbors but generates text …...

AbstractMany NLP datasets have been found to contain shortcuts: simple decision rules that achieve surprisingly high accuracy. However, it is difficult to discover shortcuts automatically. Prior work on automatic shortcut …...