Home
Catalogue search
Refine your search:
Keyword
Creator / Publisher:
Satta, Giorgio (29)
Nederhof, Mark-Jan (5)
Kuhlmann, Marco (3)
Nederhof, Mark Jan (3)
University of St Andrews.School of Computer Science (3)
Carroll, John (2)
Frank, Robert (2)
Giorgi, Alessandra (2)
Lavelli, Alberto (2)
Nesson, Rebecca (2)
more
Year:
2017 (2)
2012 (3)
2010 (3)
2009 (5)
2008 (2)
2004 (3)
2003 (1)
1998 (4)
1996 (1)
1994 (3)
more
Medium:
Print (18)
Online (14)
Type
BLLDB-Access:
free (32)
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
Page:
1
2
Hits 1 – 20 of 32
1
-io Nouns through the Ages. Analysing Latin Morphological Productivity with Lemlat
Litta, Eleonora
(orcid:0000-0002-0499-997X);
Passarotti, Marco
(orcid:0000-0002-9806-7187);
Budassi, Marco
. - : aAccademia University Press, 2017. : country:ITA, 2017. : place:ROMA -- ITA, 2017
BASE
Show details
2
A little bit of bella pianura: Detecting Code-Mixing in Historical English Travel Writing
Sara, Tonelli
;
Sprugnoli, Rachele
(orcid:0000-0001-6861-5595);
Giovanni, Moretti
. - : Accademia University Press, 2017. : country:ITA, 2017. : place:Torino, Italy, 2017
BASE
Show details
3
Computation of infix probabilities for probabilistic context-free grammars
Satta, Giorgio
;
Nederhof, Mark Jan
. - : Association for Computational Linguistics, 2012
BASE
Show details
4
Splittability of bilexical context-free grammars is undecidable
Satta, Giorgio
;
Nederhof, Mark Jan
. - 2012
BASE
Show details
5
Prefix probabilities for linear context-free rewriting systems
Nederhof, Mark Jan
;
Satta, Giorgio
. - : Association for Computational Linguistics, 2012
BASE
Show details
6
Optimal rank reduction for linear context-free rewriting systems with fan-out two
Sagot, Benoît
;
Satta, Giorgio
In:
Association for Computational Linguistics. Proceedings of the conference. - Stroudsburg, Penn. : ACL
48 (2010) 1, 525-533
BLLDB
Show details
7
The importance of rule restrictions in CCG
Kuhlmann, Marco
;
Koller, Alexander
;
Satta, Giorgio
In:
Association for Computational Linguistics. Proceedings of the conference. - Stroudsburg, Penn. : ACL
48 (2010) 1, 534-543
BLLDB
Show details
8
Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar
Shieber, Stuart M.
;
Satta, Giorgio
;
Nesson, Rebecca
. - : Massachusetts Institute of Technology Press (MIT Press), 2010
BASE
Show details
9
A polynomial-time parsing algorithm for TT-MCTAG
Kallmeyer, Laura
[Verfasser];
Satta, Giorgio
[Verfasser]. - Frankfurt am Main : Universitätsbibliothek Johann Christian Senckenberg, 2009
DNB Subject Category Language
Show details
10
A polynomial-time parsing algorithm for TT-MCTAG
Kallmeyer, Laura
;
Satta, Giorgio
. - 2009
UB Frankfurt Linguistik
Show details
11
Computing Partition Functions of PCFGs
Nederhof, Mark-Jan
;
Satta, Giorgio
In:
Research on language and computation. - London : King's College
7 (2009) 2, 233
OLC Linguistik
Hide details
12
Treebank grammar techniques for non-projective dependency parsing
Kuhlmann, Marco
;
Satta, Giorgio
In:
Association for Computational Linguistics / European Chapter. Conference of the European Chapter of the Association for Computational Linguistics. - Menlo Park, Calif. : ACL
12 (2009), 478-486
BLLDB
Show details
13
Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems
Gómez-Rodríguez, Carlos
;
Kuhlmann, Marco
;
Satta, Giorgio
. - : Association for Computational Linguistics, 2009
BASE
Show details
14
Computing partition functions of PCFGs
Satta, Giorgio
;
Nederhof, Mark-Jan
In:
Research on language and computation. - London : King's College
6 (2008) 2, 139-162
BLLDB
OLC Linguistik
Show details
15
Optimal k-arization of synchronous tree-adjoining grammar
Nesson, Rebecca
;
Satta, Giorgio
;
Shieber, Stuart
. - : Association for Computational Linguistics, 2008
BASE
Show details
16
New Developments in Parsing Technology
Bunt, H
;
Carroll, John
;
Satta, Giorgio
. - Dordrecht : Springer Netherlands, 2004
UB Frankfurt Linguistik
Show details
17
New developments in parsing technology
Carroll, John
(Hrsg.);
Satta, Giorgio
(Hrsg.);
Bunt, Harry
(Hrsg.). - Dordrecht [u.a.] : Kluwer, 2004
BLLDB
UB Frankfurt Linguistik
Show details
18
The language intersection problem for non-recursive context-free grammars
Nederhof, Mark-Jan
;
Satta, Giorgio
In:
Information and computation. - Amsterdam : Elsevier
192 (2004) 2, 172-184
BLLDB
Show details
19
Partially ordered multiset context-free grammars and ID/LP parsing
Shieber, Stuart
;
Nederhof, Mark-Jan
;
Satta, Giorgio
. - : Association for Computational Linguistics, 2003
BASE
Show details
20
Optimality Theory and the Generative Complexity of Constraint Violability
Frank, Robert
;
Satta, Giorgio
In:
Computational linguistics. - Cambridge, Mass. : MIT Press
24 (1998) 2, 307-316
OLC Linguistik
Show details
Page:
1
2
Mobile view
All
Catalogues
UB Frankfurt Linguistik
3
IDS Mannheim
0
OLC Linguistik
5
UB Frankfurt Retrokatalog
0
DNB Subject Category Language
1
Institut für Empirische Sprachwissenschaft
0
Leibniz-Centre General Linguistics (ZAS)
0
Bibliographies
BLLDB
14
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
© 2013 - 2024 Lin|gu|is|tik
|
Imprint
|
Privacy Policy
|
Datenschutzeinstellungen ändern