-
1
-
-
0003356044
-
Supertagging: An approach to almost parsing
-
S. Bangalore and A. K. Joshi. 1999. Supertagging: an approach to almost parsing. Computational Linguistics, 25(2):237-265.
-
(1999)
Computational Linguistics
, vol.25
, Issue.2
, pp. 237-265
-
-
Bangalore, S.1
Joshi, A.K.2
-
2
-
-
84860510429
-
Das NEGRAAnnotationsschema
-
Computerlinguistik
-
T. Brants, R. Hendriks, S. Kramp, B. Krenn, C. Preis, W. Skut, and H. Uszkoreit. 1997. Das NEGRAAnnotationsschema. Technical report, Universität des Saarlandes, Computerlinguistik.
-
(1997)
Technical Report, Universität des Saarlandes
-
-
Brants, T.1
Hendriks, R.2
Kramp, S.3
Krenn, B.4
Preis, C.5
Skut, W.6
Uszkoreit, H.7
-
8
-
-
84894833941
-
Constraint based integration of deep and shallow parsing techniques
-
Budapest, Hungary
-
M. Daum, K. Foth, and W. Menzel. 2003. Constraint based integration of deep and shallow parsing techniques. In Proc. 11th Conf. of the EACL, Budapest, Hungary.
-
(2003)
Proc. 11th Conf. of the EACL
-
-
Daum, M.1
Foth, K.2
Menzel, W.3
-
9
-
-
84894587902
-
Automatic transformation of phrase treebanks to dependency trees
-
Lisbon, Portugal
-
M. Daum, K. Foth, and W. Menzel. 2004. Automatic transformation of phrase treebanks to dependency trees. In Proc. 4th Int. Conf. on Language Resources and Evaluation, LREC-2004, pages 99-106, Lisbon, Portugal.
-
(2004)
Proc. 4th Int. Conf. on Language Resources and Evaluation, LREC-2004
, pp. 99-106
-
-
Daum, M.1
Foth, K.2
Menzel, W.3
-
12
-
-
26844506685
-
A broadcoverage parser for german based on defeasible constraints
-
Wien
-
K. Foth, M. Daum, and W. Menzel. 2004. A broadcoverage parser for german based on defeasible constraints. In 7. Konferenz zur Verarbeitung natürlicher Sprache, KONVENS-2004, pages 45-52,Wien.
-
(2004)
7. Konferenz Zur Verarbeitung Natürlicher Sprache, KONVENS-2004
, pp. 45-52
-
-
Foth, K.1
Daum, M.2
Menzel, W.3
-
13
-
-
80053274459
-
Non-projective dependency parsing using spanning tree algorithms
-
Vancouver, B.C
-
R. McDonald, F. Pereira, K. Ribarov, and J. Hajic. 2005. Non-projective dependency parsing using spanning tree algorithms. In Proc. Human Language Technology Conference, HLT/EMNLP-2005, Vancouver, B.C.
-
(2005)
Proc. Human Language Technology Conference, HLT/EMNLP-2005
-
-
McDonald, R.1
Pereira, F.2
Ribarov, K.3
Hajic, J.4
-
16
-
-
0040904154
-
Parsing with lexicalized tree adjoining grammar
-
M. Tomita, editor. Kluwer Academic Publishers
-
Y. Schabes and A. K. Joshi. 1991. Parsing with lexicalized tree adjoining grammar. In M. Tomita, editor, Current Issues in Parsing Technologies. Kluwer Academic Publishers.
-
(1991)
Current Issues in Parsing Technologies
-
-
Schabes, Y.1
Joshi, A.K.2
-
17
-
-
17644382165
-
Modeling dependency grammar with restricted constraints
-
I. Schröder,W. Menzel, K. Foth, and M. Schulz. 2000. Modeling dependency grammar with restricted constraints. Traitement Automatique des Langues (T.A.L.), 41(1):97-126.
-
(2000)
Traitement Automatique des Langues (T.A.L.)
, vol.41
, Issue.1
, pp. 97-126
-
-
Schröder, I.1
Menzel, W.2
Foth, K.3
Schulz, M.4
-
18
-
-
4544358964
-
The SuperARV language model: Investigating the effectiveness of tightly integrating multiple knowledge sources
-
Philadelphia, PA
-
W. Wang and M. P. Harper. 2002. The SuperARV language model: Investigating the effectiveness of tightly integrating multiple knowledge sources. In Proc. Conf. on Empirical Methods in Natural Language Processing, EMNLP-2002, pages 238-247, Philadelphia, PA.
-
(2002)
Proc. Conf. on Empirical Methods in Natural Language Processing, EMNLP-2002
, pp. 238-247
-
-
Wang, W.1
Harper, M.P.2
|