DE eng

Search in the Catalogues and Directories

Hits 1 – 13 of 13

1
Linguatec Tolosa Treebank ...
BASE
Show details
2
Linguatec Tolosa Treebank ...
BASE
Show details
3
Annotation syntaxique automatique de la partie orale du ORFÉO
In: Langages, N 219, 3, 2020-08-11, pp.87-102 (2020)
BASE
Show details
4
Slavic Forest, Norwegian Wood (scripts)
Rosa, Rudolf; Zeman, Daniel; Mareček, David. - : Charles University, Faculty of Mathematics and Physics, Institute of Formal and Applied Linguistics (UFAL), 2017
BASE
Show details
5
Slavic Forest, Norwegian Wood (models)
Rosa, Rudolf; Zeman, Daniel; Mareček, David. - : Charles University, Faculty of Mathematics and Physics, Institute of Formal and Applied Linguistics (UFAL), 2017
BASE
Show details
6
Realisation ranking and word ordering in the context of lesser resourced languages
Motazedi, Yasaman. - : Sydney, Australia : Macquarie University, 2017
BASE
Show details
7
Irish dependency treebanking and parsing
Lynn, Teresa. - : Sydney, Australia : Macquarie University, 2016
BASE
Show details
8
Vietnamese sentiment analysis for online booking hotel review based on term feature selection and dependency tree ...
Bang, Tran Sy. - : Thammasat University, 2016
BASE
Show details
9
MSTperl parser (2015-05-19)
Rosa, Rudolf. - : Charles University, Faculty of Mathematics and Physics, Institute of Formal and Applied Linguistics (UFAL), 2015
BASE
Show details
10
MSTperl parser
Rosa, Rudolf. - : Charles University, Faculty of Mathematics and Physics, Institute of Formal and Applied Linguistics (UFAL), 2014
BASE
Show details
11
Polynomial Pregroup Grammars parse Context Sensitive Languages
In: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00412876 ; RR-09024, 2009, pp.1-26 (2009)
Abstract: A slightly modified version has been published as an article in Linguistic analysis, HAL: lirmm-00538562 ; Pregroup grammars with a possibly infinite number of lexical entries are polynomial if the length of type assignments for sentences is a polynomial in the number of words. Polynomial pregroup grammars are shown to generate the standard mildly context sensitive formal languages as well as some context sensitive natural language fragments of Dutch, Swiss-German or Old Georgian. A polynomial recognition and parsing algorithm handles the various grammars uniformly. It also computes a planar graph for the semantic cross-serial dependencies in the case of natural languages.
Keyword: [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]; [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]; complement control; cross-serial dependency; Dutch subordinate clause; incremental dependency parsing algorithm; mildly context sensitive language; Old Georgian noun phrase; pregroup grammar; proof graph; Swiss-German subordinate clause; type logical grammar
URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00412876/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00412876
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00412876/file/PregrougGrammarsContextSensitiveLanguages.pdf
BASE
Hide details
12
Syntactic Analysis for the R2 System
Biss, Kenneth. - : Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 1968
BASE
Show details
13
Documentation of MaltParser Web Service
BASE
Show details

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
13
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern