• Refine your search:
  • 
    Keyword:
    
    • Computation and Language cs.CL (11)
    • Data Structures and Algorithms cs.DS (11)
    • FOS Computer and information sciences (11)
    • Databases cs.DB (2)
    • Formal Languages and Automata Theory cs.FL (2)
    • A.1; E.2; H.2.1; H.3.3; H.3.7; I.2.7 (1)
    • Artificial Intelligence cs.AI (1)
    • Audio and Speech Processing eess.AS (1)
    • Discrete Mathematics cs.DM (1)
    • E.1; F.2.2; H.3.1; I.2.7 (1)
    •   more
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access:
    • free (11)
    • 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 – 11 of 11 1 An improved Bayesian TRIE based model for SMS text normalization ... Sikdar, Abhinava; Chatterjee, Niladri. - : arXiv, 2020 BASE Show details 2 Sliding window property testing for regular languages ... Ganardi, Moses; Hucke, Danny; Lohrey, Markus. - : arXiv, 2019 BASE Show details 3 Matroids Hitting Sets and Unsupervised Dependency Grammar Induction ... Harvey, Nicholas; Mirrokni, Vahab; Karger, David. - : arXiv, 2017 BASE Show details 4 A polynomial time algorithm for the Lambek calculus with brackets of bounded order ... Kanovich, Max; Kuznetsov, Stepan; Morrill, Glyn; Scedrov, Andre. - : arXiv, 2017 Abstract: Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm for determ- ining provability of bounded depth formulas in the Lambek calculus with empty antecedents allowed. Pentus' algorithm is based on tabularisation of proof nets. Lambek calculus with brackets is a conservative extension of Lambek calculus with bracket modalities, suitable for the modeling of syntactical domains. In this paper we give an algorithm for provability the Lambek calculus with brackets allowing empty antecedents. Our algorithm runs in polynomial time when both the formula depth and the bracket nesting depth are bounded. It combines a Pentus-style tabularisation of proof nets with an automata-theoretic treatment of bracketing. ... Keyword: Computation and Language cs.CL; Data Structures and Algorithms cs.DS; Formal Languages and Automata Theory cs.FL; FOS Computer and information sciences; Logic in Computer Science cs.LO URL: https://dx.doi.org/10.48550/arxiv.1705.00694 https://arxiv.org/abs/1705.00694 BASE Hide details 5 Tuned and GPU-accelerated parallel data mining from comparable corpora ... Wołk, Krzysztof; Marasek, Krzysztof. - : arXiv, 2015 BASE Show details 6 Implementation of an Automatic Syllabic Division Algorithm from Speech Files in Portuguese Language ... Da Silva, E. L. F.; de Oliveira, H. M.. - : arXiv, 2015 BASE Show details 7 Good parts first - a new algorithm for approximate search in lexica and string databases ... Gerdjikov, Stefan; Mihov, Stoyan; Mitankin, Petar. - : arXiv, 2013 BASE Show details 8 An Object-Oriented and Fast Lexicon for Semantic Generation ... Hijzelendoorn, Maarten; Cremers, Crit. - : arXiv, 2009 BASE Show details 9 Incremental Construction of Compact Acyclic NFAs ... Sgarbas, Kyriakos N.; Fakotakis, Nikos D.; Kokkinakis, George K.. - : arXiv, 2002 BASE Show details 10 A Straightforward Approach to Morphological Analysis and Synthesis ... Sgarbas, Kyriakos N.; Fakotakis, Nikos D.; Kokkinakis, George K.. - : arXiv, 2001 BASE Show details 11 A Formal Framework for Linguistic Annotation (revised version) ... Bird, Steven; Liberman, Mark. - : arXiv, 2000 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 11 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0