Results 31 to 40 of about 22,181 (225)
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 Grammar.
Laura Kallmeyer, Wolfgang Maier
doaj +1 more source
Lexicalized non-local MCTAG with dominance links is NP-complete [PDF]
An NP-hardness proof for non-local Multicomponent Tree Adjoining Grammar (MCTAG) by Rambow and Satta (1st International Workshop on Tree Adjoining Grammers 1992), based on Dahlhaus and Warmuth (in J Comput Syst Sci 33:456–472, 1986), is extended to some ...
Champollion, Lucas
core +2 more sources
Some computational properties of Tree Adjoining Grammars [PDF]
Tree Adjoining Grammar (TAG) is a formalism for natural language grammars. Some of the basic notions of TAG's were introduced in [Joshi, Levy, and Takahashi 1975] and by [Joshi, 1983]. A detailed investigation of the linguistic relevance of TAG's has been carried out in [Kroch and Joshi, 1985]. In this paper, we will describe some new results for TAG's,
K. Vijay-Shankar, Aravind K. Joshi
openaire +2 more sources
IMPROVING INTRUSION DETECTION USING TREE ADJOINING GRAMMAR GUIDED GENETIC PROGRAMMING
Nowadays, the problem of network security has become urgent and affect the performance of modern computer networks greatly. Detection and prevention of network attacks have been the main topic of many researchers in the World.
Vũ Văn Cảnh +2 more
doaj +1 more source
A syntactic component for Vietnamese language processing
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
Portuguese analysis with Tree Adjoining Grammars [PDF]
This article approaches syntactical analysis of Portuguese language based upon a formalism called Tree Adjoining Grammars (TAGs) [JOSHI 85]. It briefly describes the formalism and its main operations, outlines a Portuguese subset for analysis, and presents a parser developed according TAGs concepts in order to validate an application of the formalism ...
Karin Christine Kipper +1 more
openaire +1 more source
TuLiPA : towards a multi-formalism parsing environment for grammar engineering [PDF]
In this paper, we present an open-source parsing environment (Tübingen Linguistic Parsing Architecture, TuLiPA) which uses Range Concatenation Grammar (RCG) as a pivot formalism, thus opening the way to the parsing of several mildly context-sensitive ...
Dellert, Johannes +5 more
core +5 more sources
Incremental Syntax Generation with Tree Adjoining Grammars [PDF]
With the increasing capacity of AI systems the design of human-computer interfaces has become a favorite research topic in AI. In this paper we focus on aspects of the output of a computer. The architecture of a sentence generation component — embedded in the WIP system — is described.
Harbusch, Karin +2 more
openaire +1 more source
Stochastic lexicalized tree-adjoining grammars [PDF]
The notion of stochastic lexicalized tree-adjoining grammar (SLTAG) is formally defined. The parameters of a SLTAG correspond to the probability of combining two structures each one associated with a word. The characteristics of SLTAG are unique and novel since it is lexieally sensitive (as N-gram models or Hidden Markov Models) and yet hierarchical ...
openaire +1 more source
Syntax-driven semantic frame composition in Lexicalized Tree Adjoining Grammars
The grammar framework presented in this paper combines Lexicalized Tree Adjoining Grammar (LTAG) with a (de)compositional frame semantics. We introduce elementary constructions as pairs of elementary LTAG trees and decompositional frames.
Laura Kallmeyer, Rainer Osswald
doaj +1 more source

