N Indurkhya, FJ Damerau - 2010 - taylorfrancis.com
The Handbook of Natural Language Processing, Second Edition presents practical tools and techniques for implementing natural language processing in computer systems. Along …
We assume that the tokenization of a sentence is fixed and known at parsing time. That is to say that dependency parsers will always operate on a pre-tokenized input and are not …
J Nivre, J Hall, J Nilsson, A Chanev… - Natural Language …, 2007 - cambridge.org
Parsing unrestricted text is useful for many language technology applications but requires parsing methods that are both robust and efficient. MaltParser is a language-independent …
Abstract The Conference on Computational Natural Language Learning features a shared task, in which participants train and test their learning systems on the same data sets. In …
Parsing algorithms that process the input from left to right and construct a single derivation have often been considered inadequate for natural language parsing because of the …
Originating from Facebook, LinkedIn, Twitter, Instagram, YouTube, and many other networking sites, the social media shared by users and the associated metadata are …
Machine learning based on various forms of inductive inference has been used for a wide range of problems in natural language processing, with syntactic parsing being one of the …
J Nivre - Language and Linguistics Compass, 2010 - Wiley Online Library
Dependency parsing is a form of syntactic parsing of natural language based on the theoretical tradition of dependency grammar. It has recently gained widespread interest in …