Results 41 to 50 of about 29,938 (218)
Stochastic tree-adjoining grammars [PDF]
Proceedings of the workshop on Speech and Natural Language - HLT '91, 1992 The notion of stochastic lexicalized tree-adjoining grammar (SLTAG) is defined and basic algorithms for SLTAG are designed. 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 lexically sensitive (as N-gram models or Hidden ...
openaire +2 more sources
Algorithms, 2016 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
International Conference on Computational Semantics, 2019 Complex predicates formed of a semantically ‘light’ verbal head and a noun or verb which contributes the major part of the meaning are frequently referred to as ‘light verb constructions’ (LVCs).
Jens Fleischhauer +3 more
semanticscholar +1 more source
Lexicalized non-local MCTAG with dominance links is NP-complete [PDF]
, 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
Tạ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
Journal 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]
, 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
TRAINING TREE ADJOINING GRAMMARS WITH HUGE TEXT CORPUS USING SPARK MAP REDUCE [PDF]
ICTACT 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
LFG and Tree-Adjoining Grammar
, 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 +2 more sources
Incremental Syntax Generation with Tree Adjoining Grammars [PDF]
, 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