2155 search results - page 102 / 431 » Computational Linguistics |
141
Voted
ACL
2012
13 years 7 months ago
2012
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
115
click to vote
COLING
2002
15 years 4 months ago
2002
Unification grammars are known to be Turingequivalent; given a grammar and a word
91
Voted
NAACL
2010
15 years 2 months ago
2010
A number of recent articles in computational linguistics venues called for a closer examination of the type of noise present in annotated datasets used for benchmarking (Reidsma a...
132
Voted
CSLP
2004
Springer
15 years 8 months ago
2004
Springer
Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (l...
117
click to vote
ACL
2010
15 years 2 months ago
2010
The research focus of computational coreference resolution has exhibited a shift from heuristic approaches to machine learning approaches in the past decade. This paper surveys th...