2155 search results - page 102 / 431 » Computational Linguistics |
103
click to vote
ACL
2012
13 years 2 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...
COLING
2002
14 years 11 months ago
2002
Unification grammars are known to be Turingequivalent; given a grammar and a word
NAACL
2010
14 years 9 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...
CSLP
2004
Springer
15 years 3 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...
ACL
2010
14 years 10 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...