• Refine your search:
  • 
    Keyword:
    
    • FOS Computer and information sciences (6)
    • Computation and Language cs.CL (5)
    • I.2.7; D.3.1 (1)
    • Machine Learning cs.LG (1)
    • Machine Learning stat.ML (1)
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access:
    • free (6)
    • subject to license (0)

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 6 of 6 1 Better Neural Machine Translation by Extracting Linguistic Information from BERT ... Shavarani, Hassan S.; Sarkar, Anoop. - : arXiv, 2021 BASE Show details 2 Pointer-based Fusion of Bilingual Lexicons into Neural Machine Translation ... Gū, Jetic; Shavarani, Hassan S.; Sarkar, Anoop. - : arXiv, 2019 BASE Show details 3 Top-down Tree Structured Decoding with Syntactic Connections for Neural Machine Translation and Parsing ... Gū, Jetic; Shavarani, Hassan S.; Sarkar, Anoop. - : arXiv, 2018 BASE Show details 4 Analysis of Semi-Supervised Learning with the Yarowsky Algorithm ... Haffari, Gholam Reza; Sarkar, Anoop. - : arXiv, 2012 BASE Show details 5 Separating Dependency from Constituency in a Tree Rewriting System ... Sarkar, Anoop. - : arXiv, 1998 Abstract: In this paper we present a new tree-rewriting formalism called Link-Sharing Tree Adjoining Grammar (LSTAG) which is a variant of synchronous TAGs. Using LSTAG we define an approach towards coordination where linguistic dependency is distinguished from the notion of constituency. Such an approach towards coordination that explicitly distinguishes dependencies from constituency gives a better formal understanding of its representation when compared to previous approaches that use tree-rewriting systems which conflate the two issues. ... : 7 pages, 6 Postscript figures, uses fullname.sty ... Keyword: Computation and Language cs.CL; FOS Computer and information sciences; I.2.7; D.3.1 URL: https://arxiv.org/abs/cs/9809028 https://dx.doi.org/10.48550/arxiv.cs/9809028 BASE Hide details 6 Coordination in Tree Adjoining Grammars: Formalization and Implementation ... Sarkar, Anoop; Joshi, Aravind. - : arXiv, 1996 BASE Show details

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 6 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0