DE eng

Search in the Catalogues and Directories

Page: 1 2
Hits 1 – 20 of 35

1
Structured Sentiment Analysis as Dependency Graph Parsing ...
BASE
Show details
2
AGGREGATION
BASE
Show details
3
Transfer and Multi-Task Learning for Noun-Noun Compound Interpretation ...
BASE
Show details
4
Open SDP 1.2
Flickinger, Dan; Hajič, Jan; Ivanova, Angelina. - : Oslo University, 2017. : Charles University, 2017
BASE
Show details
5
Open SDP
Flickinger, Dan; Hajič, Jan; Ivanova, Angelina. - : Oslo University, 2016. : Charles University, 2016
BASE
Show details
6
SDP 2014 & 2015: Broad Coverage Semantic Dependency Parsing
Flickinger, Dan; Hajič, Jan; Ivanova, Angelina. - : Linguistic Data Consortium, 2016. : https://www.ldc.upenn.edu, 2016
BASE
Show details
7
SDP 2014 & 2015: Broad Coverage Semantic Dependency Parsing ...
Flickinger, Dan; Hajič, Jan; Ivanova, Angelina. - : Linguistic Data Consortium, 2016
BASE
Show details
8
Combining statistical machine translation and translation memories with domain adaptation
In: Läubli, Samuel; Fishel, Mark; Volk, Martin; Weibel, Manuela (2013). Combining statistical machine translation and translation memories with domain adaptation. In: NODALIDA 2013, Nordic Conference of Computational Linguistics, Oslo, Norway, 22 May 2013 - 24 May 2013, 331-341. (2013)
BASE
Show details
9
Bootstrapping an Unsupervised Approach for Classifying Agreement and Disagreement
Zirn, Cäcilia; Opitz, Bernd. - : Linköping Univ. Electronic Press, 2013
Abstract: People tend to have various opinions about topics. In discussions, they can either agree or disagree with another person. The recognition of agreement and disagreement is a useful prerequisite for many applications. It could be used by political scientists to measure how controversial political issues are, or help a company to analyze how well people like their new products. In this work, we develop an approach for recognizing agreement and disagreement. However, this is a challenging task. While keyword-based approaches are only able to cover a limited set of phrases, machine learning approaches require a large amount of training data. We therefore combine advantages of both methods by using a bootstrapping approach. With our completely unsupervised technique, we achieve an accuracy of 72.85%. Besides, we investigate the limitations of a keyword based approach and a machine learning approach in addition to comparing various sets of features.
Keyword: 004 Informatik
URL: https://madoc.bib.uni-mannheim.de/33246/
http://www.ep.liu.se/ecp/085/023/ecp1385023.pdf
BASE
Hide details
10
Deep open-source machine translation
In: Machine translation. - Dordrecht [u.a.] : Springer Science + Business Media 25 (2011) 2, 87-105
BLLDB
OLC Linguistik
Show details
11
Grammar engineering and linguistic hypothesis testing : computational support for complexity in syntatic analysis
In: Language from a cognitive perspective (Stanford, Calif., 2011), p. 5-30
MPI für Psycholinguistik
Show details
12
Collected papers of Martin Kay : a half century of computational linguistics : [on the occasion of Martin Kay's 75th birthday]
Flickinger, Dan (Hrsg.); Kay, Martin; Oepen, Stephan (Hrsg.). - Stanford, Calif. : CSLI Publ., Center for the Study of Language and Information, 2010
BLLDB
UB Frankfurt Linguistik
Show details
13
Exploiting semantic information for HPSG parse selection
In: Research on language and computation. - London : King's College 8 (2010) 1, 1-22
BLLDB
OLC Linguistik
Show details
14
Efficiency in unification-based N-best parsing
In: Trends in parsing technology. - Dordrecht [u.a.] : Springer (2010), 223-241
BLLDB
Show details
15
Beauty and the beast: what running a broad-coverage precision grammar over the BNC taught us about the grammar - and the corpus
In: Linguistic evidence. - Berlin [u.a.] : Mouton de Gruyter (2008), 49-69
BLLDB
Show details
16
Efficiency in unification-based n-best parsing
Oepen, Stephan; Zhang, Yi; Carroll, John. - : Association for Computational Linguistics, 2007
BASE
Show details
17
Open-Source Machine Translation with DELPH-IN
In: <Titel nicht gefunden> (2005)
UB Frankfurt Linguistik
Show details
18
Stochastic HPSG parse disambiguation using the redwoods corpus
In: Research on language and computation. - London : King's College 3 (2005) 1, 83-105
BLLDB
Show details
19
LinGO Redwoods : a rich and dynamic treebank for HPSG
In: Research on language and computation. - London : King's College 2 (2004) 4, 575-596
BLLDB
Show details
20
Measure for measure : towards increased component comparability and exchange
In: New developments in parsing technology. - Dordrecht [u.a.] : Kluwer (2004), 373-395
BLLDB
Show details

Page: 1 2

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