Results 51 to 60 of about 21,709 (216)

Lexicalized non-local MCTAG with dominance links is NP-complete [PDF]

open access: yes, 2011
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

IMPROVING INTRUSION DETECTION USING TREE ADJOINING GRAMMAR GUIDED GENETIC PROGRAMMING

open access: yesTạp chí Khoa học Đại học Đà Lạt, 2017
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

open access: yesJournal 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

TuLiPA : towards a multi-formalism parsing environment for grammar engineering [PDF]

open access: yes, 2008
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

Artificial grammar learning meets formal language theory: an overview. [PDF]

open access: yesPhilos Trans R Soc Lond B Biol Sci, 2012
Fitch WT, Friederici AD.
europepmc   +2 more sources

TRAINING TREE ADJOINING GRAMMARS WITH HUGE TEXT CORPUS USING SPARK MAP REDUCE [PDF]

open access: yesICTACT Journal on Soft Computing, 2015
Tree adjoining grammars (TAGs) are mildly context sensitive formalisms used mainly in modelling natural languages. Usage and research on these psycho linguistic formalisms have been erratic in the past decade, due to its demanding construction and ...
Vijay Krishna Menon   +2 more
doaj  

Incremental Syntax Generation with Tree Adjoining Grammars [PDF]

open access: yes, 1991
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   +2 more sources

LFG and Tree-Adjoining Grammar

open access: yes, 2023
This chapter gives an introduction to Tree-Adjoining Grammar (TAG) and draws some comparisons with Lexical Functional Grammar (LFG). It is primarily aimed at those familiar with LFG who are looking to learn about TAG and see where the two formalisms differ\slash overlap, but the comparisons will also be of interest to those coming from a TAG ...
openaire   +1 more source

Syntax-driven semantic frame composition in Lexicalized Tree Adjoining Grammars

open access: yesJournal of Language Modelling, 2014
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

Tree adjoining grammars for RNA structure prediction

open access: yesTheoretical Computer Science, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Takashi Yokomori   +3 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy